{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:Z37LBANBMX645D637ZK7H672BB","short_pith_number":"pith:Z37LBANB","schema_version":"1.0","canonical_sha256":"cefeb081a165fdce8fdbfe55f3fbfa085e54eedf6b891b7a757d0508c99adec7","source":{"kind":"arxiv","id":"2306.06064","version":5},"attestation_state":"computed","paper":{"title":"Neural Algorithmic Reasoning for Combinatorial Optimisation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.NE","authors_text":"Danilo Numeroso, Davide Bacciu, Dobrik Georgiev, Pietro Li\\`o","submitted_at":"2023-05-18T13:59:02Z","abstract_excerpt":"Solving NP-hard/complete combinatorial problems with neural networks is a challenging research area that aims to surpass classical approximate algorithms. The long-term objective is to outperform hand-designed heuristics for NP-hard/complete problems by learning to generate superior solutions solely from training data. Current neural-based methods for solving CO problems often overlook the inherent \"algorithmic\" nature of the problems. In contrast, heuristics designed for CO problems, e.g. TSP, frequently leverage well-established algorithms, such as those for finding the minimum spanning tree"},"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":"2306.06064","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2023-05-18T13:59:02Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"15d2173b4ad275d45a6f75af5836d13027ac8e6f5c7e647160051b7877183558","abstract_canon_sha256":"ac022ccde78170e861fea85d8db77b3f435e027976bd7b84bd5cf53bc7035dd9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:44:42.739527Z","signature_b64":"Fo4tSCYegfrtyxWYkcl01KXYNrMP3WxpFQMgMJmFM3ZyDqEzuGWIoKwTIaey6C1RofCwO0bIWMB+7CmYZ9TeCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cefeb081a165fdce8fdbfe55f3fbfa085e54eedf6b891b7a757d0508c99adec7","last_reissued_at":"2026-07-05T07:44:42.738952Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:44:42.738952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Neural Algorithmic Reasoning for Combinatorial Optimisation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.NE","authors_text":"Danilo Numeroso, Davide Bacciu, Dobrik Georgiev, Pietro Li\\`o","submitted_at":"2023-05-18T13:59:02Z","abstract_excerpt":"Solving NP-hard/complete combinatorial problems with neural networks is a challenging research area that aims to surpass classical approximate algorithms. The long-term objective is to outperform hand-designed heuristics for NP-hard/complete problems by learning to generate superior solutions solely from training data. Current neural-based methods for solving CO problems often overlook the inherent \"algorithmic\" nature of the problems. In contrast, heuristics designed for CO problems, e.g. TSP, frequently leverage well-established algorithms, such as those for finding the minimum spanning tree"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.06064","kind":"arxiv","version":5},"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/2306.06064/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":"2306.06064","created_at":"2026-07-05T07:44:42.739028+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.06064v5","created_at":"2026-07-05T07:44:42.739028+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.06064","created_at":"2026-07-05T07:44:42.739028+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z37LBANBMX64","created_at":"2026-07-05T07:44:42.739028+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z37LBANBMX645D63","created_at":"2026-07-05T07:44:42.739028+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z37LBANB","created_at":"2026-07-05T07:44:42.739028+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/Z37LBANBMX645D637ZK7H672BB","json":"https://pith.science/pith/Z37LBANBMX645D637ZK7H672BB.json","graph_json":"https://pith.science/api/pith-number/Z37LBANBMX645D637ZK7H672BB/graph.json","events_json":"https://pith.science/api/pith-number/Z37LBANBMX645D637ZK7H672BB/events.json","paper":"https://pith.science/paper/Z37LBANB"},"agent_actions":{"view_html":"https://pith.science/pith/Z37LBANBMX645D637ZK7H672BB","download_json":"https://pith.science/pith/Z37LBANBMX645D637ZK7H672BB.json","view_paper":"https://pith.science/paper/Z37LBANB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.06064&json=true","fetch_graph":"https://pith.science/api/pith-number/Z37LBANBMX645D637ZK7H672BB/graph.json","fetch_events":"https://pith.science/api/pith-number/Z37LBANBMX645D637ZK7H672BB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z37LBANBMX645D637ZK7H672BB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z37LBANBMX645D637ZK7H672BB/action/storage_attestation","attest_author":"https://pith.science/pith/Z37LBANBMX645D637ZK7H672BB/action/author_attestation","sign_citation":"https://pith.science/pith/Z37LBANBMX645D637ZK7H672BB/action/citation_signature","submit_replication":"https://pith.science/pith/Z37LBANBMX645D637ZK7H672BB/action/replication_record"}},"created_at":"2026-07-05T07:44:42.739028+00:00","updated_at":"2026-07-05T07:44:42.739028+00:00"}