{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:I6HXFJMWTROP7Y2NNJ73ZYTJYO","short_pith_number":"pith:I6HXFJMW","canonical_record":{"source":{"id":"1906.01227","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-04T06:51:45Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"73a460651fcb664b1e5a3e82faa47b32aefe6cd3cb1de383813beff8d657021b","abstract_canon_sha256":"3e9359737f169a8d2afb8815954eb770b28c26f51ed482a772d8bb1c7c66e285"},"schema_version":"1.0"},"canonical_sha256":"478f72a5969c5cffe34d6a7fbce269c39843dbcf22d8e762ab2c8d5d6b393b35","source":{"kind":"arxiv","id":"1906.01227","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.01227","created_at":"2026-07-05T00:11:34Z"},{"alias_kind":"arxiv_version","alias_value":"1906.01227v2","created_at":"2026-07-05T00:11:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.01227","created_at":"2026-07-05T00:11:34Z"},{"alias_kind":"pith_short_12","alias_value":"I6HXFJMWTROP","created_at":"2026-07-05T00:11:34Z"},{"alias_kind":"pith_short_16","alias_value":"I6HXFJMWTROP7Y2N","created_at":"2026-07-05T00:11:34Z"},{"alias_kind":"pith_short_8","alias_value":"I6HXFJMW","created_at":"2026-07-05T00:11:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:I6HXFJMWTROP7Y2NNJ73ZYTJYO","target":"record","payload":{"canonical_record":{"source":{"id":"1906.01227","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-04T06:51:45Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"73a460651fcb664b1e5a3e82faa47b32aefe6cd3cb1de383813beff8d657021b","abstract_canon_sha256":"3e9359737f169a8d2afb8815954eb770b28c26f51ed482a772d8bb1c7c66e285"},"schema_version":"1.0"},"canonical_sha256":"478f72a5969c5cffe34d6a7fbce269c39843dbcf22d8e762ab2c8d5d6b393b35","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:11:34.374654Z","signature_b64":"G3H8Gpltv4uc88gh2iP8i42ONhpgTuPINERULMYPxr+z9Mxy+DPfEcek6xnr66XRYDw/p35BvOxmghBEI24uAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"478f72a5969c5cffe34d6a7fbce269c39843dbcf22d8e762ab2c8d5d6b393b35","last_reissued_at":"2026-07-05T00:11:34.374135Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:11:34.374135Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.01227","source_version":2,"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-05T00:11:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fq7NO9lvz+elcXeFhgSJ8I9gug+oMa/4LyaegBUs12fWJ/tKOYV+SBQG1ebtcamcWfKG3kVj0bLf4IBU57uiCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T23:29:11.471434Z"},"content_sha256":"8eae9e0f9306fea15f80c2148ad1cb2209b2b9b8381e49a071219b522f02655b","schema_version":"1.0","event_id":"sha256:8eae9e0f9306fea15f80c2148ad1cb2209b2b9b8381e49a071219b522f02655b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:I6HXFJMWTROP7Y2NNJ73ZYTJYO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Chaitanya K. Joshi, Thomas Laurent, Xavier Bresson","submitted_at":"2019-06-04T06:51:45Z","abstract_excerpt":"This paper introduces a new learning-based approach for approximately solving the Travelling Salesman Problem on 2D Euclidean graphs. We use deep Graph Convolutional Networks to build efficient TSP graph representations and output tours in a non-autoregressive manner via highly parallelized beam search. Our approach outperforms all recently proposed autoregressive deep learning techniques in terms of solution quality, inference speed and sample efficiency for problem instances of fixed graph sizes. In particular, we reduce the average optimality gap from 0.52% to 0.01% for 50 nodes, and from 2"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.01227","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/1906.01227/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-05T00:11:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o9NCePekIU2hKeEggnzEgQf3ZG2xoSX9ASgdM/QdAjlMsi9EIBSrlXlq1zXgG4py1QhlNG8v02hffDHkMXE/BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T23:29:11.471941Z"},"content_sha256":"41feffdf1eb52a629e49cd93cf0cec3c4ac89d9907b64e7bdc42d1e5df51d9a0","schema_version":"1.0","event_id":"sha256:41feffdf1eb52a629e49cd93cf0cec3c4ac89d9907b64e7bdc42d1e5df51d9a0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I6HXFJMWTROP7Y2NNJ73ZYTJYO/bundle.json","state_url":"https://pith.science/pith/I6HXFJMWTROP7Y2NNJ73ZYTJYO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I6HXFJMWTROP7Y2NNJ73ZYTJYO/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-10T23:29:11Z","links":{"resolver":"https://pith.science/pith/I6HXFJMWTROP7Y2NNJ73ZYTJYO","bundle":"https://pith.science/pith/I6HXFJMWTROP7Y2NNJ73ZYTJYO/bundle.json","state":"https://pith.science/pith/I6HXFJMWTROP7Y2NNJ73ZYTJYO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I6HXFJMWTROP7Y2NNJ73ZYTJYO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:I6HXFJMWTROP7Y2NNJ73ZYTJYO","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":"3e9359737f169a8d2afb8815954eb770b28c26f51ed482a772d8bb1c7c66e285","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-04T06:51:45Z","title_canon_sha256":"73a460651fcb664b1e5a3e82faa47b32aefe6cd3cb1de383813beff8d657021b"},"schema_version":"1.0","source":{"id":"1906.01227","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.01227","created_at":"2026-07-05T00:11:34Z"},{"alias_kind":"arxiv_version","alias_value":"1906.01227v2","created_at":"2026-07-05T00:11:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.01227","created_at":"2026-07-05T00:11:34Z"},{"alias_kind":"pith_short_12","alias_value":"I6HXFJMWTROP","created_at":"2026-07-05T00:11:34Z"},{"alias_kind":"pith_short_16","alias_value":"I6HXFJMWTROP7Y2N","created_at":"2026-07-05T00:11:34Z"},{"alias_kind":"pith_short_8","alias_value":"I6HXFJMW","created_at":"2026-07-05T00:11:34Z"}],"graph_snapshots":[{"event_id":"sha256:41feffdf1eb52a629e49cd93cf0cec3c4ac89d9907b64e7bdc42d1e5df51d9a0","target":"graph","created_at":"2026-07-05T00:11:34Z","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/1906.01227/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper introduces a new learning-based approach for approximately solving the Travelling Salesman Problem on 2D Euclidean graphs. We use deep Graph Convolutional Networks to build efficient TSP graph representations and output tours in a non-autoregressive manner via highly parallelized beam search. Our approach outperforms all recently proposed autoregressive deep learning techniques in terms of solution quality, inference speed and sample efficiency for problem instances of fixed graph sizes. In particular, we reduce the average optimality gap from 0.52% to 0.01% for 50 nodes, and from 2","authors_text":"Chaitanya K. Joshi, Thomas Laurent, Xavier Bresson","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-04T06:51:45Z","title":"An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.01227","kind":"arxiv","version":2},"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:8eae9e0f9306fea15f80c2148ad1cb2209b2b9b8381e49a071219b522f02655b","target":"record","created_at":"2026-07-05T00:11:34Z","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":"3e9359737f169a8d2afb8815954eb770b28c26f51ed482a772d8bb1c7c66e285","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-04T06:51:45Z","title_canon_sha256":"73a460651fcb664b1e5a3e82faa47b32aefe6cd3cb1de383813beff8d657021b"},"schema_version":"1.0","source":{"id":"1906.01227","kind":"arxiv","version":2}},"canonical_sha256":"478f72a5969c5cffe34d6a7fbce269c39843dbcf22d8e762ab2c8d5d6b393b35","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"478f72a5969c5cffe34d6a7fbce269c39843dbcf22d8e762ab2c8d5d6b393b35","first_computed_at":"2026-07-05T00:11:34.374135Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:11:34.374135Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G3H8Gpltv4uc88gh2iP8i42ONhpgTuPINERULMYPxr+z9Mxy+DPfEcek6xnr66XRYDw/p35BvOxmghBEI24uAA==","signature_status":"signed_v1","signed_at":"2026-07-05T00:11:34.374654Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.01227","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8eae9e0f9306fea15f80c2148ad1cb2209b2b9b8381e49a071219b522f02655b","sha256:41feffdf1eb52a629e49cd93cf0cec3c4ac89d9907b64e7bdc42d1e5df51d9a0"],"state_sha256":"a81169b32c8e5056733bcfd09ba19c6559cf24cb5ad855e84d228a0ab533d569"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J/3UYXOhXHwNw3n2DdN2Row/Trj4qXa/dbNiWNjcGaWb/qqbVVwnnedBK9q9F2d5TeHTnRMz5/vr62sx2jecAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T23:29:11.475945Z","bundle_sha256":"daa9db31b42fc627fe6009591152f1f27bb77d930f4cc4939e92efafacc129ac"}}