{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:L4DI6PTFWFLYIX2EZUDWADSFBI","short_pith_number":"pith:L4DI6PTF","schema_version":"1.0","canonical_sha256":"5f068f3e65b157845f44cd07600e450a2ff4bf1945f8d616989aec504281b1b1","source":{"kind":"arxiv","id":"2507.12304","version":1},"attestation_state":"computed","paper":{"title":"A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Hung P. Hoang, Sophia Heimann, Stefan Hougardy","submitted_at":"2025-07-16T15:04:26Z","abstract_excerpt":"The $k$-opt algorithm is one of the simplest and most widely used heuristics for solving the traveling salesman problem. Starting from an arbitrary tour, the $k$-opt algorithm improves the current tour in each iteration by exchanging up to $k$ edges. The algorithm continues until no further improvement of this kind is possible. For a long time, it remained an open question how many iterations the $k$-opt algorithm might require for small values of $k$, assuming the use of an optimal pivot rule. In this paper, we resolve this question for the cases $k = 3$ and $k = 4$ by proving that in both th"},"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":"2507.12304","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2025-07-16T15:04:26Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"99c548e0eb6b480180dad1b2041dff7e8c76c5070eefa3c8695deef5c80cedc6","abstract_canon_sha256":"6c8db20a4a3c9e9addc6625785afc9c176e68077b3608c5d6f805f97364ea59a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:38:18.052568Z","signature_b64":"O7PERzFm8IHee+FFwjS1QQHCQAbofpyAtkID3jE6Lo8MkEL9NfmrlYpVkegZRxKxHdUD4K4E3Cy3rV+w4o0KBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f068f3e65b157845f44cd07600e450a2ff4bf1945f8d616989aec504281b1b1","last_reissued_at":"2026-07-05T11:38:18.052099Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:38:18.052099Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Hung P. Hoang, Sophia Heimann, Stefan Hougardy","submitted_at":"2025-07-16T15:04:26Z","abstract_excerpt":"The $k$-opt algorithm is one of the simplest and most widely used heuristics for solving the traveling salesman problem. Starting from an arbitrary tour, the $k$-opt algorithm improves the current tour in each iteration by exchanging up to $k$ edges. The algorithm continues until no further improvement of this kind is possible. For a long time, it remained an open question how many iterations the $k$-opt algorithm might require for small values of $k$, assuming the use of an optimal pivot rule. In this paper, we resolve this question for the cases $k = 3$ and $k = 4$ by proving that in both th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.12304","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/2507.12304/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":"2507.12304","created_at":"2026-07-05T11:38:18.052158+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.12304v1","created_at":"2026-07-05T11:38:18.052158+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.12304","created_at":"2026-07-05T11:38:18.052158+00:00"},{"alias_kind":"pith_short_12","alias_value":"L4DI6PTFWFLY","created_at":"2026-07-05T11:38:18.052158+00:00"},{"alias_kind":"pith_short_16","alias_value":"L4DI6PTFWFLYIX2E","created_at":"2026-07-05T11:38:18.052158+00:00"},{"alias_kind":"pith_short_8","alias_value":"L4DI6PTF","created_at":"2026-07-05T11:38:18.052158+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/L4DI6PTFWFLYIX2EZUDWADSFBI","json":"https://pith.science/pith/L4DI6PTFWFLYIX2EZUDWADSFBI.json","graph_json":"https://pith.science/api/pith-number/L4DI6PTFWFLYIX2EZUDWADSFBI/graph.json","events_json":"https://pith.science/api/pith-number/L4DI6PTFWFLYIX2EZUDWADSFBI/events.json","paper":"https://pith.science/paper/L4DI6PTF"},"agent_actions":{"view_html":"https://pith.science/pith/L4DI6PTFWFLYIX2EZUDWADSFBI","download_json":"https://pith.science/pith/L4DI6PTFWFLYIX2EZUDWADSFBI.json","view_paper":"https://pith.science/paper/L4DI6PTF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.12304&json=true","fetch_graph":"https://pith.science/api/pith-number/L4DI6PTFWFLYIX2EZUDWADSFBI/graph.json","fetch_events":"https://pith.science/api/pith-number/L4DI6PTFWFLYIX2EZUDWADSFBI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L4DI6PTFWFLYIX2EZUDWADSFBI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L4DI6PTFWFLYIX2EZUDWADSFBI/action/storage_attestation","attest_author":"https://pith.science/pith/L4DI6PTFWFLYIX2EZUDWADSFBI/action/author_attestation","sign_citation":"https://pith.science/pith/L4DI6PTFWFLYIX2EZUDWADSFBI/action/citation_signature","submit_replication":"https://pith.science/pith/L4DI6PTFWFLYIX2EZUDWADSFBI/action/replication_record"}},"created_at":"2026-07-05T11:38:18.052158+00:00","updated_at":"2026-07-05T11:38:18.052158+00:00"}