{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:JI7Y62SXI7WVJZQIP5SEPIZGK6","short_pith_number":"pith:JI7Y62SX","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"},"canonical_sha256":"4a3f8f6a5747ed54e6087f6447a32657a1eeed48e783bf4d764d8edf36e38376","source":{"kind":"arxiv","id":"1908.09325","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.09325","created_at":"2026-07-05T00:01:03Z"},{"alias_kind":"arxiv_version","alias_value":"1908.09325v2","created_at":"2026-07-05T00:01:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.09325","created_at":"2026-07-05T00:01:03Z"},{"alias_kind":"pith_short_12","alias_value":"JI7Y62SXI7WV","created_at":"2026-07-05T00:01:03Z"},{"alias_kind":"pith_short_16","alias_value":"JI7Y62SXI7WVJZQI","created_at":"2026-07-05T00:01:03Z"},{"alias_kind":"pith_short_8","alias_value":"JI7Y62SX","created_at":"2026-07-05T00:01:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:JI7Y62SXI7WVJZQIP5SEPIZGK6","target":"record","payload":{"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"},"canonical_sha256":"4a3f8f6a5747ed54e6087f6447a32657a1eeed48e783bf4d764d8edf36e38376","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"},"source_kind":"arxiv","source_id":"1908.09325","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T00:01:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v9vU4E2zxIMKfXiUUmW0t8RkQx4GIYyMRahmgcP9RQnZwZO1lB7KIV4aJ5TihmfvUWx3e46Xxwn71DalJz4oCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T16:58:22.943209Z"},"content_sha256":"15b7b0f8f775d6cb042ff153e79782dcb30d12a2fa002c61d9c0204bd4ff7238","schema_version":"1.0","event_id":"sha256:15b7b0f8f775d6cb042ff153e79782dcb30d12a2fa002c61d9c0204bd4ff7238"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:JI7Y62SXI7WVJZQIP5SEPIZGK6","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T00:01:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PvuXYm1aHrewurY5UQWRHZe3MjKH6mpxVwt2GCkZToSKxObBKbEbJpWoYBdcZJ0CxomvS2uIIGYlR0JGZRFoAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T16:58:22.943936Z"},"content_sha256":"5afa9ce9587b535f544359f013cc6b4b4a3c543bbc2c27db1b4f854b59946c21","schema_version":"1.0","event_id":"sha256:5afa9ce9587b535f544359f013cc6b4b4a3c543bbc2c27db1b4f854b59946c21"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JI7Y62SXI7WVJZQIP5SEPIZGK6/bundle.json","state_url":"https://pith.science/pith/JI7Y62SXI7WVJZQIP5SEPIZGK6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JI7Y62SXI7WVJZQIP5SEPIZGK6/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-16T16:58:22Z","links":{"resolver":"https://pith.science/pith/JI7Y62SXI7WVJZQIP5SEPIZGK6","bundle":"https://pith.science/pith/JI7Y62SXI7WVJZQIP5SEPIZGK6/bundle.json","state":"https://pith.science/pith/JI7Y62SXI7WVJZQIP5SEPIZGK6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JI7Y62SXI7WVJZQIP5SEPIZGK6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:JI7Y62SXI7WVJZQIP5SEPIZGK6","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"37e9a48b47e05f368c212d6e6d7cf0fe77db725d3aafd19e76d15b7a65b14bba","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-25T13:28:53Z","title_canon_sha256":"a7f34de2e3a89aa243ee0e6bc495d6caad42c9d623cc1adb1b5a6f37a055d150"},"schema_version":"1.0","source":{"id":"1908.09325","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.09325","created_at":"2026-07-05T00:01:03Z"},{"alias_kind":"arxiv_version","alias_value":"1908.09325v2","created_at":"2026-07-05T00:01:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.09325","created_at":"2026-07-05T00:01:03Z"},{"alias_kind":"pith_short_12","alias_value":"JI7Y62SXI7WV","created_at":"2026-07-05T00:01:03Z"},{"alias_kind":"pith_short_16","alias_value":"JI7Y62SXI7WVJZQI","created_at":"2026-07-05T00:01:03Z"},{"alias_kind":"pith_short_8","alias_value":"JI7Y62SX","created_at":"2026-07-05T00:01:03Z"}],"graph_snapshots":[{"event_id":"sha256:5afa9ce9587b535f544359f013cc6b4b4a3c543bbc2c27db1b4f854b59946c21","target":"graph","created_at":"2026-07-05T00:01:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.09325/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Bart M. P. Jansen, \\'Edouard Bonnet, {\\L}ukasz Kowalik, Yoichi Iwata","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-25T13:28:53Z","title":"Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.09325","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:15b7b0f8f775d6cb042ff153e79782dcb30d12a2fa002c61d9c0204bd4ff7238","target":"record","created_at":"2026-07-05T00:01:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"37e9a48b47e05f368c212d6e6d7cf0fe77db725d3aafd19e76d15b7a65b14bba","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-25T13:28:53Z","title_canon_sha256":"a7f34de2e3a89aa243ee0e6bc495d6caad42c9d623cc1adb1b5a6f37a055d150"},"schema_version":"1.0","source":{"id":"1908.09325","kind":"arxiv","version":2}},"canonical_sha256":"4a3f8f6a5747ed54e6087f6447a32657a1eeed48e783bf4d764d8edf36e38376","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4a3f8f6a5747ed54e6087f6447a32657a1eeed48e783bf4d764d8edf36e38376","first_computed_at":"2026-07-05T00:01:03.834309Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:01:03.834309Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2YxcGTpTy+uVMFOaMe810b/cYAgLfuMgBftYH1QAxG4OUnTsv+bKOyv3vmYf7aEEkDsL0enn3FfwUhyzVowKAg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:01:03.834744Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.09325","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:15b7b0f8f775d6cb042ff153e79782dcb30d12a2fa002c61d9c0204bd4ff7238","sha256:5afa9ce9587b535f544359f013cc6b4b4a3c543bbc2c27db1b4f854b59946c21"],"state_sha256":"47a2e370718007f1a7b60af3f0949147eafc4ffa8df7eea28568c8bed2a445f2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JS5i6Rp9neV+UgO+Ub2I4CcDoLjOo+moIWJgD4cyNYdXLNkd/pd57z/DO3yMa6zG2RfXZ2fiPS+joye92Hr4CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T16:58:22.948385Z","bundle_sha256":"879831a59de69a11f6600c0ab9c93b9460096693bc0a8b209089c5a54cfbdb17"}}