{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:4QJUZTXOKIK6UETG6QPXQPJN25","short_pith_number":"pith:4QJUZTXO","schema_version":"1.0","canonical_sha256":"e4134cceee5215ea1266f41f783d2dd74b208095e0742ddbff8439d0ec5f8f2f","source":{"kind":"arxiv","id":"2309.14032","version":2},"attestation_state":"computed","paper":{"title":"DeepACO: Neural-enhanced Ant Systems for Combinatorial Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.NE","authors_text":"Haoran Ye, Helan Liang, Jiarui Wang, Yong Li, Zhiguang Cao","submitted_at":"2023-09-25T10:56:38Z","abstract_excerpt":"Ant Colony Optimization (ACO) is a meta-heuristic algorithm that has been successfully applied to various Combinatorial Optimization Problems (COPs). Traditionally, customizing ACO for a specific problem requires the expert design of knowledge-driven heuristics. In this paper, we propose DeepACO, a generic framework that leverages deep reinforcement learning to automate heuristic designs. DeepACO serves to strengthen the heuristic measures of existing ACO algorithms and dispense with laborious manual design in future ACO applications. As a neural-enhanced meta-heuristic, DeepACO consistently 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":"2309.14032","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2023-09-25T10:56:38Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"d6a45e36ea64090bcc0a294affb8635f4f3a11bb0b91cb921e2d156a48cd23b7","abstract_canon_sha256":"86480b2c63f75963f6c6a4de81ae34dfe8a82562b3b6f1853a69fab9fa3615de"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:09:01.836865Z","signature_b64":"TsiwtdYej9h1GfOnuhaIwTYEe8wdKLzkYS7xWFxkx3kI4RLimc/edZE6ATkSk8q1rBRmRGQiaTmhyq2RWGt9BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4134cceee5215ea1266f41f783d2dd74b208095e0742ddbff8439d0ec5f8f2f","last_reissued_at":"2026-07-05T07:09:01.836379Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:09:01.836379Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DeepACO: Neural-enhanced Ant Systems for Combinatorial Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.NE","authors_text":"Haoran Ye, Helan Liang, Jiarui Wang, Yong Li, Zhiguang Cao","submitted_at":"2023-09-25T10:56:38Z","abstract_excerpt":"Ant Colony Optimization (ACO) is a meta-heuristic algorithm that has been successfully applied to various Combinatorial Optimization Problems (COPs). Traditionally, customizing ACO for a specific problem requires the expert design of knowledge-driven heuristics. In this paper, we propose DeepACO, a generic framework that leverages deep reinforcement learning to automate heuristic designs. DeepACO serves to strengthen the heuristic measures of existing ACO algorithms and dispense with laborious manual design in future ACO applications. As a neural-enhanced meta-heuristic, DeepACO consistently o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.14032","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/2309.14032/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":"2309.14032","created_at":"2026-07-05T07:09:01.836437+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.14032v2","created_at":"2026-07-05T07:09:01.836437+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.14032","created_at":"2026-07-05T07:09:01.836437+00:00"},{"alias_kind":"pith_short_12","alias_value":"4QJUZTXOKIK6","created_at":"2026-07-05T07:09:01.836437+00:00"},{"alias_kind":"pith_short_16","alias_value":"4QJUZTXOKIK6UETG","created_at":"2026-07-05T07:09:01.836437+00:00"},{"alias_kind":"pith_short_8","alias_value":"4QJUZTXO","created_at":"2026-07-05T07:09:01.836437+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.19278","citing_title":"Pheromone-based Learning of Optimal Reasoning Paths","ref_index":27,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4QJUZTXOKIK6UETG6QPXQPJN25","json":"https://pith.science/pith/4QJUZTXOKIK6UETG6QPXQPJN25.json","graph_json":"https://pith.science/api/pith-number/4QJUZTXOKIK6UETG6QPXQPJN25/graph.json","events_json":"https://pith.science/api/pith-number/4QJUZTXOKIK6UETG6QPXQPJN25/events.json","paper":"https://pith.science/paper/4QJUZTXO"},"agent_actions":{"view_html":"https://pith.science/pith/4QJUZTXOKIK6UETG6QPXQPJN25","download_json":"https://pith.science/pith/4QJUZTXOKIK6UETG6QPXQPJN25.json","view_paper":"https://pith.science/paper/4QJUZTXO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.14032&json=true","fetch_graph":"https://pith.science/api/pith-number/4QJUZTXOKIK6UETG6QPXQPJN25/graph.json","fetch_events":"https://pith.science/api/pith-number/4QJUZTXOKIK6UETG6QPXQPJN25/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4QJUZTXOKIK6UETG6QPXQPJN25/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4QJUZTXOKIK6UETG6QPXQPJN25/action/storage_attestation","attest_author":"https://pith.science/pith/4QJUZTXOKIK6UETG6QPXQPJN25/action/author_attestation","sign_citation":"https://pith.science/pith/4QJUZTXOKIK6UETG6QPXQPJN25/action/citation_signature","submit_replication":"https://pith.science/pith/4QJUZTXOKIK6UETG6QPXQPJN25/action/replication_record"}},"created_at":"2026-07-05T07:09:01.836437+00:00","updated_at":"2026-07-05T07:09:01.836437+00:00"}