{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:JI7Y62SXI7WVJZQIP5SEPIZGK6","short_pith_number":"pith:JI7Y62SX","schema_version":"1.0","canonical_sha256":"4a3f8f6a5747ed54e6087f6447a32657a1eeed48e783bf4d764d8edf36e38376","source":{"kind":"arxiv","id":"1908.09325","version":2},"attestation_state":"computed","paper":{"title":"Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Bart M. P. Jansen, \\'Edouard Bonnet, {\\L}ukasz Kowalik, Yoichi Iwata","submitted_at":"2019-08-25T13:28:53Z","abstract_excerpt":"Local search is a widely-employed strategy for finding good solutions to Traveling Salesman Problem. We analyze the problem of determining whether the weight of a given cycle can be decreased by a popular $k$-opt move. Earlier work has shown that (i) assuming the Exponential Time Hypothesis, there is no algorithm to find an improving $k$-opt move in time $f(k)n^{o(k/\\log k)}$ for any function $f$, while (ii) it is possible to improve on the brute-force running time of $O(n^k)$ and save linear factors in the exponent. Modern TSP heuristics show that very good global solutions can already be rea"},"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":"1908.09325","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-25T13:28:53Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"a7f34de2e3a89aa243ee0e6bc495d6caad42c9d623cc1adb1b5a6f37a055d150","abstract_canon_sha256":"37e9a48b47e05f368c212d6e6d7cf0fe77db725d3aafd19e76d15b7a65b14bba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:01:03.834744Z","signature_b64":"2YxcGTpTy+uVMFOaMe810b/cYAgLfuMgBftYH1QAxG4OUnTsv+bKOyv3vmYf7aEEkDsL0enn3FfwUhyzVowKAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a3f8f6a5747ed54e6087f6447a32657a1eeed48e783bf4d764d8edf36e38376","last_reissued_at":"2026-07-05T00:01:03.834309Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:01:03.834309Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Bart M. P. Jansen, \\'Edouard Bonnet, {\\L}ukasz Kowalik, Yoichi Iwata","submitted_at":"2019-08-25T13:28:53Z","abstract_excerpt":"Local search is a widely-employed strategy for finding good solutions to Traveling Salesman Problem. We analyze the problem of determining whether the weight of a given cycle can be decreased by a popular $k$-opt move. Earlier work has shown that (i) assuming the Exponential Time Hypothesis, there is no algorithm to find an improving $k$-opt move in time $f(k)n^{o(k/\\log k)}$ for any function $f$, while (ii) it is possible to improve on the brute-force running time of $O(n^k)$ and save linear factors in the exponent. Modern TSP heuristics show that very good global solutions can already be rea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.09325","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/1908.09325/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":"1908.09325","created_at":"2026-07-05T00:01:03.834386+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.09325v2","created_at":"2026-07-05T00:01:03.834386+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.09325","created_at":"2026-07-05T00:01:03.834386+00:00"},{"alias_kind":"pith_short_12","alias_value":"JI7Y62SXI7WV","created_at":"2026-07-05T00:01:03.834386+00:00"},{"alias_kind":"pith_short_16","alias_value":"JI7Y62SXI7WVJZQI","created_at":"2026-07-05T00:01:03.834386+00:00"},{"alias_kind":"pith_short_8","alias_value":"JI7Y62SX","created_at":"2026-07-05T00:01:03.834386+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/JI7Y62SXI7WVJZQIP5SEPIZGK6","json":"https://pith.science/pith/JI7Y62SXI7WVJZQIP5SEPIZGK6.json","graph_json":"https://pith.science/api/pith-number/JI7Y62SXI7WVJZQIP5SEPIZGK6/graph.json","events_json":"https://pith.science/api/pith-number/JI7Y62SXI7WVJZQIP5SEPIZGK6/events.json","paper":"https://pith.science/paper/JI7Y62SX"},"agent_actions":{"view_html":"https://pith.science/pith/JI7Y62SXI7WVJZQIP5SEPIZGK6","download_json":"https://pith.science/pith/JI7Y62SXI7WVJZQIP5SEPIZGK6.json","view_paper":"https://pith.science/paper/JI7Y62SX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.09325&json=true","fetch_graph":"https://pith.science/api/pith-number/JI7Y62SXI7WVJZQIP5SEPIZGK6/graph.json","fetch_events":"https://pith.science/api/pith-number/JI7Y62SXI7WVJZQIP5SEPIZGK6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JI7Y62SXI7WVJZQIP5SEPIZGK6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JI7Y62SXI7WVJZQIP5SEPIZGK6/action/storage_attestation","attest_author":"https://pith.science/pith/JI7Y62SXI7WVJZQIP5SEPIZGK6/action/author_attestation","sign_citation":"https://pith.science/pith/JI7Y62SXI7WVJZQIP5SEPIZGK6/action/citation_signature","submit_replication":"https://pith.science/pith/JI7Y62SXI7WVJZQIP5SEPIZGK6/action/replication_record"}},"created_at":"2026-07-05T00:01:03.834386+00:00","updated_at":"2026-07-05T00:01:03.834386+00:00"}