{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:T25MXJDT4IHXEHBKT7MQ53CQKM","short_pith_number":"pith:T25MXJDT","schema_version":"1.0","canonical_sha256":"9ebacba473e20f721c2a9fd90eec50532162547db0bca350102e12b8f677c0d7","source":{"kind":"arxiv","id":"2605.29268","version":1},"attestation_state":"computed","paper":{"title":"Compute Allocation in Evolutionary Search: From Depth-Breadth to Multi-Armed Bandits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.NE"],"primary_cat":"cs.CL","authors_text":"Aarthy Nagarajan, Haoyu He, Haozheng Luo, Kerui Wu, Sixue Xing, Tianfan Fu, Zhuo Yang","submitted_at":"2026-05-28T02:37:51Z","abstract_excerpt":"LLM-guided evolutionary search (Evolve systems) has reached state-of-the-art results on mathematical and combinatorial tasks, yet most existing systems report only the best of many runs and leave the run-to-run distribution undocumented. We ask how a fixed budget of LLM calls should be allocated, and how reliably a single run reaches the reported numbers. Sweeping the depth-breadth grid over five models and three tasks, we identify two empirical regularities: a fitness-compute envelope along which capability ordering largely collapses on effective FLOPs, and a bilinear depth-breadth fit with t"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2605.29268","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2026-05-28T02:37:51Z","cross_cats_sorted":["cs.AI","cs.LG","cs.NE"],"title_canon_sha256":"69c37e318d9f0b9b4f0809dac07d0fb878b4808e9e76f47f215ea8915c0eaa2c","abstract_canon_sha256":"86e9298c629cadd6c130b2912e1ab9d5741839f86f2972c8164fc55d0af77c0e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-29T01:05:28.158258Z","signature_b64":"Y5T7cD5fg4s4P7FNhD9oPg1ugWhmtGmFSjD6p2HiALwMof8p+cado3ewW/E23TmtLUDC3ax7LdITnHiWmQVNCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ebacba473e20f721c2a9fd90eec50532162547db0bca350102e12b8f677c0d7","last_reissued_at":"2026-05-29T01:05:28.157711Z","signature_status":"signed_v1","first_computed_at":"2026-05-29T01:05:28.157711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compute Allocation in Evolutionary Search: From Depth-Breadth to Multi-Armed Bandits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.NE"],"primary_cat":"cs.CL","authors_text":"Aarthy Nagarajan, Haoyu He, Haozheng Luo, Kerui Wu, Sixue Xing, Tianfan Fu, Zhuo Yang","submitted_at":"2026-05-28T02:37:51Z","abstract_excerpt":"LLM-guided evolutionary search (Evolve systems) has reached state-of-the-art results on mathematical and combinatorial tasks, yet most existing systems report only the best of many runs and leave the run-to-run distribution undocumented. We ask how a fixed budget of LLM calls should be allocated, and how reliably a single run reaches the reported numbers. Sweeping the depth-breadth grid over five models and three tasks, we identify two empirical regularities: a fitness-compute envelope along which capability ordering largely collapses on effective FLOPs, and a bilinear depth-breadth fit with t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.29268","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.29268/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2605.29268","created_at":"2026-05-29T01:05:28.157792+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.29268v1","created_at":"2026-05-29T01:05:28.157792+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.29268","created_at":"2026-05-29T01:05:28.157792+00:00"},{"alias_kind":"pith_short_12","alias_value":"T25MXJDT4IHX","created_at":"2026-05-29T01:05:28.157792+00:00"},{"alias_kind":"pith_short_16","alias_value":"T25MXJDT4IHXEHBK","created_at":"2026-05-29T01:05:28.157792+00:00"},{"alias_kind":"pith_short_8","alias_value":"T25MXJDT","created_at":"2026-05-29T01:05:28.157792+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/T25MXJDT4IHXEHBKT7MQ53CQKM","json":"https://pith.science/pith/T25MXJDT4IHXEHBKT7MQ53CQKM.json","graph_json":"https://pith.science/api/pith-number/T25MXJDT4IHXEHBKT7MQ53CQKM/graph.json","events_json":"https://pith.science/api/pith-number/T25MXJDT4IHXEHBKT7MQ53CQKM/events.json","paper":"https://pith.science/paper/T25MXJDT"},"agent_actions":{"view_html":"https://pith.science/pith/T25MXJDT4IHXEHBKT7MQ53CQKM","download_json":"https://pith.science/pith/T25MXJDT4IHXEHBKT7MQ53CQKM.json","view_paper":"https://pith.science/paper/T25MXJDT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.29268&json=true","fetch_graph":"https://pith.science/api/pith-number/T25MXJDT4IHXEHBKT7MQ53CQKM/graph.json","fetch_events":"https://pith.science/api/pith-number/T25MXJDT4IHXEHBKT7MQ53CQKM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T25MXJDT4IHXEHBKT7MQ53CQKM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T25MXJDT4IHXEHBKT7MQ53CQKM/action/storage_attestation","attest_author":"https://pith.science/pith/T25MXJDT4IHXEHBKT7MQ53CQKM/action/author_attestation","sign_citation":"https://pith.science/pith/T25MXJDT4IHXEHBKT7MQ53CQKM/action/citation_signature","submit_replication":"https://pith.science/pith/T25MXJDT4IHXEHBKT7MQ53CQKM/action/replication_record"}},"created_at":"2026-05-29T01:05:28.157792+00:00","updated_at":"2026-05-29T01:05:28.157792+00:00"}