A human-LLM pipeline (Co-FunSearch) finds adversarial instances for heuristics, raising the lower bound for Best-Fit bin packing in the random-order model from 1.3 to 1.5. The authors prove the 3/2 ratio analytically and report a search-found instance scoring 1.497 over 10,000 random shuffles against Packingsolver optima. Caveat: arXiv preprint; human analysis supplies the final proofs.
Technology: Co-FunSearch (FunSearch-based LLM program search)
Family FunSearch: profile · models page
Publication: Preprint · Test context: retrospective or benchmark. Catalog categories, not an evidence grade.
Result, AI contribution and limits
Evidence context (descriptions follow the cited sources; test type is a catalog classification):
- Publication status: Preprint
- Test type: retrospective or benchmark
- Tested: Human-refined FunSearch outputs were used to derive improved adversarial lower bounds for standard heuristics; the page gives no details of the bin-packing test setup.
- Still unknown: Not reported on the abstract page; the full paper is needed for the bin-packing evaluation details.
- AI role: LLM-based evolutionary search (FunSearch) supplied initial patterns, which human experts refined and extrapolated into constructions.
Evidence sources: https://arxiv.org/abs/2601.16849
Source checked · editorial details
The source page was checked against this entry. Independent confirmation is not assessed by this label.
Source type: paper. Paper: not linked in this catalog; this does not mean no paper exists.
Review scope and date are not recorded; source checked does not establish full-text review.
Editorial assessment: Impact 3/5 · Validation 2/5 · Novelty 4/5. Impact and novelty are editorial judgments; validation follows the annotated test type where one exists. Not an evidence grade. Scoring criteria.
Follow-up and relationships
No follow-up recorded; this is not a claim that no follow-up exists.
Follow-up review scope and date are not recorded.
No source-supported relationships recorded.
A language model (PaLM 2) paired with an automatic evaluator found the largest cap sets on record in some dimensions, the biggest increase in 20 years, and bin-packing heuristics using fewer bins than established methods. The problem must first be expressed as code with an evaluation procedure.
Technology: FunSearch (PaLM 2 and automatic evaluator)
Family FunSearch: profile · models page
Publication: Peer-reviewed paper · Test context: direct test. Catalog categories, not an evidence grade.
Result, AI contribution and limits
Evidence context (descriptions follow the cited sources; test type is a catalog classification):
- Publication status: Peer-reviewed paper
- Test type: direct test
- Tested: Programs were scored automatically by an evaluator; on the cap set problem they found larger cap sets than the best known, and on online bin packing their heuristics beat established baselines.
- Still unknown: The abstract does not explicitly state limitations; the blog says the method needs an automatic evaluation procedure and that the bin-packing heuristics were tailored to specific data.
- AI role: A pretrained large language model (PaLM 2) generated candidate programs in an evolutionary search guided by an automatic evaluator.
Evidence sources: https://deepmind.google/blog/funsearch-making-new-discoveries-in-mathematical-sciences-using-large-language-models/ · https://www.ebi.ac.uk/europepmc/webservices/rest/search?query=DOI:10.1038/s41586-023-06924-6&resultType=core&format=json
Source checked · editorial details
The source page was checked against this entry. Independent confirmation is not assessed by this label.
Source type: blog. Paper: linked separately.
Review scope and date are not recorded; source checked does not establish full-text review.
Citations: in the top 1% of works of the same type, year and subfield (OpenAlex work metrics, 990 citations; as of 15 Nov 2026). Attention, not a measure of correctness; not part of the score.
Editorial assessment: Impact 3/5 · Validation 3/5 · Novelty 5/5. Impact and novelty are editorial judgments; validation follows the annotated test type where one exists. Not an evidence grade. Scoring criteria.
Follow-up and relationships
No follow-up recorded; this is not a claim that no follow-up exists.
Follow-up review scope and date are not recorded.
No source-supported relationships recorded.