{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:UJPKBYCEJW5FPLV55HZEZNHY5W","short_pith_number":"pith:UJPKBYCE","canonical_record":{"source":{"id":"2606.19185","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-17T15:24:37Z","cross_cats_sorted":[],"title_canon_sha256":"177b74b0e41f52998685d71c9218aaa91ca76cea16895db1eb705ada00aa1873","abstract_canon_sha256":"aad55c684790c00550f93b32b80d5e06edac8090fa67755a390927c09f7a5174"},"schema_version":"1.0"},"canonical_sha256":"a25ea0e0444dba57aebde9f24cb4f8ed86c1846ca6a82d25b93d81bb0d662e78","source":{"kind":"arxiv","id":"2606.19185","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.19185","created_at":"2026-06-19T16:12:07Z"},{"alias_kind":"arxiv_version","alias_value":"2606.19185v1","created_at":"2026-06-19T16:12:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.19185","created_at":"2026-06-19T16:12:07Z"},{"alias_kind":"pith_short_12","alias_value":"UJPKBYCEJW5F","created_at":"2026-06-19T16:12:07Z"},{"alias_kind":"pith_short_16","alias_value":"UJPKBYCEJW5FPLV5","created_at":"2026-06-19T16:12:07Z"},{"alias_kind":"pith_short_8","alias_value":"UJPKBYCE","created_at":"2026-06-19T16:12:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:UJPKBYCEJW5FPLV55HZEZNHY5W","target":"record","payload":{"canonical_record":{"source":{"id":"2606.19185","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-17T15:24:37Z","cross_cats_sorted":[],"title_canon_sha256":"177b74b0e41f52998685d71c9218aaa91ca76cea16895db1eb705ada00aa1873","abstract_canon_sha256":"aad55c684790c00550f93b32b80d5e06edac8090fa67755a390927c09f7a5174"},"schema_version":"1.0"},"canonical_sha256":"a25ea0e0444dba57aebde9f24cb4f8ed86c1846ca6a82d25b93d81bb0d662e78","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:12:07.352819Z","signature_b64":"Zk9+ZOSWMwwM9XNFTgwj7r9fWdCF4TiMGOnMpakCjBtzLQaY2FqzPR6gEovAhkK/bxU7OkCy90cPZEWaAv6cAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a25ea0e0444dba57aebde9f24cb4f8ed86c1846ca6a82d25b93d81bb0d662e78","last_reissued_at":"2026-06-19T16:12:07.352477Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:12:07.352477Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.19185","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-06-19T16:12:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8Qg3l4mAJIe6jjY0pxMSSTyzYe78xpZs8LiSlCvGb6n7F6K6FvjLARrfYVn1nvooyHly7xQ779sj7NHfUXFTBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T10:01:09.961804Z"},"content_sha256":"be4bc974ab0ea6f998d2aee018e92c3f2313cfe2117d38929a2b017dada45653","schema_version":"1.0","event_id":"sha256:be4bc974ab0ea6f998d2aee018e92c3f2313cfe2117d38929a2b017dada45653"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:UJPKBYCEJW5FPLV55HZEZNHY5W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"AGDN: Learning to Solve Traveling Salesman Problem with Anisotropic Graph Diffusion Network","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bolin Shen, Yushun Dong, Zhiguang Cao, Ziwei Huang","submitted_at":"2026-06-17T15:24:37Z","abstract_excerpt":"The Traveling Salesman Problem (TSP) is a cornerstone of combinatorial optimization and arises in many practical scenarios. Although graph-based learning approaches have been explored for TSP, the question of how to exploit graph structure more effectively remains open. We present the Anisotropic Graph Diffusion Network (AGDN), a new Graph Neural Network framework designed to solve TSP. Our method tackles two central difficulties: (1) the lack of informative topological prior in fully connected TSP graphs, and (2) losing connected nodes in the optimal solution after the commonly used graph spa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.19185","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/2606.19185/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-06-19T16:12:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IVKNhZdXNvhSb+ZUmIxfekVM9FsUmJ3LUHrY3XkoqJqSb2c4xSXqcgyjYRcOAjEL5UYdLIGIuxVEHHCEhKTjDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T10:01:09.962194Z"},"content_sha256":"2a44c41cb28493d171b56e626a34dc5c0349f14d10e0165beebc22e1e7bc47a5","schema_version":"1.0","event_id":"sha256:2a44c41cb28493d171b56e626a34dc5c0349f14d10e0165beebc22e1e7bc47a5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UJPKBYCEJW5FPLV55HZEZNHY5W/bundle.json","state_url":"https://pith.science/pith/UJPKBYCEJW5FPLV55HZEZNHY5W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UJPKBYCEJW5FPLV55HZEZNHY5W/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-07-04T10:01:09Z","links":{"resolver":"https://pith.science/pith/UJPKBYCEJW5FPLV55HZEZNHY5W","bundle":"https://pith.science/pith/UJPKBYCEJW5FPLV55HZEZNHY5W/bundle.json","state":"https://pith.science/pith/UJPKBYCEJW5FPLV55HZEZNHY5W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UJPKBYCEJW5FPLV55HZEZNHY5W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:UJPKBYCEJW5FPLV55HZEZNHY5W","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":"aad55c684790c00550f93b32b80d5e06edac8090fa67755a390927c09f7a5174","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-17T15:24:37Z","title_canon_sha256":"177b74b0e41f52998685d71c9218aaa91ca76cea16895db1eb705ada00aa1873"},"schema_version":"1.0","source":{"id":"2606.19185","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.19185","created_at":"2026-06-19T16:12:07Z"},{"alias_kind":"arxiv_version","alias_value":"2606.19185v1","created_at":"2026-06-19T16:12:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.19185","created_at":"2026-06-19T16:12:07Z"},{"alias_kind":"pith_short_12","alias_value":"UJPKBYCEJW5F","created_at":"2026-06-19T16:12:07Z"},{"alias_kind":"pith_short_16","alias_value":"UJPKBYCEJW5FPLV5","created_at":"2026-06-19T16:12:07Z"},{"alias_kind":"pith_short_8","alias_value":"UJPKBYCE","created_at":"2026-06-19T16:12:07Z"}],"graph_snapshots":[{"event_id":"sha256:2a44c41cb28493d171b56e626a34dc5c0349f14d10e0165beebc22e1e7bc47a5","target":"graph","created_at":"2026-06-19T16:12:07Z","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/2606.19185/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Traveling Salesman Problem (TSP) is a cornerstone of combinatorial optimization and arises in many practical scenarios. Although graph-based learning approaches have been explored for TSP, the question of how to exploit graph structure more effectively remains open. We present the Anisotropic Graph Diffusion Network (AGDN), a new Graph Neural Network framework designed to solve TSP. Our method tackles two central difficulties: (1) the lack of informative topological prior in fully connected TSP graphs, and (2) losing connected nodes in the optimal solution after the commonly used graph spa","authors_text":"Bolin Shen, Yushun Dong, Zhiguang Cao, Ziwei Huang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-17T15:24:37Z","title":"AGDN: Learning to Solve Traveling Salesman Problem with Anisotropic Graph Diffusion Network"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.19185","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:be4bc974ab0ea6f998d2aee018e92c3f2313cfe2117d38929a2b017dada45653","target":"record","created_at":"2026-06-19T16:12:07Z","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":"aad55c684790c00550f93b32b80d5e06edac8090fa67755a390927c09f7a5174","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-17T15:24:37Z","title_canon_sha256":"177b74b0e41f52998685d71c9218aaa91ca76cea16895db1eb705ada00aa1873"},"schema_version":"1.0","source":{"id":"2606.19185","kind":"arxiv","version":1}},"canonical_sha256":"a25ea0e0444dba57aebde9f24cb4f8ed86c1846ca6a82d25b93d81bb0d662e78","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a25ea0e0444dba57aebde9f24cb4f8ed86c1846ca6a82d25b93d81bb0d662e78","first_computed_at":"2026-06-19T16:12:07.352477Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-19T16:12:07.352477Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Zk9+ZOSWMwwM9XNFTgwj7r9fWdCF4TiMGOnMpakCjBtzLQaY2FqzPR6gEovAhkK/bxU7OkCy90cPZEWaAv6cAw==","signature_status":"signed_v1","signed_at":"2026-06-19T16:12:07.352819Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.19185","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:be4bc974ab0ea6f998d2aee018e92c3f2313cfe2117d38929a2b017dada45653","sha256:2a44c41cb28493d171b56e626a34dc5c0349f14d10e0165beebc22e1e7bc47a5"],"state_sha256":"fa185dcb6ebd3ee1a92734ea5255e4b1f5cf84bc26ff1e54bb63635016dd7dc1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bf+NFRY/mNP7fc/zSJUYuMuKx2Svr2sQzePq5T0PdzSnxytecYuTyDXJiXz59ZaCFP5h6bI8sJWLgsJAYFTcCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T10:01:09.964257Z","bundle_sha256":"ea45d036403099d69cfadfd244e31229d5fc547e8cb84e8fce84837feeb58d3c"}}