{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:54S3I6VE5VIYH7PAVIA4JHKH7J","short_pith_number":"pith:54S3I6VE","canonical_record":{"source":{"id":"2608.00270","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-07-31T20:23:21Z","cross_cats_sorted":[],"title_canon_sha256":"a4a2c07fd3c5417d2d8846cfc8cc5147fb6637cecf95f1f4a0400e20cb83639e","abstract_canon_sha256":"b21ba779705557411ff04ffb3d590c1e973a167aafbf73cdce208deeca8f04b2"},"schema_version":"1.0"},"canonical_sha256":"ef25b47aa4ed5183fde0aa01c49d47fa60f625d06563ee3c8cd2dc3e2389c720","source":{"kind":"arxiv","id":"2608.00270","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.00270","created_at":"2026-08-04T00:34:42Z"},{"alias_kind":"arxiv_version","alias_value":"2608.00270v1","created_at":"2026-08-04T00:34:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.00270","created_at":"2026-08-04T00:34:42Z"},{"alias_kind":"pith_short_12","alias_value":"54S3I6VE5VIY","created_at":"2026-08-04T00:34:42Z"},{"alias_kind":"pith_short_16","alias_value":"54S3I6VE5VIYH7PA","created_at":"2026-08-04T00:34:42Z"},{"alias_kind":"pith_short_8","alias_value":"54S3I6VE","created_at":"2026-08-04T00:34:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:54S3I6VE5VIYH7PAVIA4JHKH7J","target":"record","payload":{"canonical_record":{"source":{"id":"2608.00270","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-07-31T20:23:21Z","cross_cats_sorted":[],"title_canon_sha256":"a4a2c07fd3c5417d2d8846cfc8cc5147fb6637cecf95f1f4a0400e20cb83639e","abstract_canon_sha256":"b21ba779705557411ff04ffb3d590c1e973a167aafbf73cdce208deeca8f04b2"},"schema_version":"1.0"},"canonical_sha256":"ef25b47aa4ed5183fde0aa01c49d47fa60f625d06563ee3c8cd2dc3e2389c720","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-04T00:34:42.951807Z","signature_b64":"DkB+9gskirvLSzszYETltMEHoHyY2UofQ5VxU7j4/8AdvfHAzFTCqbd8Q8+cWElwphJWdzpuYpk3y+Wx3yG6Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef25b47aa4ed5183fde0aa01c49d47fa60f625d06563ee3c8cd2dc3e2389c720","last_reissued_at":"2026-08-04T00:34:42.949800Z","signature_status":"signed_v1","first_computed_at":"2026-08-04T00:34:42.949800Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2608.00270","source_version":1,"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-08-04T00:34:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dfBJSCww5GMygXYlHJm73uB9cnB/2dHEF1l6somLFOpiyTgbbnvt+ZzsV9es5GziAK3qTak83vBaLe38Rql4BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T06:53:11.403942Z"},"content_sha256":"c50c1d18774a4420ce0483a03cf6967abf13f2286c256686ad7347aa0c91ca36","schema_version":"1.0","event_id":"sha256:c50c1d18774a4420ce0483a03cf6967abf13f2286c256686ad7347aa0c91ca36"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:54S3I6VE5VIYH7PAVIA4JHKH7J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Geometric Self-Supervised Pre-training for Neural Combinatorial Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Carlos R. del-Blanco, Daniel Fuertes, David Aguado, Fernando Jaureguizar","submitted_at":"2026-07-31T20:23:21Z","abstract_excerpt":"Neural Combinatorial Optimization (NCO) techniques have emerged as a highly efficient alternative to traditional exact algorithms for solving routing problems such as the Traveling Salesman Problem (TSP). However, the generalization capabilities of these Reinforcement Learning-based models are severely hindered when scaling to high-dimensional instances. This issue has been mitigated in other domains, like computer vision and natural language processing, by adopting a self-supervised pre-training strategy. Nevertheless, its application to routing graphs, which lack complex topological attribut"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.00270","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.00270/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-08-04T00:34:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FJzC5B+gT7b6W5LjSrldWpI3PgwNI6ilIVdREu2ekDBTHcAUgzH+Xs2fivigPLDOBMqckDTaGeZOkqaL6pIaCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T06:53:11.404891Z"},"content_sha256":"a1e4e57a4f08d66ac3d6bb2894667c21ca9d77f6bc3a8394df1a1a5d91d2604c","schema_version":"1.0","event_id":"sha256:a1e4e57a4f08d66ac3d6bb2894667c21ca9d77f6bc3a8394df1a1a5d91d2604c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/54S3I6VE5VIYH7PAVIA4JHKH7J/bundle.json","state_url":"https://pith.science/pith/54S3I6VE5VIYH7PAVIA4JHKH7J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/54S3I6VE5VIYH7PAVIA4JHKH7J/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-18T06:53:11Z","links":{"resolver":"https://pith.science/pith/54S3I6VE5VIYH7PAVIA4JHKH7J","bundle":"https://pith.science/pith/54S3I6VE5VIYH7PAVIA4JHKH7J/bundle.json","state":"https://pith.science/pith/54S3I6VE5VIYH7PAVIA4JHKH7J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/54S3I6VE5VIYH7PAVIA4JHKH7J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:54S3I6VE5VIYH7PAVIA4JHKH7J","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":"b21ba779705557411ff04ffb3d590c1e973a167aafbf73cdce208deeca8f04b2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-07-31T20:23:21Z","title_canon_sha256":"a4a2c07fd3c5417d2d8846cfc8cc5147fb6637cecf95f1f4a0400e20cb83639e"},"schema_version":"1.0","source":{"id":"2608.00270","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.00270","created_at":"2026-08-04T00:34:42Z"},{"alias_kind":"arxiv_version","alias_value":"2608.00270v1","created_at":"2026-08-04T00:34:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.00270","created_at":"2026-08-04T00:34:42Z"},{"alias_kind":"pith_short_12","alias_value":"54S3I6VE5VIY","created_at":"2026-08-04T00:34:42Z"},{"alias_kind":"pith_short_16","alias_value":"54S3I6VE5VIYH7PA","created_at":"2026-08-04T00:34:42Z"},{"alias_kind":"pith_short_8","alias_value":"54S3I6VE","created_at":"2026-08-04T00:34:42Z"}],"graph_snapshots":[{"event_id":"sha256:a1e4e57a4f08d66ac3d6bb2894667c21ca9d77f6bc3a8394df1a1a5d91d2604c","target":"graph","created_at":"2026-08-04T00:34: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/2608.00270/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Neural Combinatorial Optimization (NCO) techniques have emerged as a highly efficient alternative to traditional exact algorithms for solving routing problems such as the Traveling Salesman Problem (TSP). However, the generalization capabilities of these Reinforcement Learning-based models are severely hindered when scaling to high-dimensional instances. This issue has been mitigated in other domains, like computer vision and natural language processing, by adopting a self-supervised pre-training strategy. Nevertheless, its application to routing graphs, which lack complex topological attribut","authors_text":"Carlos R. del-Blanco, Daniel Fuertes, David Aguado, Fernando Jaureguizar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-07-31T20:23:21Z","title":"Geometric Self-Supervised Pre-training for Neural Combinatorial Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.00270","kind":"arxiv","version":1},"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:c50c1d18774a4420ce0483a03cf6967abf13f2286c256686ad7347aa0c91ca36","target":"record","created_at":"2026-08-04T00:34: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":"b21ba779705557411ff04ffb3d590c1e973a167aafbf73cdce208deeca8f04b2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-07-31T20:23:21Z","title_canon_sha256":"a4a2c07fd3c5417d2d8846cfc8cc5147fb6637cecf95f1f4a0400e20cb83639e"},"schema_version":"1.0","source":{"id":"2608.00270","kind":"arxiv","version":1}},"canonical_sha256":"ef25b47aa4ed5183fde0aa01c49d47fa60f625d06563ee3c8cd2dc3e2389c720","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ef25b47aa4ed5183fde0aa01c49d47fa60f625d06563ee3c8cd2dc3e2389c720","first_computed_at":"2026-08-04T00:34:42.949800Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-04T00:34:42.949800Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DkB+9gskirvLSzszYETltMEHoHyY2UofQ5VxU7j4/8AdvfHAzFTCqbd8Q8+cWElwphJWdzpuYpk3y+Wx3yG6Cw==","signature_status":"signed_v1","signed_at":"2026-08-04T00:34:42.951807Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.00270","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c50c1d18774a4420ce0483a03cf6967abf13f2286c256686ad7347aa0c91ca36","sha256:a1e4e57a4f08d66ac3d6bb2894667c21ca9d77f6bc3a8394df1a1a5d91d2604c"],"state_sha256":"08c115ab4a9a600e07d8de9b8462f3d79d51d93b1403b09a172be0fe0b2024cd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1BqWT+Lt9H8FzM61QhujaMpHROiS+PtrLKNrBHOtDxXTXo66sxvq+ydHPl7xXYpDRi14IB2EkHDqsyyAYhahBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T06:53:11.410933Z","bundle_sha256":"a5b4f4257aa7c4b5790fd199d75f95f1dfde9bd29012c3405e601f518651ad2a"}}