{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:JUZXJEIKXFUQVV2HBXPMMVLOXL","short_pith_number":"pith:JUZXJEIK","schema_version":"1.0","canonical_sha256":"4d3374910ab9690ad7470ddec6556ebae9f2b011723f3354bc74f0d39b80b80f","source":{"kind":"arxiv","id":"2509.07367","version":1},"attestation_state":"computed","paper":{"title":"Autonomous Code Evolution Meets NP-Completeness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.LO"],"primary_cat":"cs.AI","authors_text":"Chia-Tung Ho, Cunxi Yu, Haoxing Ren, Rongjian Liang","submitted_at":"2025-09-09T03:28:06Z","abstract_excerpt":"Large language models (LLMs) have recently shown strong coding abilities, enabling not only static code generation but also iterative code self-evolving through agentic frameworks. Recently, AlphaEvolve \\cite{novikov2025alphaevolve} demonstrated that LLM-based coding agents can autonomously improve algorithms and surpass human experts, with scopes limited to isolated kernels spanning hundreds of lines of code. Inspired by AlphaEvolve, we present SATLUTION, the first framework to extend LLM-based code evolution to the full repository scale, encompassing hundreds of files and tens of thousands o"},"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":"2509.07367","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2025-09-09T03:28:06Z","cross_cats_sorted":["cs.LG","cs.LO"],"title_canon_sha256":"fc5bcb711bfdba35474109943e92e4711602f5387d7c7e65b33860a6e5aaaa50","abstract_canon_sha256":"49d04476e96d8a3bf57711ad493a3956b4ae37f9e2d653895a82c05b0afbad67"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:07:20.396166Z","signature_b64":"bzmZfPU/ty1U+ad+fEsjoxi6esWAEnzSI16qlVhK/riqhxi5uBTN1ioP8veZ/8RO8r4zfDGYA0rbIrFmyfvODw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d3374910ab9690ad7470ddec6556ebae9f2b011723f3354bc74f0d39b80b80f","last_reissued_at":"2026-07-05T12:07:20.395659Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:07:20.395659Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Autonomous Code Evolution Meets NP-Completeness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.LO"],"primary_cat":"cs.AI","authors_text":"Chia-Tung Ho, Cunxi Yu, Haoxing Ren, Rongjian Liang","submitted_at":"2025-09-09T03:28:06Z","abstract_excerpt":"Large language models (LLMs) have recently shown strong coding abilities, enabling not only static code generation but also iterative code self-evolving through agentic frameworks. Recently, AlphaEvolve \\cite{novikov2025alphaevolve} demonstrated that LLM-based coding agents can autonomously improve algorithms and surpass human experts, with scopes limited to isolated kernels spanning hundreds of lines of code. Inspired by AlphaEvolve, we present SATLUTION, the first framework to extend LLM-based code evolution to the full repository scale, encompassing hundreds of files and tens of thousands o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.07367","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/2509.07367/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":"2509.07367","created_at":"2026-07-05T12:07:20.395702+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.07367v1","created_at":"2026-07-05T12:07:20.395702+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.07367","created_at":"2026-07-05T12:07:20.395702+00:00"},{"alias_kind":"pith_short_12","alias_value":"JUZXJEIKXFUQ","created_at":"2026-07-05T12:07:20.395702+00:00"},{"alias_kind":"pith_short_16","alias_value":"JUZXJEIKXFUQVV2H","created_at":"2026-07-05T12:07:20.395702+00:00"},{"alias_kind":"pith_short_8","alias_value":"JUZXJEIK","created_at":"2026-07-05T12:07:20.395702+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":9,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.26728","citing_title":"Scientific discovery as meta-optimization: a combinatorial optimization case study","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2606.28279","citing_title":"Agentic Hardware Design as Repository-Level Code Evolution","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2605.31049","citing_title":"Learning to Solve and Optimize by Evolving Code","ref_index":44,"is_internal_anchor":false},{"citing_arxiv_id":"2605.16379","citing_title":"An Information-Theoretic Criterion for Efficient Data Synthesis","ref_index":39,"is_internal_anchor":false},{"citing_arxiv_id":"2604.03232","citing_title":"IC3-Evolve: Proof-/Witness-Gated Offline LLM-Driven Heuristic Evolution for IC3 Hardware Model Checking","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2603.26499","citing_title":"AIRA_2: Overcoming Bottlenecks in AI Research Agents","ref_index":22,"is_internal_anchor":false},{"citing_arxiv_id":"2604.22234","citing_title":"GR-Evolve: Design-Adaptive Global Routing via LLM-Driven Algorithm Evolution","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2604.14237","citing_title":"TOPCELL: Topology Optimization of Standard Cell via LLMs","ref_index":41,"is_internal_anchor":false},{"citing_arxiv_id":"2604.15082","citing_title":"Autonomous Evolution of EDA Tools: Multi-Agent Self-Evolved ABC","ref_index":29,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JUZXJEIKXFUQVV2HBXPMMVLOXL","json":"https://pith.science/pith/JUZXJEIKXFUQVV2HBXPMMVLOXL.json","graph_json":"https://pith.science/api/pith-number/JUZXJEIKXFUQVV2HBXPMMVLOXL/graph.json","events_json":"https://pith.science/api/pith-number/JUZXJEIKXFUQVV2HBXPMMVLOXL/events.json","paper":"https://pith.science/paper/JUZXJEIK"},"agent_actions":{"view_html":"https://pith.science/pith/JUZXJEIKXFUQVV2HBXPMMVLOXL","download_json":"https://pith.science/pith/JUZXJEIKXFUQVV2HBXPMMVLOXL.json","view_paper":"https://pith.science/paper/JUZXJEIK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.07367&json=true","fetch_graph":"https://pith.science/api/pith-number/JUZXJEIKXFUQVV2HBXPMMVLOXL/graph.json","fetch_events":"https://pith.science/api/pith-number/JUZXJEIKXFUQVV2HBXPMMVLOXL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JUZXJEIKXFUQVV2HBXPMMVLOXL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JUZXJEIKXFUQVV2HBXPMMVLOXL/action/storage_attestation","attest_author":"https://pith.science/pith/JUZXJEIKXFUQVV2HBXPMMVLOXL/action/author_attestation","sign_citation":"https://pith.science/pith/JUZXJEIKXFUQVV2HBXPMMVLOXL/action/citation_signature","submit_replication":"https://pith.science/pith/JUZXJEIKXFUQVV2HBXPMMVLOXL/action/replication_record"}},"created_at":"2026-07-05T12:07:20.395702+00:00","updated_at":"2026-07-05T12:07:20.395702+00:00"}