{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:SUU4KA5RMEW6FWFVUN3RYO5GHY","short_pith_number":"pith:SUU4KA5R","schema_version":"1.0","canonical_sha256":"9529c503b1612de2d8b5a3771c3ba63e21efc03fea474fd163551ad92e094016","source":{"kind":"arxiv","id":"2603.23290","version":2},"attestation_state":"computed","paper":{"title":"Traveling Salesman Problem with a preprocessing method for classical and quantum optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CE","math.CO"],"primary_cat":"quant-ph","authors_text":"Alessia Ciacco, Francesca Guerriero, Luigi Di Puglia Pugliese","submitted_at":"2026-03-24T14:54:14Z","abstract_excerpt":"The Traveling Salesman Problem is a fundamental combinatorial optimization problem widely studied in operations research. Despite its simple formulation, it remains computationally challenging due to the exponential growth of the search space and the large number of constraints required to eliminate subtours. This paper introduces a preprocessing strategy that significantly reduces the size of the optimization model by restricting the set of candidate arcs and retaining only the lowest-cost neighbors for each vertex. Computational experiments on TSPLIB benchmark instances demonstrate that the "},"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":"2603.23290","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-03-24T14:54:14Z","cross_cats_sorted":["cs.CE","math.CO"],"title_canon_sha256":"3a01aa44b63d8a7ed858547c833390332e152785062146535912f33ccf795a2c","abstract_canon_sha256":"f83988758de1c11b8e8aca122e4ffc02be6fa0d3f4ad6d84d1e58ef867226de4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-28T01:05:12.210646Z","signature_b64":"LddcXkVO/QsCw5vHQ8iBPGTtQ7AeRq3X4u10hKI591HmkeKhL6nmqxjBFudL0ThEGpOnYau9wicRUTycS/DJCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9529c503b1612de2d8b5a3771c3ba63e21efc03fea474fd163551ad92e094016","last_reissued_at":"2026-05-28T01:05:12.210051Z","signature_status":"signed_v1","first_computed_at":"2026-05-28T01:05:12.210051Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Traveling Salesman Problem with a preprocessing method for classical and quantum optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CE","math.CO"],"primary_cat":"quant-ph","authors_text":"Alessia Ciacco, Francesca Guerriero, Luigi Di Puglia Pugliese","submitted_at":"2026-03-24T14:54:14Z","abstract_excerpt":"The Traveling Salesman Problem is a fundamental combinatorial optimization problem widely studied in operations research. Despite its simple formulation, it remains computationally challenging due to the exponential growth of the search space and the large number of constraints required to eliminate subtours. This paper introduces a preprocessing strategy that significantly reduces the size of the optimization model by restricting the set of candidate arcs and retaining only the lowest-cost neighbors for each vertex. Computational experiments on TSPLIB benchmark instances demonstrate that the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.23290","kind":"arxiv","version":2},"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/2603.23290/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":"2603.23290","created_at":"2026-05-28T01:05:12.210124+00:00"},{"alias_kind":"arxiv_version","alias_value":"2603.23290v2","created_at":"2026-05-28T01:05:12.210124+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.23290","created_at":"2026-05-28T01:05:12.210124+00:00"},{"alias_kind":"pith_short_12","alias_value":"SUU4KA5RMEW6","created_at":"2026-05-28T01:05:12.210124+00:00"},{"alias_kind":"pith_short_16","alias_value":"SUU4KA5RMEW6FWFV","created_at":"2026-05-28T01:05:12.210124+00:00"},{"alias_kind":"pith_short_8","alias_value":"SUU4KA5R","created_at":"2026-05-28T01:05:12.210124+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2604.20321","citing_title":"Cutting-plane methodology via quantum optimization for solving the Traveling Salesman Problem","ref_index":26,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SUU4KA5RMEW6FWFVUN3RYO5GHY","json":"https://pith.science/pith/SUU4KA5RMEW6FWFVUN3RYO5GHY.json","graph_json":"https://pith.science/api/pith-number/SUU4KA5RMEW6FWFVUN3RYO5GHY/graph.json","events_json":"https://pith.science/api/pith-number/SUU4KA5RMEW6FWFVUN3RYO5GHY/events.json","paper":"https://pith.science/paper/SUU4KA5R"},"agent_actions":{"view_html":"https://pith.science/pith/SUU4KA5RMEW6FWFVUN3RYO5GHY","download_json":"https://pith.science/pith/SUU4KA5RMEW6FWFVUN3RYO5GHY.json","view_paper":"https://pith.science/paper/SUU4KA5R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2603.23290&json=true","fetch_graph":"https://pith.science/api/pith-number/SUU4KA5RMEW6FWFVUN3RYO5GHY/graph.json","fetch_events":"https://pith.science/api/pith-number/SUU4KA5RMEW6FWFVUN3RYO5GHY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SUU4KA5RMEW6FWFVUN3RYO5GHY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SUU4KA5RMEW6FWFVUN3RYO5GHY/action/storage_attestation","attest_author":"https://pith.science/pith/SUU4KA5RMEW6FWFVUN3RYO5GHY/action/author_attestation","sign_citation":"https://pith.science/pith/SUU4KA5RMEW6FWFVUN3RYO5GHY/action/citation_signature","submit_replication":"https://pith.science/pith/SUU4KA5RMEW6FWFVUN3RYO5GHY/action/replication_record"}},"created_at":"2026-05-28T01:05:12.210124+00:00","updated_at":"2026-05-28T01:05:12.210124+00:00"}