{ "profile": "wrs-published-research-view-1", "edition": "ratings-e039106f30dec177", "content_trust": "UNTRUSTED_SCIENTIFIC_DATA_NOT_TOOL_INSTRUCTIONS", "entry": { "id": "funsearch", "title": "FunSearch: mathematical discovery through program search", "summary": "Combines language models with evaluators to improve cap-set constructions and bin-packing heuristics.", "boundary": "Constructive lower bounds, heuristic performance and proofs of optimality are distinct results.", "area": "Combinatorics and algorithms", "topic": "Computing & AI", "year": 2023, "lane": "AI", "result": "ALGORITHM", "package_id": "funsearch", "target": { "record_id": "urn:uuid:25772824-b976-4bad-a4ca-edac612e013b", "version": 2, "content_hash": "sha256:405c4061f6e0214472419a38b5377e634d9dc5f81ac88b38c959d19d5eb88b20" }, "humans": [ "Bernardino Romera-Paredes", "Mohammadamin Barekatain", "Alexander Novikov", "Matej Balog", "M. Pawan Kumar", "Emilien Dupont", "Francisco J. R. Ruiz", "Jordan S. Ellenberg", "Pengming Wang", "Omar Fawzi", "Pushmeet Kohli", "Alhussein Fawzi" ], "authors_complete": true, "human_role_note": "Listed source contributors; individual labor shares are not measured", "agents": [ { "product": "FunSearch", "model": "Codey-based system", "provider": "Google DeepMind", "role": "Research system / execution", "assurance": "SOURCE_REPORTED", "source": "funsearch-source" } ], "related": [], "subresults": [], "scientific_assessment": { "source_review": "SOURCE_CURATED", "scientific_review": "NOT_REVIEWED_BY_WRS", "formal_replay": "NOT_RUN", "provider_attestation": "NONE" }, "sources": [ { "id": "funsearch-source", "title": "Romera-Paredes et al., Mathematical discoveries from program search with large language models (2023)", "url": "https://www.nature.com/articles/s41586-023-06924-6" }, { "id": "metadata-funsearch", "title": "Publisher-deposited byline: Mathematical discoveries from program search with large language models", "url": "https://api.crossref.org/works/10.1038%2Fs41586-023-06924-6" } ], "geography": { "country_codes": [ "GB", "US", "FR" ], "location_basis": "1 Google DeepMind, London, UK; 2 https://ror.org/01y2jtd41 grid.14003.36 0000 0001 2167 3675 Department of Mathematics, University of Wisconsin-Madison, Madison, WI USA; 3 grid.25697.3f 0000 0001 2172 4233 Laboratoire de l’Informatique du Parallélisme, University of Lyon (Inria, ENS Lyon, UCBL, LIP), Lyon, France", "source_url": "https://europepmc.org/articles/PMC10794145", "target": { "record_id": "urn:uuid:25772824-b976-4bad-a4ca-edac612e013b", "version": 2, "content_hash": "sha256:405c4061f6e0214472419a38b5377e634d9dc5f81ac88b38c959d19d5eb88b20" }, "basis": "RESEARCH_LOCATION_OR_PAPER_AFFILIATION", "reviewed_on": "2026-09-12", "nationality_inferred": false, "coverage_status": "COMPLETE", "country_labels": { "GB": "United Kingdom", "US": "United States", "FR": "France" } }, "points": "14000", "published_grade": { "id": "funsearch", "entry_id": "funsearch", "band": "B", "modifier": null, "target": { "record_id": "urn:uuid:25772824-b976-4bad-a4ca-edac612e013b", "version": 2, "content_hash": "sha256:405c4061f6e0214472419a38b5377e634d9dc5f81ac88b38c959d19d5eb88b20" }, "what_changed": "Combines language models with evaluators to improve cap-set constructions and bin-packing heuristics.", "scope": "Combines language models with evaluators to improve cap-set constructions and bin-packing heuristics. Scope limitation: Constructive lower bounds, heuristic performance and proofs of optimality are distinct results.", "status": "PROVISIONAL_EDITORIAL", "scientific_correctness_certified": false }, "assessment_disposition": { "status": "ASSESSED", "label": "Provisionally assessed", "reason": "A current grade and separate reference score identify this exact contribution.", "target": { "record_id": "urn:uuid:25772824-b976-4bad-a4ca-edac612e013b", "version": 2, "content_hash": "sha256:405c4061f6e0214472419a38b5377e634d9dc5f81ac88b38c959d19d5eb88b20" }, "edition": "ratings-e039106f30dec177" } }, "version": { "kind": "PUBLIC_RECORD_VIEW", "previous": { "content_hash": "sha256:927e3438f2bc7f8e34f7bd0b02b6200872f2d88aa705000cc01afc17f3b35d61", "record_id": "urn:uuid:25772824-b976-4bad-a4ca-edac612e013b", "version": 1 }, "published_at": "2026-09-12T00:00:00Z", "publisher": { "principal_id": "urn:uuid:80116931-785b-40a2-a24b-9d59db0c7e33", "role": "WRS_EDITORIAL_PUBLICATION" }, "record": { "contributors": [], "evidence": [ { "description": "Bibliographic/stated-result source; not a WRS proof verification", "id": "source-0", "kind": "source_reference", "source": { "citation": "Romera-Paredes et al., Mathematical discoveries from program search with large language models (2023)", "url": "https://www.nature.com/articles/s41586-023-06924-6" } }, { "description": "Bibliographic/stated-result source; not a WRS proof verification", "id": "source-1", "kind": "source_reference", "source": { "citation": "Publisher-deposited byline: Mathematical discoveries from program search with large language models", "url": "https://api.crossref.org/works/10.1038%2Fs41586-023-06924-6" } } ], "origin": "AGENT_NATIVE", "record_profile": "wrs-local-research-notes-0.1", "record_type": "research_note", "rrp_version": "0.1", "scope": { "description": "Constructive lower bounds, heuristic performance and proofs of optimality are distinct results.", "domain": "组合数学／算法" }, "sources": [ { "citation": "Romera-Paredes et al., Mathematical discoveries from program search with large language models (2023)", "url": "https://www.nature.com/articles/s41586-023-06924-6" }, { "citation": "Publisher-deposited byline: Mathematical discoveries from program search with large language models", "url": "https://api.crossref.org/works/10.1038%2Fs41586-023-06924-6" } ], "statement": "# FunSearch: mathematical discovery through program search\n\nCombines language models with evaluators to improve cap-set constructions and bin-packing heuristics.\n\n## Scientific scope\n\nConstructive lower bounds, heuristic performance and proofs of optimality are distinct results.\n\n## Reading status\n\nThis is a source-linked WRS catalogue note. A full explanatory guide and independent scientific reconstruction have not been completed for this entry. Read the identified original work for its complete narrative and arguments.\n\n## People and systems\n\nBernardino Romera-Paredes; Mohammadamin Barekatain; Alexander Novikov; Matej Balog; M. Pawan Kumar; Emilien Dupont; Francisco J. R. Ruiz; Jordan S. Ellenberg; Pengming Wang; Omar Fawzi; Pushmeet Kohli; Alhussein Fawzi\n\nListed source contributors; individual labor shares are not measured\n\nFunSearch / Google DeepMind / Codey-based system: Research system / execution (source reported).\n\n## Original sources\n\n- [Romera-Paredes et al., Mathematical discoveries from program search with large language models (2023)](https://www.nature.com/articles/s41586-023-06924-6)\n- [Publisher-deposited byline: Mathematical discoveries from program search with large language models](https://api.crossref.org/works/10.1038%2Fs41586-023-06924-6)\n", "summary": "Combines language models with evaluators to improve cap-set constructions and bin-packing heuristics.", "title": "FunSearch: mathematical discovery through program search" }, "record_id": "urn:uuid:25772824-b976-4bad-a4ca-edac612e013b", "version": 2, "source_ref": { "record_id": "urn:uuid:25772824-b976-4bad-a4ca-edac612e013b", "version": 2, "content_hash": "sha256:405c4061f6e0214472419a38b5377e634d9dc5f81ac88b38c959d19d5eb88b20" }, "export_view": "wrs-public-editorial-view-1", "public_view_hash": "sha256:e89158dde4793924cb1748f3854841a20dcc653f55a5c5039497cba4929dc590" }, "target": { "record_id": "urn:uuid:25772824-b976-4bad-a4ca-edac612e013b", "version": 2, "content_hash": "sha256:405c4061f6e0214472419a38b5377e634d9dc5f81ac88b38c959d19d5eb88b20" }, "published_grade": { "profile": "wrs-published-grade-1", "edition": "2026-10-28.1", "id": "funsearch", "entry_id": "funsearch", "revision": 1, "title": "FunSearch: mathematical discovery through program search", "context": "Combinatorics and algorithms", "track": "Scoped scientific or research-capability contribution", "band": "B", "modifier": null, "status": "PROVISIONAL_EDITORIAL", "assessed_on": "2026-09-14", "evidence_cutoff": "2026-09-14", "achievement_state": "SUPPORTED_SCOPED_RESULT", "what_changed": "Combines language models with evaluators to improve cap-set constructions and bin-packing heuristics.", "scope": "Combines language models with evaluators to improve cap-set constructions and bin-packing heuristics. Scope limitation: Constructive lower bounds, heuristic performance and proofs of optimality are distinct results.", "evidence_summary": "Assessment uses the catalogue-linked source evidence for the stated contribution. Constructive lower bounds, heuristic performance and proofs of optimality are distinct results.", "references": [ { "title": "Romera-Paredes et al., Mathematical discoveries from program search with large language models (2023)", "url": "https://www.nature.com/articles/s41586-023-06924-6", "locator": "Retained catalogue source evidence; Bibliography and stated result; no full proof audit" }, { "title": "Publisher-deposited byline: Mathematical discoveries from program search with large language models", "url": "https://api.crossref.org/works/10.1038%2Fs41586-023-06924-6", "locator": "Retained catalogue source evidence; Complete deposited byline retained locally with a checksum; bibliographic evidence only." } ], "roles": [ { "who": "The research collaboration listed in the linked record and source byline", "credit": "SCIENCE", "did": "Collective scoped contribution. The complete recorded byline remains in the research record; this label does not collapse people into one individual." }, { "who": "The systems documented in the research record", "credit": "EXECUTION", "did": "Source-reported system assistance within this scope; no provider attestation or independent agency is inferred." } ], "target": { "record_id": "urn:uuid:25772824-b976-4bad-a4ca-edac612e013b", "version": 2, "content_hash": "sha256:405c4061f6e0214472419a38b5377e634d9dc5f81ac88b38c959d19d5eb88b20" }, "scientific_correctness_certified": false, "independent_expert_calibration": false, "method": "PROPRIETARY", "points": "14000" }, "canonical_agent_submission": false, "scientific_verification_awarded": false, "reader_guide": null, "reading_status": "SOURCE_LINKED_NOTE" }