{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:QZO4TQMBD53QNNGENVA6CX3JVP","short_pith_number":"pith:QZO4TQMB","schema_version":"1.0","canonical_sha256":"865dc9c1811f7706b4c46d41e15f69abe563aba5710783763e5840ce81fd5b33","source":{"kind":"arxiv","id":"2408.03585","version":1},"attestation_state":"computed","paper":{"title":"Hierarchical Neural Constructive Solver for Real-world TSP Scenarios","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Mohammed Haroon Dupty, Wee Sun Lee, Yanfei Dong, Yining Ma, Yong Liang Goh, Zhiguang Cao","submitted_at":"2024-08-07T06:44:47Z","abstract_excerpt":"Existing neural constructive solvers for routing problems have predominantly employed transformer architectures, conceptualizing the route construction as a set-to-sequence learning task. However, their efficacy has primarily been demonstrated on entirely random problem instances that inadequately capture real-world scenarios. In this paper, we introduce realistic Traveling Salesman Problem (TSP) scenarios relevant to industrial settings and derive the following insights: (1) The optimal next node (or city) to visit often lies within proximity to the current node, suggesting the potential bene"},"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":"2408.03585","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-08-07T06:44:47Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"3363e5ae4d83493cf020f73cbb60f9806580fbce82ae2c93a86f4139292ff7a5","abstract_canon_sha256":"06a4076d7bd473cc6ce21d27f66cb72a941d157b06964e1469460912acd475dd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:53:00.510525Z","signature_b64":"HUTC8kuoGcbvY+1NJUR6iXTW3EH/6gEtX+r3fYLvZk+mA650LJDqdkrdBOfqH46zSAGgTgweEqKYxU/4cSDXDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"865dc9c1811f7706b4c46d41e15f69abe563aba5710783763e5840ce81fd5b33","last_reissued_at":"2026-07-05T08:53:00.510176Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:53:00.510176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hierarchical Neural Constructive Solver for Real-world TSP Scenarios","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Mohammed Haroon Dupty, Wee Sun Lee, Yanfei Dong, Yining Ma, Yong Liang Goh, Zhiguang Cao","submitted_at":"2024-08-07T06:44:47Z","abstract_excerpt":"Existing neural constructive solvers for routing problems have predominantly employed transformer architectures, conceptualizing the route construction as a set-to-sequence learning task. However, their efficacy has primarily been demonstrated on entirely random problem instances that inadequately capture real-world scenarios. In this paper, we introduce realistic Traveling Salesman Problem (TSP) scenarios relevant to industrial settings and derive the following insights: (1) The optimal next node (or city) to visit often lies within proximity to the current node, suggesting the potential bene"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.03585","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/2408.03585/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":"2408.03585","created_at":"2026-07-05T08:53:00.510231+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.03585v1","created_at":"2026-07-05T08:53:00.510231+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.03585","created_at":"2026-07-05T08:53:00.510231+00:00"},{"alias_kind":"pith_short_12","alias_value":"QZO4TQMBD53Q","created_at":"2026-07-05T08:53:00.510231+00:00"},{"alias_kind":"pith_short_16","alias_value":"QZO4TQMBD53QNNGE","created_at":"2026-07-05T08:53:00.510231+00:00"},{"alias_kind":"pith_short_8","alias_value":"QZO4TQMB","created_at":"2026-07-05T08:53:00.510231+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QZO4TQMBD53QNNGENVA6CX3JVP","json":"https://pith.science/pith/QZO4TQMBD53QNNGENVA6CX3JVP.json","graph_json":"https://pith.science/api/pith-number/QZO4TQMBD53QNNGENVA6CX3JVP/graph.json","events_json":"https://pith.science/api/pith-number/QZO4TQMBD53QNNGENVA6CX3JVP/events.json","paper":"https://pith.science/paper/QZO4TQMB"},"agent_actions":{"view_html":"https://pith.science/pith/QZO4TQMBD53QNNGENVA6CX3JVP","download_json":"https://pith.science/pith/QZO4TQMBD53QNNGENVA6CX3JVP.json","view_paper":"https://pith.science/paper/QZO4TQMB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.03585&json=true","fetch_graph":"https://pith.science/api/pith-number/QZO4TQMBD53QNNGENVA6CX3JVP/graph.json","fetch_events":"https://pith.science/api/pith-number/QZO4TQMBD53QNNGENVA6CX3JVP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QZO4TQMBD53QNNGENVA6CX3JVP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QZO4TQMBD53QNNGENVA6CX3JVP/action/storage_attestation","attest_author":"https://pith.science/pith/QZO4TQMBD53QNNGENVA6CX3JVP/action/author_attestation","sign_citation":"https://pith.science/pith/QZO4TQMBD53QNNGENVA6CX3JVP/action/citation_signature","submit_replication":"https://pith.science/pith/QZO4TQMBD53QNNGENVA6CX3JVP/action/replication_record"}},"created_at":"2026-07-05T08:53:00.510231+00:00","updated_at":"2026-07-05T08:53:00.510231+00:00"}