{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:BTAZ7HK7PFOKU2L5K4RBW3DVRO","short_pith_number":"pith:BTAZ7HK7","schema_version":"1.0","canonical_sha256":"0cc19f9d5f795caa697d57221b6c758ba1dd00a29f19eb8eef09659caed63a47","source":{"kind":"arxiv","id":"1705.06855","version":1},"attestation_state":"computed","paper":{"title":"Using a Hamiltonian cycle problem algorithm to assist in solving difficult instances of Traveling Salesman Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Michael Haythorpe, Serguei Rossomakhine, Vladimir Ejov","submitted_at":"2017-05-19T04:06:13Z","abstract_excerpt":"We describe a hybrid procedure for solving the traveling salesman problem (TSP) to provable optimality. We first sparsify the instance, and then use a hybrid algorithm that combines a branch-and-cut TSP solver with a Hamiltonian cycle problem solver. We demonstrate that this procedure enables us to solve difficult instances to optimality, including one which had remained unsolved since its construction in 2002."},"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":"1705.06855","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-19T04:06:13Z","cross_cats_sorted":[],"title_canon_sha256":"fa6f5628f31b510c970bca1e0432d6ef7ada06452937c26c849f07ad0d5f2f15","abstract_canon_sha256":"b4a94d5141454285b297a0056c3c41d19dfc2417aabb2060eb1849731f2e83ce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:11.142773Z","signature_b64":"7uwQ1O3LqtBKnPiD1NhqbTHNhTeXcKBRXrpV+o57JTbGPRswd8VbaQnHz8zGfw3g3ucba278arfQLyu1lpCyAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0cc19f9d5f795caa697d57221b6c758ba1dd00a29f19eb8eef09659caed63a47","last_reissued_at":"2026-05-18T00:44:11.142259Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:11.142259Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Using a Hamiltonian cycle problem algorithm to assist in solving difficult instances of Traveling Salesman Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Michael Haythorpe, Serguei Rossomakhine, Vladimir Ejov","submitted_at":"2017-05-19T04:06:13Z","abstract_excerpt":"We describe a hybrid procedure for solving the traveling salesman problem (TSP) to provable optimality. We first sparsify the instance, and then use a hybrid algorithm that combines a branch-and-cut TSP solver with a Hamiltonian cycle problem solver. We demonstrate that this procedure enables us to solve difficult instances to optimality, including one which had remained unsolved since its construction in 2002."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.06855","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":""},"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":"1705.06855","created_at":"2026-05-18T00:44:11.142350+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.06855v1","created_at":"2026-05-18T00:44:11.142350+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.06855","created_at":"2026-05-18T00:44:11.142350+00:00"},{"alias_kind":"pith_short_12","alias_value":"BTAZ7HK7PFOK","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"BTAZ7HK7PFOKU2L5","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"BTAZ7HK7","created_at":"2026-05-18T12:31:08.081275+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/BTAZ7HK7PFOKU2L5K4RBW3DVRO","json":"https://pith.science/pith/BTAZ7HK7PFOKU2L5K4RBW3DVRO.json","graph_json":"https://pith.science/api/pith-number/BTAZ7HK7PFOKU2L5K4RBW3DVRO/graph.json","events_json":"https://pith.science/api/pith-number/BTAZ7HK7PFOKU2L5K4RBW3DVRO/events.json","paper":"https://pith.science/paper/BTAZ7HK7"},"agent_actions":{"view_html":"https://pith.science/pith/BTAZ7HK7PFOKU2L5K4RBW3DVRO","download_json":"https://pith.science/pith/BTAZ7HK7PFOKU2L5K4RBW3DVRO.json","view_paper":"https://pith.science/paper/BTAZ7HK7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.06855&json=true","fetch_graph":"https://pith.science/api/pith-number/BTAZ7HK7PFOKU2L5K4RBW3DVRO/graph.json","fetch_events":"https://pith.science/api/pith-number/BTAZ7HK7PFOKU2L5K4RBW3DVRO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BTAZ7HK7PFOKU2L5K4RBW3DVRO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BTAZ7HK7PFOKU2L5K4RBW3DVRO/action/storage_attestation","attest_author":"https://pith.science/pith/BTAZ7HK7PFOKU2L5K4RBW3DVRO/action/author_attestation","sign_citation":"https://pith.science/pith/BTAZ7HK7PFOKU2L5K4RBW3DVRO/action/citation_signature","submit_replication":"https://pith.science/pith/BTAZ7HK7PFOKU2L5K4RBW3DVRO/action/replication_record"}},"created_at":"2026-05-18T00:44:11.142350+00:00","updated_at":"2026-05-18T00:44:11.142350+00:00"}