{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:LG6N3OYAPFJOSD6XJSMEEC6ISQ","short_pith_number":"pith:LG6N3OYA","schema_version":"1.0","canonical_sha256":"59bcddbb007952e90fd74c98420bc894109dfe0121097be0781f17dc276f8f1d","source":{"kind":"arxiv","id":"2110.05291","version":3},"attestation_state":"computed","paper":{"title":"Graph Neural Network Guided Local Search for the Traveling Salesperson Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Amanda Prorok, Benjamin Hudson, Matthew Malencia, Qingbiao Li","submitted_at":"2021-10-11T14:06:08Z","abstract_excerpt":"Solutions to the Traveling Salesperson Problem (TSP) have practical applications to processes in transportation, logistics, and automation, yet must be computed with minimal delay to satisfy the real-time nature of the underlying tasks. However, solving large TSP instances quickly without sacrificing solution quality remains challenging for current approximate algorithms. To close this gap, we present a hybrid data-driven approach for solving the TSP based on Graph Neural Networks (GNNs) and Guided Local Search (GLS). Our model predicts the regret of including each edge of the problem graph in"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2110.05291","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-10-11T14:06:08Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"7c7da0bdbbe3f8c53f64e9973dff737669e97a377f1e0056162fff55bfb9ed80","abstract_canon_sha256":"c076971498ecc83ff7378637da6e701c7d440c8faee09d2b3bfb6edb8ad7f95e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:11:27.545146Z","signature_b64":"tyR5WXezX7WhjaAIOC75csr5g4b6VOEB0Gu84nxD3QcuUCFV2OL/PD16XR5O5S3EFdMKVRvi6tBt/6SF/rdyCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59bcddbb007952e90fd74c98420bc894109dfe0121097be0781f17dc276f8f1d","last_reissued_at":"2026-07-05T04:11:27.544704Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:11:27.544704Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Neural Network Guided Local Search for the Traveling Salesperson Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Amanda Prorok, Benjamin Hudson, Matthew Malencia, Qingbiao Li","submitted_at":"2021-10-11T14:06:08Z","abstract_excerpt":"Solutions to the Traveling Salesperson Problem (TSP) have practical applications to processes in transportation, logistics, and automation, yet must be computed with minimal delay to satisfy the real-time nature of the underlying tasks. However, solving large TSP instances quickly without sacrificing solution quality remains challenging for current approximate algorithms. To close this gap, we present a hybrid data-driven approach for solving the TSP based on Graph Neural Networks (GNNs) and Guided Local Search (GLS). Our model predicts the regret of including each edge of the problem graph in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.05291","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/2110.05291/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2110.05291","created_at":"2026-07-05T04:11:27.544758+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.05291v3","created_at":"2026-07-05T04:11:27.544758+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.05291","created_at":"2026-07-05T04:11:27.544758+00:00"},{"alias_kind":"pith_short_12","alias_value":"LG6N3OYAPFJO","created_at":"2026-07-05T04:11:27.544758+00:00"},{"alias_kind":"pith_short_16","alias_value":"LG6N3OYAPFJOSD6X","created_at":"2026-07-05T04:11:27.544758+00:00"},{"alias_kind":"pith_short_8","alias_value":"LG6N3OYA","created_at":"2026-07-05T04:11:27.544758+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.20236","citing_title":"Machine Learning-based Two-Stage Graph Sparsification for the Travelling Salesman Problem","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LG6N3OYAPFJOSD6XJSMEEC6ISQ","json":"https://pith.science/pith/LG6N3OYAPFJOSD6XJSMEEC6ISQ.json","graph_json":"https://pith.science/api/pith-number/LG6N3OYAPFJOSD6XJSMEEC6ISQ/graph.json","events_json":"https://pith.science/api/pith-number/LG6N3OYAPFJOSD6XJSMEEC6ISQ/events.json","paper":"https://pith.science/paper/LG6N3OYA"},"agent_actions":{"view_html":"https://pith.science/pith/LG6N3OYAPFJOSD6XJSMEEC6ISQ","download_json":"https://pith.science/pith/LG6N3OYAPFJOSD6XJSMEEC6ISQ.json","view_paper":"https://pith.science/paper/LG6N3OYA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.05291&json=true","fetch_graph":"https://pith.science/api/pith-number/LG6N3OYAPFJOSD6XJSMEEC6ISQ/graph.json","fetch_events":"https://pith.science/api/pith-number/LG6N3OYAPFJOSD6XJSMEEC6ISQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LG6N3OYAPFJOSD6XJSMEEC6ISQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LG6N3OYAPFJOSD6XJSMEEC6ISQ/action/storage_attestation","attest_author":"https://pith.science/pith/LG6N3OYAPFJOSD6XJSMEEC6ISQ/action/author_attestation","sign_citation":"https://pith.science/pith/LG6N3OYAPFJOSD6XJSMEEC6ISQ/action/citation_signature","submit_replication":"https://pith.science/pith/LG6N3OYAPFJOSD6XJSMEEC6ISQ/action/replication_record"}},"created_at":"2026-07-05T04:11:27.544758+00:00","updated_at":"2026-07-05T04:11:27.544758+00:00"}