{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:AFPVUR3QVENXHTNUKDW6F23F4L","short_pith_number":"pith:AFPVUR3Q","schema_version":"1.0","canonical_sha256":"015f5a4770a91b73cdb450ede2eb65e2c918aace422ce18d1b2709d00689e30f","source":{"kind":"arxiv","id":"2103.03012","version":1},"attestation_state":"computed","paper":{"title":"The Transformer Network for the Traveling Salesman Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Thomas Laurent, Xavier Bresson","submitted_at":"2021-03-04T13:20:06Z","abstract_excerpt":"The Traveling Salesman Problem (TSP) is the most popular and most studied combinatorial problem, starting with von Neumann in 1951. It has driven the discovery of several optimization techniques such as cutting planes, branch-and-bound, local search, Lagrangian relaxation, and simulated annealing. The last five years have seen the emergence of promising techniques where (graph) neural networks have been capable to learn new combinatorial algorithms. The main question is whether deep learning can learn better heuristics from data, i.e. replacing human-engineered heuristics? This is appealing be"},"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":"2103.03012","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-03-04T13:20:06Z","cross_cats_sorted":[],"title_canon_sha256":"a575e0b53bc6b8553d337e9f363fc00dbe0dfc0abc540fa38d002e788bbcdb3f","abstract_canon_sha256":"0a1fed4b72592687000d87491d1e8e242f59b24496559d73f49c7402351ce32a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:20:23.327530Z","signature_b64":"HQhiFPThFhlnYiarsfgpAtOBSsEEofgiEoxtYMbJ11n7DT6FnGztCQvZKkBcALHwoZ7X53uNRS8SHis73DQwDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"015f5a4770a91b73cdb450ede2eb65e2c918aace422ce18d1b2709d00689e30f","last_reissued_at":"2026-07-05T02:20:23.327016Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:20:23.327016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Transformer Network for the Traveling Salesman Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Thomas Laurent, Xavier Bresson","submitted_at":"2021-03-04T13:20:06Z","abstract_excerpt":"The Traveling Salesman Problem (TSP) is the most popular and most studied combinatorial problem, starting with von Neumann in 1951. It has driven the discovery of several optimization techniques such as cutting planes, branch-and-bound, local search, Lagrangian relaxation, and simulated annealing. The last five years have seen the emergence of promising techniques where (graph) neural networks have been capable to learn new combinatorial algorithms. The main question is whether deep learning can learn better heuristics from data, i.e. replacing human-engineered heuristics? This is appealing be"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.03012","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/2103.03012/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":"2103.03012","created_at":"2026-07-05T02:20:23.327081+00:00"},{"alias_kind":"arxiv_version","alias_value":"2103.03012v1","created_at":"2026-07-05T02:20:23.327081+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.03012","created_at":"2026-07-05T02:20:23.327081+00:00"},{"alias_kind":"pith_short_12","alias_value":"AFPVUR3QVENX","created_at":"2026-07-05T02:20:23.327081+00:00"},{"alias_kind":"pith_short_16","alias_value":"AFPVUR3QVENXHTNU","created_at":"2026-07-05T02:20:23.327081+00:00"},{"alias_kind":"pith_short_8","alias_value":"AFPVUR3Q","created_at":"2026-07-05T02:20:23.327081+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.08758","citing_title":"Omni-scale Learning-based Sequential Decision Framework for Order Fulfillment of Tote-handling Robotic Systems","ref_index":89,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AFPVUR3QVENXHTNUKDW6F23F4L","json":"https://pith.science/pith/AFPVUR3QVENXHTNUKDW6F23F4L.json","graph_json":"https://pith.science/api/pith-number/AFPVUR3QVENXHTNUKDW6F23F4L/graph.json","events_json":"https://pith.science/api/pith-number/AFPVUR3QVENXHTNUKDW6F23F4L/events.json","paper":"https://pith.science/paper/AFPVUR3Q"},"agent_actions":{"view_html":"https://pith.science/pith/AFPVUR3QVENXHTNUKDW6F23F4L","download_json":"https://pith.science/pith/AFPVUR3QVENXHTNUKDW6F23F4L.json","view_paper":"https://pith.science/paper/AFPVUR3Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2103.03012&json=true","fetch_graph":"https://pith.science/api/pith-number/AFPVUR3QVENXHTNUKDW6F23F4L/graph.json","fetch_events":"https://pith.science/api/pith-number/AFPVUR3QVENXHTNUKDW6F23F4L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AFPVUR3QVENXHTNUKDW6F23F4L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AFPVUR3QVENXHTNUKDW6F23F4L/action/storage_attestation","attest_author":"https://pith.science/pith/AFPVUR3QVENXHTNUKDW6F23F4L/action/author_attestation","sign_citation":"https://pith.science/pith/AFPVUR3QVENXHTNUKDW6F23F4L/action/citation_signature","submit_replication":"https://pith.science/pith/AFPVUR3QVENXHTNUKDW6F23F4L/action/replication_record"}},"created_at":"2026-07-05T02:20:23.327081+00:00","updated_at":"2026-07-05T02:20:23.327081+00:00"}