{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:Z37LBANBMX645D637ZK7H672BB","short_pith_number":"pith:Z37LBANB","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"},"canonical_sha256":"cefeb081a165fdce8fdbfe55f3fbfa085e54eedf6b891b7a757d0508c99adec7","source":{"kind":"arxiv","id":"2306.06064","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.06064","created_at":"2026-07-05T07:44:42Z"},{"alias_kind":"arxiv_version","alias_value":"2306.06064v5","created_at":"2026-07-05T07:44:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.06064","created_at":"2026-07-05T07:44:42Z"},{"alias_kind":"pith_short_12","alias_value":"Z37LBANBMX64","created_at":"2026-07-05T07:44:42Z"},{"alias_kind":"pith_short_16","alias_value":"Z37LBANBMX645D63","created_at":"2026-07-05T07:44:42Z"},{"alias_kind":"pith_short_8","alias_value":"Z37LBANB","created_at":"2026-07-05T07:44:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:Z37LBANBMX645D637ZK7H672BB","target":"record","payload":{"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"},"canonical_sha256":"cefeb081a165fdce8fdbfe55f3fbfa085e54eedf6b891b7a757d0508c99adec7","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"},"source_kind":"arxiv","source_id":"2306.06064","source_version":5,"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-05T07:44:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B/aLZCudDMLOzQm2rRE2K3AYoGMAOQZcn1Z4CEkzVCResduK28SRvNHfSu/YZF3Q7WGzYGrN6knjpOsQ3q0JDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T08:24:22.444871Z"},"content_sha256":"358eabde9db650a905acd0cf2391cf3b191f36bd125deb48973a60bf786faafd","schema_version":"1.0","event_id":"sha256:358eabde9db650a905acd0cf2391cf3b191f36bd125deb48973a60bf786faafd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:Z37LBANBMX645D637ZK7H672BB","target":"graph","payload":{"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"},"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-05T07:44:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6kCaOylFgbuX1yXjru0eHsQHLfJuoHFOGZBwXZVzhsWcII4xyM0GQwgOqCHngmZTMQKPySoKYEPrzp5JQMnJDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T08:24:22.445717Z"},"content_sha256":"69a43aa827a9b2f698442675c5eaf94bbde5ce916efcc2ff9748f5b5a1edf7ce","schema_version":"1.0","event_id":"sha256:69a43aa827a9b2f698442675c5eaf94bbde5ce916efcc2ff9748f5b5a1edf7ce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z37LBANBMX645D637ZK7H672BB/bundle.json","state_url":"https://pith.science/pith/Z37LBANBMX645D637ZK7H672BB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z37LBANBMX645D637ZK7H672BB/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-11T08:24:22Z","links":{"resolver":"https://pith.science/pith/Z37LBANBMX645D637ZK7H672BB","bundle":"https://pith.science/pith/Z37LBANBMX645D637ZK7H672BB/bundle.json","state":"https://pith.science/pith/Z37LBANBMX645D637ZK7H672BB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z37LBANBMX645D637ZK7H672BB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:Z37LBANBMX645D637ZK7H672BB","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":"ac022ccde78170e861fea85d8db77b3f435e027976bd7b84bd5cf53bc7035dd9","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2023-05-18T13:59:02Z","title_canon_sha256":"15d2173b4ad275d45a6f75af5836d13027ac8e6f5c7e647160051b7877183558"},"schema_version":"1.0","source":{"id":"2306.06064","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.06064","created_at":"2026-07-05T07:44:42Z"},{"alias_kind":"arxiv_version","alias_value":"2306.06064v5","created_at":"2026-07-05T07:44:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.06064","created_at":"2026-07-05T07:44:42Z"},{"alias_kind":"pith_short_12","alias_value":"Z37LBANBMX64","created_at":"2026-07-05T07:44:42Z"},{"alias_kind":"pith_short_16","alias_value":"Z37LBANBMX645D63","created_at":"2026-07-05T07:44:42Z"},{"alias_kind":"pith_short_8","alias_value":"Z37LBANB","created_at":"2026-07-05T07:44:42Z"}],"graph_snapshots":[{"event_id":"sha256:69a43aa827a9b2f698442675c5eaf94bbde5ce916efcc2ff9748f5b5a1edf7ce","target":"graph","created_at":"2026-07-05T07:44:42Z","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/2306.06064/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Danilo Numeroso, Davide Bacciu, Dobrik Georgiev, Pietro Li\\`o","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2023-05-18T13:59:02Z","title":"Neural Algorithmic Reasoning for Combinatorial Optimisation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.06064","kind":"arxiv","version":5},"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:358eabde9db650a905acd0cf2391cf3b191f36bd125deb48973a60bf786faafd","target":"record","created_at":"2026-07-05T07:44:42Z","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":"ac022ccde78170e861fea85d8db77b3f435e027976bd7b84bd5cf53bc7035dd9","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2023-05-18T13:59:02Z","title_canon_sha256":"15d2173b4ad275d45a6f75af5836d13027ac8e6f5c7e647160051b7877183558"},"schema_version":"1.0","source":{"id":"2306.06064","kind":"arxiv","version":5}},"canonical_sha256":"cefeb081a165fdce8fdbfe55f3fbfa085e54eedf6b891b7a757d0508c99adec7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cefeb081a165fdce8fdbfe55f3fbfa085e54eedf6b891b7a757d0508c99adec7","first_computed_at":"2026-07-05T07:44:42.738952Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:44:42.738952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Fo4tSCYegfrtyxWYkcl01KXYNrMP3WxpFQMgMJmFM3ZyDqEzuGWIoKwTIaey6C1RofCwO0bIWMB+7CmYZ9TeCg==","signature_status":"signed_v1","signed_at":"2026-07-05T07:44:42.739527Z","signed_message":"canonical_sha256_bytes"},"source_id":"2306.06064","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:358eabde9db650a905acd0cf2391cf3b191f36bd125deb48973a60bf786faafd","sha256:69a43aa827a9b2f698442675c5eaf94bbde5ce916efcc2ff9748f5b5a1edf7ce"],"state_sha256":"a12ebf66614f769255aa6eeb8128a5723381db32cf2c5a299b10a659874294e7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AE3h+/HmzCN8qjsTe1g24D/CwIl4VmsOBJkFfgVhcNGc2jTiohBQ/naHiauP1zRCIJAL6vgLC8PmC4fli3NRAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T08:24:22.449969Z","bundle_sha256":"8fd360d26f4e1f13244a059fedb63df6e0e94a752fae1b773e18f114aa44eb64"}}