{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:LAMO54GBLYVOPPXLOXHXSLKUCY","short_pith_number":"pith:LAMO54GB","canonical_record":{"source":{"id":"2601.13465","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-01-19T23:40:08Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"48d0923d66e0221b91fc08e8b7d41692aa64e24c64d32b6fb2e4a2159e1727d7","abstract_canon_sha256":"a8a2c03f2ac13fa72f643eb1f227d6703e5d1e1bf30f1f43aba97e9dbb8c5744"},"schema_version":"1.0"},"canonical_sha256":"5818eef0c15e2ae7beeb75cf792d54161384f2ec174f1df5236dc8c5e846b600","source":{"kind":"arxiv","id":"2601.13465","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2601.13465","created_at":"2026-07-07T02:17:16Z"},{"alias_kind":"arxiv_version","alias_value":"2601.13465v4","created_at":"2026-07-07T02:17:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.13465","created_at":"2026-07-07T02:17:16Z"},{"alias_kind":"pith_short_12","alias_value":"LAMO54GBLYVO","created_at":"2026-07-07T02:17:16Z"},{"alias_kind":"pith_short_16","alias_value":"LAMO54GBLYVOPPXL","created_at":"2026-07-07T02:17:16Z"},{"alias_kind":"pith_short_8","alias_value":"LAMO54GB","created_at":"2026-07-07T02:17:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:LAMO54GBLYVOPPXLOXHXSLKUCY","target":"record","payload":{"canonical_record":{"source":{"id":"2601.13465","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-01-19T23:40:08Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"48d0923d66e0221b91fc08e8b7d41692aa64e24c64d32b6fb2e4a2159e1727d7","abstract_canon_sha256":"a8a2c03f2ac13fa72f643eb1f227d6703e5d1e1bf30f1f43aba97e9dbb8c5744"},"schema_version":"1.0"},"canonical_sha256":"5818eef0c15e2ae7beeb75cf792d54161384f2ec174f1df5236dc8c5e846b600","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-07T02:17:16.550435Z","signature_b64":"ixzIbXDz+nWcLupnRWTDBFK9J6lxRNqSrDQMQwS0YrG6EP2+PiE9+qOa/9tBi955FVQc5bUVkKZ/DW6w0TxmAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5818eef0c15e2ae7beeb75cf792d54161384f2ec174f1df5236dc8c5e846b600","last_reissued_at":"2026-07-07T02:17:16.549592Z","signature_status":"signed_v1","first_computed_at":"2026-07-07T02:17:16.549592Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2601.13465","source_version":4,"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-07T02:17:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nMoBGOnOkdoI8HYrNhOAyFWwzVNaKLCvhpu/TjHL4Os+TukKhR0UiOL3el+L2/g7RFOh29s3HIEXxkJh6teFBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T09:16:33.177745Z"},"content_sha256":"951afefbda4c2d9a97c42b25c365d1abbc5034048a70890988f90f710ccfcd02","schema_version":"1.0","event_id":"sha256:951afefbda4c2d9a97c42b25c365d1abbc5034048a70890988f90f710ccfcd02"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:LAMO54GBLYVOPPXLOXHXSLKUCY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph Neural Networks are Heuristics","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Carla P. Gomes, Yimeng Min","submitted_at":"2026-01-19T23:40:08Z","abstract_excerpt":"Graph neural networks are usually treated as auxiliaries for combinatorial optimization: they imitate algorithms, guide search, or supply scores to classical procedures. We show that this auxiliary role is not intrinsic. A GNN can itself be a heuristic. For the Euclidean Travelling Salesman Problem, we train a non-autoregressive GNN with no labels, rewards, sequential decoding, search, or local improvement. A differentiable Hamiltonian-cycle objective is the only supervision. The trained model produces a complete tour in one forward pass, while dropout and snapshots from a single training traj"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.13465","kind":"arxiv","version":4},"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/2601.13465/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-07T02:17:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"voZCrGeQQ3VhwIb8phJe1YnfyjTqElWdE+gf5ksKCuS4WgzpKwBPlD2I1PPXbVq5JEGcFPW4ZiJxndk6+K0oBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T09:16:33.178350Z"},"content_sha256":"d64caf320e08d175cedeb0a1a3eb4f367cf5a79ed0a2baf9d6466402f98f6173","schema_version":"1.0","event_id":"sha256:d64caf320e08d175cedeb0a1a3eb4f367cf5a79ed0a2baf9d6466402f98f6173"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LAMO54GBLYVOPPXLOXHXSLKUCY/bundle.json","state_url":"https://pith.science/pith/LAMO54GBLYVOPPXLOXHXSLKUCY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LAMO54GBLYVOPPXLOXHXSLKUCY/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-20T09:16:33Z","links":{"resolver":"https://pith.science/pith/LAMO54GBLYVOPPXLOXHXSLKUCY","bundle":"https://pith.science/pith/LAMO54GBLYVOPPXLOXHXSLKUCY/bundle.json","state":"https://pith.science/pith/LAMO54GBLYVOPPXLOXHXSLKUCY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LAMO54GBLYVOPPXLOXHXSLKUCY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:LAMO54GBLYVOPPXLOXHXSLKUCY","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":"a8a2c03f2ac13fa72f643eb1f227d6703e5d1e1bf30f1f43aba97e9dbb8c5744","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-01-19T23:40:08Z","title_canon_sha256":"48d0923d66e0221b91fc08e8b7d41692aa64e24c64d32b6fb2e4a2159e1727d7"},"schema_version":"1.0","source":{"id":"2601.13465","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2601.13465","created_at":"2026-07-07T02:17:16Z"},{"alias_kind":"arxiv_version","alias_value":"2601.13465v4","created_at":"2026-07-07T02:17:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.13465","created_at":"2026-07-07T02:17:16Z"},{"alias_kind":"pith_short_12","alias_value":"LAMO54GBLYVO","created_at":"2026-07-07T02:17:16Z"},{"alias_kind":"pith_short_16","alias_value":"LAMO54GBLYVOPPXL","created_at":"2026-07-07T02:17:16Z"},{"alias_kind":"pith_short_8","alias_value":"LAMO54GB","created_at":"2026-07-07T02:17:16Z"}],"graph_snapshots":[{"event_id":"sha256:d64caf320e08d175cedeb0a1a3eb4f367cf5a79ed0a2baf9d6466402f98f6173","target":"graph","created_at":"2026-07-07T02:17:16Z","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/2601.13465/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph neural networks are usually treated as auxiliaries for combinatorial optimization: they imitate algorithms, guide search, or supply scores to classical procedures. We show that this auxiliary role is not intrinsic. A GNN can itself be a heuristic. For the Euclidean Travelling Salesman Problem, we train a non-autoregressive GNN with no labels, rewards, sequential decoding, search, or local improvement. A differentiable Hamiltonian-cycle objective is the only supervision. The trained model produces a complete tour in one forward pass, while dropout and snapshots from a single training traj","authors_text":"Carla P. Gomes, Yimeng Min","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-01-19T23:40:08Z","title":"Graph Neural Networks are Heuristics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.13465","kind":"arxiv","version":4},"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:951afefbda4c2d9a97c42b25c365d1abbc5034048a70890988f90f710ccfcd02","target":"record","created_at":"2026-07-07T02:17:16Z","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":"a8a2c03f2ac13fa72f643eb1f227d6703e5d1e1bf30f1f43aba97e9dbb8c5744","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-01-19T23:40:08Z","title_canon_sha256":"48d0923d66e0221b91fc08e8b7d41692aa64e24c64d32b6fb2e4a2159e1727d7"},"schema_version":"1.0","source":{"id":"2601.13465","kind":"arxiv","version":4}},"canonical_sha256":"5818eef0c15e2ae7beeb75cf792d54161384f2ec174f1df5236dc8c5e846b600","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5818eef0c15e2ae7beeb75cf792d54161384f2ec174f1df5236dc8c5e846b600","first_computed_at":"2026-07-07T02:17:16.549592Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-07T02:17:16.549592Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ixzIbXDz+nWcLupnRWTDBFK9J6lxRNqSrDQMQwS0YrG6EP2+PiE9+qOa/9tBi955FVQc5bUVkKZ/DW6w0TxmAQ==","signature_status":"signed_v1","signed_at":"2026-07-07T02:17:16.550435Z","signed_message":"canonical_sha256_bytes"},"source_id":"2601.13465","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:951afefbda4c2d9a97c42b25c365d1abbc5034048a70890988f90f710ccfcd02","sha256:d64caf320e08d175cedeb0a1a3eb4f367cf5a79ed0a2baf9d6466402f98f6173"],"state_sha256":"d069342c218e91b9ab889bc8f5532c512aefa6fcbe42e614a304119f009edb61"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+GB167Bc/eM/zXUTQ9LAu7+ZpBEXzKtNfDnbAUFEstns0bJuTU31wyAqOdFf3CV7UMxX96dKIjQ8+fuLhMdGAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T09:16:33.182684Z","bundle_sha256":"cb3f8ba7c251b036666e0aeaced225a406a41ea32867b2987f77d1eef1e58560"}}