{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:OKFI6OCUCO4LGU7KQ5UZCPOXZT","short_pith_number":"pith:OKFI6OCU","canonical_record":{"source":{"id":"1607.02725","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-10T09:55:53Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"6ac3944693f784ddcfcfd6e673953767c3ac4df27280e0d083354db42d81aa04","abstract_canon_sha256":"3e36cd963523dbe4744640238a83ec17f4d1a4eb0d8056dd436fe8a055302069"},"schema_version":"1.0"},"canonical_sha256":"728a8f385413b8b353ea8769913dd7ccea3080fd48eacba69345743ff859012d","source":{"kind":"arxiv","id":"1607.02725","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.02725","created_at":"2026-05-18T01:11:16Z"},{"alias_kind":"arxiv_version","alias_value":"1607.02725v1","created_at":"2026-05-18T01:11:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.02725","created_at":"2026-05-18T01:11:16Z"},{"alias_kind":"pith_short_12","alias_value":"OKFI6OCUCO4L","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OKFI6OCUCO4LGU7K","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OKFI6OCU","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:OKFI6OCUCO4LGU7KQ5UZCPOXZT","target":"record","payload":{"canonical_record":{"source":{"id":"1607.02725","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-10T09:55:53Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"6ac3944693f784ddcfcfd6e673953767c3ac4df27280e0d083354db42d81aa04","abstract_canon_sha256":"3e36cd963523dbe4744640238a83ec17f4d1a4eb0d8056dd436fe8a055302069"},"schema_version":"1.0"},"canonical_sha256":"728a8f385413b8b353ea8769913dd7ccea3080fd48eacba69345743ff859012d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:16.314540Z","signature_b64":"EV6jAbAbPrP5X70w0+4bzQ58FHetRGrRO2aglt5UXOufUq3ZrpbjALFYiK+iVCk8Y0YRKP8F3wm3bqhX5dczBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"728a8f385413b8b353ea8769913dd7ccea3080fd48eacba69345743ff859012d","last_reissued_at":"2026-05-18T01:11:16.314065Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:16.314065Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.02725","source_version":1,"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-05-18T01:11:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EQ7Zkp+rXanIiTbhq/Vipr5bNJwkQdptB8mrVnIdxcviUqDjWaoiiwj6KOlXWnoIrgNYugbhQdQi+pedtt2gCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:33:38.429070Z"},"content_sha256":"f356cb03e93d4eceb34f20eb564459ead25b3cd7d47d40d991f642e4de2d3883","schema_version":"1.0","event_id":"sha256:f356cb03e93d4eceb34f20eb564459ead25b3cd7d47d40d991f642e4de2d3883"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:OKFI6OCUCO4LGU7KQ5UZCPOXZT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fine-Grained Complexity Analysis of Two Classic TSP Variants","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Bart M. P. Jansen, Gerhard Woeginger, Kevin Buchin, Mark de Berg","submitted_at":"2016-07-10T09:55:53Z","abstract_excerpt":"We analyze two classic variants of the Traveling Salesman Problem using the toolkit of fine-grained complexity. Our first set of results is motivated by the Bitonic TSP problem: given a set of $n$ points in the plane, compute a shortest tour consisting of two monotone chains. It is a classic dynamic-programming exercise to solve this problem in $O(n^2)$ time. While the near-quadratic dependency of similar dynamic programs for Longest Common Subsequence and Discrete Frechet Distance has recently been proven to be essentially optimal under the Strong Exponential Time Hypothesis, we show that bit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.02725","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"},"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-05-18T01:11:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WSk8cpipSG1vuhouYqKdmSBk3BkFvdMI1mekq/qIQVkyoO13CUC47Z+m5V5O/J/44cyd4HjKQbRVYYhYB3pwDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:33:38.429425Z"},"content_sha256":"6a53f7650322f11721c25c760772a0bc8bc742205a2aad51014556831dac8e7d","schema_version":"1.0","event_id":"sha256:6a53f7650322f11721c25c760772a0bc8bc742205a2aad51014556831dac8e7d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OKFI6OCUCO4LGU7KQ5UZCPOXZT/bundle.json","state_url":"https://pith.science/pith/OKFI6OCUCO4LGU7KQ5UZCPOXZT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OKFI6OCUCO4LGU7KQ5UZCPOXZT/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-06-03T19:33:38Z","links":{"resolver":"https://pith.science/pith/OKFI6OCUCO4LGU7KQ5UZCPOXZT","bundle":"https://pith.science/pith/OKFI6OCUCO4LGU7KQ5UZCPOXZT/bundle.json","state":"https://pith.science/pith/OKFI6OCUCO4LGU7KQ5UZCPOXZT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OKFI6OCUCO4LGU7KQ5UZCPOXZT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:OKFI6OCUCO4LGU7KQ5UZCPOXZT","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":"3e36cd963523dbe4744640238a83ec17f4d1a4eb0d8056dd436fe8a055302069","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-10T09:55:53Z","title_canon_sha256":"6ac3944693f784ddcfcfd6e673953767c3ac4df27280e0d083354db42d81aa04"},"schema_version":"1.0","source":{"id":"1607.02725","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.02725","created_at":"2026-05-18T01:11:16Z"},{"alias_kind":"arxiv_version","alias_value":"1607.02725v1","created_at":"2026-05-18T01:11:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.02725","created_at":"2026-05-18T01:11:16Z"},{"alias_kind":"pith_short_12","alias_value":"OKFI6OCUCO4L","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OKFI6OCUCO4LGU7K","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OKFI6OCU","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:6a53f7650322f11721c25c760772a0bc8bc742205a2aad51014556831dac8e7d","target":"graph","created_at":"2026-05-18T01:11:16Z","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"},"paper":{"abstract_excerpt":"We analyze two classic variants of the Traveling Salesman Problem using the toolkit of fine-grained complexity. Our first set of results is motivated by the Bitonic TSP problem: given a set of $n$ points in the plane, compute a shortest tour consisting of two monotone chains. It is a classic dynamic-programming exercise to solve this problem in $O(n^2)$ time. While the near-quadratic dependency of similar dynamic programs for Longest Common Subsequence and Discrete Frechet Distance has recently been proven to be essentially optimal under the Strong Exponential Time Hypothesis, we show that bit","authors_text":"Bart M. P. Jansen, Gerhard Woeginger, Kevin Buchin, Mark de Berg","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-10T09:55:53Z","title":"Fine-Grained Complexity Analysis of Two Classic TSP Variants"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.02725","kind":"arxiv","version":1},"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:f356cb03e93d4eceb34f20eb564459ead25b3cd7d47d40d991f642e4de2d3883","target":"record","created_at":"2026-05-18T01:11:16Z","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":"3e36cd963523dbe4744640238a83ec17f4d1a4eb0d8056dd436fe8a055302069","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-10T09:55:53Z","title_canon_sha256":"6ac3944693f784ddcfcfd6e673953767c3ac4df27280e0d083354db42d81aa04"},"schema_version":"1.0","source":{"id":"1607.02725","kind":"arxiv","version":1}},"canonical_sha256":"728a8f385413b8b353ea8769913dd7ccea3080fd48eacba69345743ff859012d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"728a8f385413b8b353ea8769913dd7ccea3080fd48eacba69345743ff859012d","first_computed_at":"2026-05-18T01:11:16.314065Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:16.314065Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EV6jAbAbPrP5X70w0+4bzQ58FHetRGrRO2aglt5UXOufUq3ZrpbjALFYiK+iVCk8Y0YRKP8F3wm3bqhX5dczBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:16.314540Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.02725","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f356cb03e93d4eceb34f20eb564459ead25b3cd7d47d40d991f642e4de2d3883","sha256:6a53f7650322f11721c25c760772a0bc8bc742205a2aad51014556831dac8e7d"],"state_sha256":"38745eac168260cb6c4a841eec6ca31d54ac2076046b82b4cc1c080e0958b6ef"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pyKWl4AufFeZXSx2GndH+WCh/k9RpOcTj8mCQFZj0M4Lub/UlNZGOD94L5oRivoTxtQJpK0nRoOTCij8ibOYDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T19:33:38.431464Z","bundle_sha256":"439862014dc7e1847c7a974238af0de3e12efb281ceb714af26f99f83f476488"}}