{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:7TTM3WAXKJRKT7HQTV3TJH7YRT","short_pith_number":"pith:7TTM3WAX","schema_version":"1.0","canonical_sha256":"fce6cdd8175262a9fcf09d77349ff88cc6bf07f97ecdd454cfb908c2b0eb6e72","source":{"kind":"arxiv","id":"2608.00700","version":1},"attestation_state":"computed","paper":{"title":"DGA$_2$D: Directed Graph-Guided Automated Algorithm Design with Large Language Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.AI","authors_text":"Jiale Zhao, Liyuanjun Lai, Sirui Mao, Wentao Yang, Yuxiang Bai, Zimu Chen","submitted_at":"2026-08-01T14:59:38Z","abstract_excerpt":"The rapid development of Large Language Models (LLMs) has opened new avenues for Automated Heuristic Design (AHD) for solving NP-hard combinatorial optimization problems (COPs). However, existing LLM-driven AHD methods are largely confined to rigid solver templates, relegating the search process to isolated module tuning. Transitioning to fully autonomous, system-level algorithm design is essential but fraught with low reliability of generated operators, extremely large search spaces, and ineffective credit assignment. To overcome these drawbacks, this paper proposes a Directed Graph-Guided Au"},"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":"2608.00700","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-08-01T14:59:38Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"67dc939ca5b009764f7f815d41b1c33e6b8c38eebfb4377c089c0b9d616c891b","abstract_canon_sha256":"911429d564d9fd31cf4bf1c4d3d69f6424fc040ca16948a20605dc8737903efb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-04T01:54:47.253765Z","signature_b64":"VfvsL+B/OdD/N1kK0j6xrNjNbidpY+QuGv1HVdOZ++MUQSdGWu+y1D8hFqsre+usnAX3mkGE7Dqs3DDaXvcaBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fce6cdd8175262a9fcf09d77349ff88cc6bf07f97ecdd454cfb908c2b0eb6e72","last_reissued_at":"2026-08-04T01:54:47.252237Z","signature_status":"signed_v1","first_computed_at":"2026-08-04T01:54:47.252237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DGA$_2$D: Directed Graph-Guided Automated Algorithm Design with Large Language Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.AI","authors_text":"Jiale Zhao, Liyuanjun Lai, Sirui Mao, Wentao Yang, Yuxiang Bai, Zimu Chen","submitted_at":"2026-08-01T14:59:38Z","abstract_excerpt":"The rapid development of Large Language Models (LLMs) has opened new avenues for Automated Heuristic Design (AHD) for solving NP-hard combinatorial optimization problems (COPs). However, existing LLM-driven AHD methods are largely confined to rigid solver templates, relegating the search process to isolated module tuning. Transitioning to fully autonomous, system-level algorithm design is essential but fraught with low reliability of generated operators, extremely large search spaces, and ineffective credit assignment. To overcome these drawbacks, this paper proposes a Directed Graph-Guided Au"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.00700","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/2608.00700/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":"2608.00700","created_at":"2026-08-04T01:54:47.253528+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.00700v1","created_at":"2026-08-04T01:54:47.253528+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.00700","created_at":"2026-08-04T01:54:47.253528+00:00"},{"alias_kind":"pith_short_12","alias_value":"7TTM3WAXKJRK","created_at":"2026-08-04T01:54:47.253528+00:00"},{"alias_kind":"pith_short_16","alias_value":"7TTM3WAXKJRKT7HQ","created_at":"2026-08-04T01:54:47.253528+00:00"},{"alias_kind":"pith_short_8","alias_value":"7TTM3WAX","created_at":"2026-08-04T01:54:47.253528+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/7TTM3WAXKJRKT7HQTV3TJH7YRT","json":"https://pith.science/pith/7TTM3WAXKJRKT7HQTV3TJH7YRT.json","graph_json":"https://pith.science/api/pith-number/7TTM3WAXKJRKT7HQTV3TJH7YRT/graph.json","events_json":"https://pith.science/api/pith-number/7TTM3WAXKJRKT7HQTV3TJH7YRT/events.json","paper":"https://pith.science/paper/7TTM3WAX"},"agent_actions":{"view_html":"https://pith.science/pith/7TTM3WAXKJRKT7HQTV3TJH7YRT","download_json":"https://pith.science/pith/7TTM3WAXKJRKT7HQTV3TJH7YRT.json","view_paper":"https://pith.science/paper/7TTM3WAX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.00700&json=true","fetch_graph":"https://pith.science/api/pith-number/7TTM3WAXKJRKT7HQTV3TJH7YRT/graph.json","fetch_events":"https://pith.science/api/pith-number/7TTM3WAXKJRKT7HQTV3TJH7YRT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7TTM3WAXKJRKT7HQTV3TJH7YRT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7TTM3WAXKJRKT7HQTV3TJH7YRT/action/storage_attestation","attest_author":"https://pith.science/pith/7TTM3WAXKJRKT7HQTV3TJH7YRT/action/author_attestation","sign_citation":"https://pith.science/pith/7TTM3WAXKJRKT7HQTV3TJH7YRT/action/citation_signature","submit_replication":"https://pith.science/pith/7TTM3WAXKJRKT7HQTV3TJH7YRT/action/replication_record"}},"created_at":"2026-08-04T01:54:47.253528+00:00","updated_at":"2026-08-04T01:54:47.253528+00:00"}