{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:VBVVA2C36GIXXKSWKC4WTN4UXR","short_pith_number":"pith:VBVVA2C3","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"},"canonical_sha256":"a86b50685bf1917baa5650b969b794bc4867578584ed19e6e4eb9b1fbe680a14","source":{"kind":"arxiv","id":"2506.15196","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.15196","created_at":"2026-07-05T11:26:32Z"},{"alias_kind":"arxiv_version","alias_value":"2506.15196v2","created_at":"2026-07-05T11:26:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.15196","created_at":"2026-07-05T11:26:32Z"},{"alias_kind":"pith_short_12","alias_value":"VBVVA2C36GIX","created_at":"2026-07-05T11:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"VBVVA2C36GIXXKSW","created_at":"2026-07-05T11:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"VBVVA2C3","created_at":"2026-07-05T11:26:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:VBVVA2C36GIXXKSWKC4WTN4UXR","target":"record","payload":{"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"},"canonical_sha256":"a86b50685bf1917baa5650b969b794bc4867578584ed19e6e4eb9b1fbe680a14","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"},"source_kind":"arxiv","source_id":"2506.15196","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:26:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xPJ7KCE9xSrC0GOO/itICLua6E/hfm95w+OpZp8/7QWrbi52bqQFVydyP+0IXG9sO1S9ch0IOevO0TglZl0gBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T08:48:05.911912Z"},"content_sha256":"b1addc24c8d8a3040fb457b28becc5a7492529a2bb2d55d2ead84d676755908d","schema_version":"1.0","event_id":"sha256:b1addc24c8d8a3040fb457b28becc5a7492529a2bb2d55d2ead84d676755908d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:VBVVA2C36GIXXKSWKC4WTN4UXR","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:26:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oKtaPhpQPsuVWk6FqRUeJH1JM4WWcjVVVPo3EHCRnU5w3L24Ci/enkn/Aj5yQV/SHeiYOBCot9Nh3I48/gjVDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T08:48:05.912412Z"},"content_sha256":"57fc31c27848befe5d3fb5f019867c79a348a9ded2ee7cddaa3ce835ef6acf4d","schema_version":"1.0","event_id":"sha256:57fc31c27848befe5d3fb5f019867c79a348a9ded2ee7cddaa3ce835ef6acf4d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VBVVA2C36GIXXKSWKC4WTN4UXR/bundle.json","state_url":"https://pith.science/pith/VBVVA2C36GIXXKSWKC4WTN4UXR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VBVVA2C36GIXXKSWKC4WTN4UXR/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-08T08:48:05Z","links":{"resolver":"https://pith.science/pith/VBVVA2C36GIXXKSWKC4WTN4UXR","bundle":"https://pith.science/pith/VBVVA2C36GIXXKSWKC4WTN4UXR/bundle.json","state":"https://pith.science/pith/VBVVA2C36GIXXKSWKC4WTN4UXR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VBVVA2C36GIXXKSWKC4WTN4UXR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:VBVVA2C36GIXXKSWKC4WTN4UXR","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"258f86d3138c981f3f6cc00efb324da40e7f166f10996b8325a6dd16d807e31c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2025-06-18T07:20:01Z","title_canon_sha256":"c6e6832ddb7e3d26303264d279a812c65ef3f35f7d51af1fc78f5b1d7453f528"},"schema_version":"1.0","source":{"id":"2506.15196","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.15196","created_at":"2026-07-05T11:26:32Z"},{"alias_kind":"arxiv_version","alias_value":"2506.15196v2","created_at":"2026-07-05T11:26:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.15196","created_at":"2026-07-05T11:26:32Z"},{"alias_kind":"pith_short_12","alias_value":"VBVVA2C36GIX","created_at":"2026-07-05T11:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"VBVVA2C36GIXXKSW","created_at":"2026-07-05T11:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"VBVVA2C3","created_at":"2026-07-05T11:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:57fc31c27848befe5d3fb5f019867c79a348a9ded2ee7cddaa3ce835ef6acf4d","target":"graph","created_at":"2026-07-05T11:26:32Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2506.15196/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Haolong Qian, Jiang Bian, Lei Song, Ling Zhang, Xianliang Yang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2025-06-18T07:20:01Z","title":"HeurAgenix: Leveraging LLMs for Solving Complex Combinatorial Optimization Challenges"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.15196","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b1addc24c8d8a3040fb457b28becc5a7492529a2bb2d55d2ead84d676755908d","target":"record","created_at":"2026-07-05T11:26:32Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"258f86d3138c981f3f6cc00efb324da40e7f166f10996b8325a6dd16d807e31c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2025-06-18T07:20:01Z","title_canon_sha256":"c6e6832ddb7e3d26303264d279a812c65ef3f35f7d51af1fc78f5b1d7453f528"},"schema_version":"1.0","source":{"id":"2506.15196","kind":"arxiv","version":2}},"canonical_sha256":"a86b50685bf1917baa5650b969b794bc4867578584ed19e6e4eb9b1fbe680a14","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a86b50685bf1917baa5650b969b794bc4867578584ed19e6e4eb9b1fbe680a14","first_computed_at":"2026-07-05T11:26:32.164421Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:26:32.164421Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Kx/G/8CEb9kOH/myqMcgC2MH3sAfWXR40YonVpfWXN6bsooZKm+1JOKQAPCEn8CTqEIXr05eorKK9unFbeRKDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:26:32.164831Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.15196","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b1addc24c8d8a3040fb457b28becc5a7492529a2bb2d55d2ead84d676755908d","sha256:57fc31c27848befe5d3fb5f019867c79a348a9ded2ee7cddaa3ce835ef6acf4d"],"state_sha256":"5d954af775e9890a707cf6dd57cbc0519f949f356984bf66ec7026f4b0c3977b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vqtcVEh+4YeIX3mOWl8Aiz3GHS7w71IjsWpog2EL18KBR+OxZbSyDteYVerBkkWUJr9S+clwEMGIe8jXwNHdAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T08:48:05.917346Z","bundle_sha256":"44566ef0c86025e2d4c46dbd620c96c1a217b89d70c4c10f33c37606020efcea"}}