{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:VBVVA2C36GIXXKSWKC4WTN4UXR","short_pith_number":"pith:VBVVA2C3","schema_version":"1.0","canonical_sha256":"a86b50685bf1917baa5650b969b794bc4867578584ed19e6e4eb9b1fbe680a14","source":{"kind":"arxiv","id":"2506.15196","version":2},"attestation_state":"computed","paper":{"title":"HeurAgenix: Leveraging LLMs for Solving Complex Combinatorial Optimization Challenges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Haolong Qian, Jiang Bian, Lei Song, Ling Zhang, Xianliang Yang","submitted_at":"2025-06-18T07:20:01Z","abstract_excerpt":"Heuristic algorithms play a vital role in solving combinatorial optimization (CO) problems, yet traditional designs depend heavily on manual expertise and struggle to generalize across diverse instances. We introduce \\textbf{HeurAgenix}, a two-stage hyper-heuristic framework powered by large language models (LLMs) that first evolves heuristics and then selects among them automatically. In the heuristic evolution phase, HeurAgenix leverages an LLM to compare seed heuristic solutions with higher-quality solutions and extract reusable evolution strategies. During problem solving, it dynamically p"},"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":"2506.15196","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2025-06-18T07:20:01Z","cross_cats_sorted":[],"title_canon_sha256":"c6e6832ddb7e3d26303264d279a812c65ef3f35f7d51af1fc78f5b1d7453f528","abstract_canon_sha256":"258f86d3138c981f3f6cc00efb324da40e7f166f10996b8325a6dd16d807e31c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:26:32.164831Z","signature_b64":"Kx/G/8CEb9kOH/myqMcgC2MH3sAfWXR40YonVpfWXN6bsooZKm+1JOKQAPCEn8CTqEIXr05eorKK9unFbeRKDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a86b50685bf1917baa5650b969b794bc4867578584ed19e6e4eb9b1fbe680a14","last_reissued_at":"2026-07-05T11:26:32.164421Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:26:32.164421Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"HeurAgenix: Leveraging LLMs for Solving Complex Combinatorial Optimization Challenges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Haolong Qian, Jiang Bian, Lei Song, Ling Zhang, Xianliang Yang","submitted_at":"2025-06-18T07:20:01Z","abstract_excerpt":"Heuristic algorithms play a vital role in solving combinatorial optimization (CO) problems, yet traditional designs depend heavily on manual expertise and struggle to generalize across diverse instances. We introduce \\textbf{HeurAgenix}, a two-stage hyper-heuristic framework powered by large language models (LLMs) that first evolves heuristics and then selects among them automatically. In the heuristic evolution phase, HeurAgenix leverages an LLM to compare seed heuristic solutions with higher-quality solutions and extract reusable evolution strategies. During problem solving, it dynamically p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.15196","kind":"arxiv","version":2},"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/2506.15196/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":"2506.15196","created_at":"2026-07-05T11:26:32.164481+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.15196v2","created_at":"2026-07-05T11:26:32.164481+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.15196","created_at":"2026-07-05T11:26:32.164481+00:00"},{"alias_kind":"pith_short_12","alias_value":"VBVVA2C36GIX","created_at":"2026-07-05T11:26:32.164481+00:00"},{"alias_kind":"pith_short_16","alias_value":"VBVVA2C36GIXXKSW","created_at":"2026-07-05T11:26:32.164481+00:00"},{"alias_kind":"pith_short_8","alias_value":"VBVVA2C3","created_at":"2026-07-05T11:26:32.164481+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.27369","citing_title":"Reinforcement Learning without Ground-Truth Solutions can Improve LLMs","ref_index":36,"is_internal_anchor":false},{"citing_arxiv_id":"2607.00604","citing_title":"Vehicle Routing Problem Meets Large Language Models: An Overview and Perspectives","ref_index":59,"is_internal_anchor":false},{"citing_arxiv_id":"2605.20849","citing_title":"Large Language Models for Operations Research: A Comprehensive Survey","ref_index":124,"is_internal_anchor":false},{"citing_arxiv_id":"2605.09186","citing_title":"Agentic MIP Research: Accelerated Constraint Handler Generation","ref_index":19,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VBVVA2C36GIXXKSWKC4WTN4UXR","json":"https://pith.science/pith/VBVVA2C36GIXXKSWKC4WTN4UXR.json","graph_json":"https://pith.science/api/pith-number/VBVVA2C36GIXXKSWKC4WTN4UXR/graph.json","events_json":"https://pith.science/api/pith-number/VBVVA2C36GIXXKSWKC4WTN4UXR/events.json","paper":"https://pith.science/paper/VBVVA2C3"},"agent_actions":{"view_html":"https://pith.science/pith/VBVVA2C36GIXXKSWKC4WTN4UXR","download_json":"https://pith.science/pith/VBVVA2C36GIXXKSWKC4WTN4UXR.json","view_paper":"https://pith.science/paper/VBVVA2C3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.15196&json=true","fetch_graph":"https://pith.science/api/pith-number/VBVVA2C36GIXXKSWKC4WTN4UXR/graph.json","fetch_events":"https://pith.science/api/pith-number/VBVVA2C36GIXXKSWKC4WTN4UXR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VBVVA2C36GIXXKSWKC4WTN4UXR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VBVVA2C36GIXXKSWKC4WTN4UXR/action/storage_attestation","attest_author":"https://pith.science/pith/VBVVA2C36GIXXKSWKC4WTN4UXR/action/author_attestation","sign_citation":"https://pith.science/pith/VBVVA2C36GIXXKSWKC4WTN4UXR/action/citation_signature","submit_replication":"https://pith.science/pith/VBVVA2C36GIXXKSWKC4WTN4UXR/action/replication_record"}},"created_at":"2026-07-05T11:26:32.164481+00:00","updated_at":"2026-07-05T11:26:32.164481+00:00"}