{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:VQIT7JSPH7QR7CF7O2DAWHLGRN","short_pith_number":"pith:VQIT7JSP","canonical_record":{"source":{"id":"2308.00560","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2023-08-01T14:00:31Z","cross_cats_sorted":[],"title_canon_sha256":"287c147d24a74f393bb67915253ab20dbdb2fc72b4689be1cafba384848e1e95","abstract_canon_sha256":"a7f2db7784026aa4c78fdc0f0304202b52686bb1b33211987f8d6be1a9b6c5fe"},"schema_version":"1.0"},"canonical_sha256":"ac113fa64f3fe11f88bf76860b1d668b4634b50f581925314b40603f87d152ab","source":{"kind":"arxiv","id":"2308.00560","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.00560","created_at":"2026-07-05T09:21:00Z"},{"alias_kind":"arxiv_version","alias_value":"2308.00560v3","created_at":"2026-07-05T09:21:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.00560","created_at":"2026-07-05T09:21:00Z"},{"alias_kind":"pith_short_12","alias_value":"VQIT7JSPH7QR","created_at":"2026-07-05T09:21:00Z"},{"alias_kind":"pith_short_16","alias_value":"VQIT7JSPH7QR7CF7","created_at":"2026-07-05T09:21:00Z"},{"alias_kind":"pith_short_8","alias_value":"VQIT7JSP","created_at":"2026-07-05T09:21:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:VQIT7JSPH7QR7CF7O2DAWHLGRN","target":"record","payload":{"canonical_record":{"source":{"id":"2308.00560","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2023-08-01T14:00:31Z","cross_cats_sorted":[],"title_canon_sha256":"287c147d24a74f393bb67915253ab20dbdb2fc72b4689be1cafba384848e1e95","abstract_canon_sha256":"a7f2db7784026aa4c78fdc0f0304202b52686bb1b33211987f8d6be1a9b6c5fe"},"schema_version":"1.0"},"canonical_sha256":"ac113fa64f3fe11f88bf76860b1d668b4634b50f581925314b40603f87d152ab","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:21:00.884425Z","signature_b64":"42bX0SNJgg4iNCnLBkw0XGQGtBnxRKd0wqVdvxt8xHERaXgb38ECTY5amvngUC6yEhlqxlKFqoX8EDI+NFIZDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac113fa64f3fe11f88bf76860b1d668b4634b50f581925314b40603f87d152ab","last_reissued_at":"2026-07-05T09:21:00.883908Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:21:00.883908Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2308.00560","source_version":3,"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-05T09:21:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k3jiFNz1uApJNQ3+m790BIGodMlVrdMTbjgrivbSp/uB9LW6uns6astD2KjXqRmbkXeSFVzAki8GSSOPLULaDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T03:11:19.993631Z"},"content_sha256":"ad88a3ca391d326bd631785202c1c1e38d0e6c6acebe8d9b06812eeadb1c5b3d","schema_version":"1.0","event_id":"sha256:ad88a3ca391d326bd631785202c1c1e38d0e6c6acebe8d9b06812eeadb1c5b3d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:VQIT7JSPH7QR7CF7O2DAWHLGRN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reinforcement Learning-based Non-Autoregressive Solver for Traveling Salesman Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Boyang Li, Di Wang, Dong Xu, Hao Li, Huanhuan Chen, Wei Pang, Xuan Wu, Yanchun Liang, You Zhou, Yubin Xiao","submitted_at":"2023-08-01T14:00:31Z","abstract_excerpt":"The Traveling Salesman Problem (TSP) is a well-known combinatorial optimization problem with broad real-world applications. Recently, neural networks have gained popularity in this research area because as shown in the literature, they provide strong heuristic solutions to TSPs. Compared to autoregressive neural approaches, non-autoregressive (NAR) networks exploit the inference parallelism to elevate inference speed but suffer from comparatively low solution quality. In this paper, we propose a novel NAR model named NAR4TSP, which incorporates a specially designed architecture and an enhanced"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.00560","kind":"arxiv","version":3},"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/2308.00560/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-05T09:21:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZK8dpr4pVCR8MKYIoN1/6xLBJaxjJQ8keuTd93D45UdBzUC/oVjhi1rOm7z6bnJdjsbSCdWQqUnM8jL/6GOkCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T03:11:19.994147Z"},"content_sha256":"686b67d7d27742118f593230ef04ad9ea5232dd58a3fa36ff69a1413973d23b5","schema_version":"1.0","event_id":"sha256:686b67d7d27742118f593230ef04ad9ea5232dd58a3fa36ff69a1413973d23b5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VQIT7JSPH7QR7CF7O2DAWHLGRN/bundle.json","state_url":"https://pith.science/pith/VQIT7JSPH7QR7CF7O2DAWHLGRN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VQIT7JSPH7QR7CF7O2DAWHLGRN/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-15T03:11:19Z","links":{"resolver":"https://pith.science/pith/VQIT7JSPH7QR7CF7O2DAWHLGRN","bundle":"https://pith.science/pith/VQIT7JSPH7QR7CF7O2DAWHLGRN/bundle.json","state":"https://pith.science/pith/VQIT7JSPH7QR7CF7O2DAWHLGRN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VQIT7JSPH7QR7CF7O2DAWHLGRN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:VQIT7JSPH7QR7CF7O2DAWHLGRN","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":"a7f2db7784026aa4c78fdc0f0304202b52686bb1b33211987f8d6be1a9b6c5fe","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2023-08-01T14:00:31Z","title_canon_sha256":"287c147d24a74f393bb67915253ab20dbdb2fc72b4689be1cafba384848e1e95"},"schema_version":"1.0","source":{"id":"2308.00560","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.00560","created_at":"2026-07-05T09:21:00Z"},{"alias_kind":"arxiv_version","alias_value":"2308.00560v3","created_at":"2026-07-05T09:21:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.00560","created_at":"2026-07-05T09:21:00Z"},{"alias_kind":"pith_short_12","alias_value":"VQIT7JSPH7QR","created_at":"2026-07-05T09:21:00Z"},{"alias_kind":"pith_short_16","alias_value":"VQIT7JSPH7QR7CF7","created_at":"2026-07-05T09:21:00Z"},{"alias_kind":"pith_short_8","alias_value":"VQIT7JSP","created_at":"2026-07-05T09:21:00Z"}],"graph_snapshots":[{"event_id":"sha256:686b67d7d27742118f593230ef04ad9ea5232dd58a3fa36ff69a1413973d23b5","target":"graph","created_at":"2026-07-05T09:21:00Z","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/2308.00560/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 well-known combinatorial optimization problem with broad real-world applications. Recently, neural networks have gained popularity in this research area because as shown in the literature, they provide strong heuristic solutions to TSPs. Compared to autoregressive neural approaches, non-autoregressive (NAR) networks exploit the inference parallelism to elevate inference speed but suffer from comparatively low solution quality. In this paper, we propose a novel NAR model named NAR4TSP, which incorporates a specially designed architecture and an enhanced","authors_text":"Boyang Li, Di Wang, Dong Xu, Hao Li, Huanhuan Chen, Wei Pang, Xuan Wu, Yanchun Liang, You Zhou, Yubin Xiao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2023-08-01T14:00:31Z","title":"Reinforcement Learning-based Non-Autoregressive Solver for Traveling Salesman Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.00560","kind":"arxiv","version":3},"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:ad88a3ca391d326bd631785202c1c1e38d0e6c6acebe8d9b06812eeadb1c5b3d","target":"record","created_at":"2026-07-05T09:21:00Z","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":"a7f2db7784026aa4c78fdc0f0304202b52686bb1b33211987f8d6be1a9b6c5fe","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2023-08-01T14:00:31Z","title_canon_sha256":"287c147d24a74f393bb67915253ab20dbdb2fc72b4689be1cafba384848e1e95"},"schema_version":"1.0","source":{"id":"2308.00560","kind":"arxiv","version":3}},"canonical_sha256":"ac113fa64f3fe11f88bf76860b1d668b4634b50f581925314b40603f87d152ab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ac113fa64f3fe11f88bf76860b1d668b4634b50f581925314b40603f87d152ab","first_computed_at":"2026-07-05T09:21:00.883908Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:21:00.883908Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"42bX0SNJgg4iNCnLBkw0XGQGtBnxRKd0wqVdvxt8xHERaXgb38ECTY5amvngUC6yEhlqxlKFqoX8EDI+NFIZDA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:21:00.884425Z","signed_message":"canonical_sha256_bytes"},"source_id":"2308.00560","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ad88a3ca391d326bd631785202c1c1e38d0e6c6acebe8d9b06812eeadb1c5b3d","sha256:686b67d7d27742118f593230ef04ad9ea5232dd58a3fa36ff69a1413973d23b5"],"state_sha256":"68c402998a0e6539c5e07f1e302c73cc894a3b88b71d1fe3ffcaa40a6218fe3d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7tn9EWDtkkN6/COguoKYbAwpMkW0W7s/2/nX+gE3ClIkLC9UY5A+42hEAUxcj3+h93/FwKrRSW4sXlT8aLw5Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T03:11:19.998186Z","bundle_sha256":"145df9d2f932c220b44687dc0828564e2bc9e3e43eff3c75b3c5923eda8a2fff"}}