{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:K7CQPDSAHJ2IKY4HBPGBPOZZBK","short_pith_number":"pith:K7CQPDSA","canonical_record":{"source":{"id":"1805.04131","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-05-10T18:49:49Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"f6eed9b69c44eb7b996ada932d8167b10daa52f703e93ab073134ee95eb5b325","abstract_canon_sha256":"0a8068a79283f44226687f571e9d8e7da845d8a943ab974bef3766167cd74e4a"},"schema_version":"1.0"},"canonical_sha256":"57c5078e403a748563870bcc17bb390aba38601ddec031a7ba46749bbef02503","source":{"kind":"arxiv","id":"1805.04131","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.04131","created_at":"2026-05-18T00:02:44Z"},{"alias_kind":"arxiv_version","alias_value":"1805.04131v3","created_at":"2026-05-18T00:02:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.04131","created_at":"2026-05-18T00:02:44Z"},{"alias_kind":"pith_short_12","alias_value":"K7CQPDSAHJ2I","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"K7CQPDSAHJ2IKY4H","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"K7CQPDSA","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:K7CQPDSAHJ2IKY4HBPGBPOZZBK","target":"record","payload":{"canonical_record":{"source":{"id":"1805.04131","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-05-10T18:49:49Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"f6eed9b69c44eb7b996ada932d8167b10daa52f703e93ab073134ee95eb5b325","abstract_canon_sha256":"0a8068a79283f44226687f571e9d8e7da845d8a943ab974bef3766167cd74e4a"},"schema_version":"1.0"},"canonical_sha256":"57c5078e403a748563870bcc17bb390aba38601ddec031a7ba46749bbef02503","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:44.875766Z","signature_b64":"55ejHpvDidrJM94//qNU5+LIDWWcIshbqgB97m2H4lXAfhI1m+9HRjQVHEotu8tsnsJirJnZFCDQRrL3HIwgAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57c5078e403a748563870bcc17bb390aba38601ddec031a7ba46749bbef02503","last_reissued_at":"2026-05-18T00:02:44.875183Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:44.875183Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.04131","source_version":3,"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-18T00:02:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A5o+NJeuhDpDTb5DtLZZ/eggBxJzmf8uVpbx6ePqNmQ/5Hb7cZCZih5UllN8NatG4d4d8Dy3u8lQkUNkF3rcBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:55:34.388599Z"},"content_sha256":"9ffbc0f26ac0148871e2e0adbf5dabfed477bf471925e7e53455d49b61ceac82","schema_version":"1.0","event_id":"sha256:9ffbc0f26ac0148871e2e0adbf5dabfed477bf471925e7e53455d49b61ceac82"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:K7CQPDSAHJ2IKY4HBPGBPOZZBK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A 1.5-Approximation for Path TSP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Rico Zenklusen","submitted_at":"2018-05-10T18:49:49Z","abstract_excerpt":"We present a $1.5$-approximation for the Metric Path Traveling Salesman Problem (Path TSP). All recent improvements on Path TSP crucially exploit a structural property shown by An, Kleinberg, and Shmoys [Journal of the ACM, 2015], namely that narrow cuts with respect to a Held-Karp solution form a chain. We significantly deviate from these approaches by showing the benefit of dealing with larger $s$-$t$ cuts, even though they are much less structured. More precisely, we show that a variation of the dynamic programming idea recently introduced by Traub and Vygen [SODA, 2018] is versatile enough"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.04131","kind":"arxiv","version":3},"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-18T00:02:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X92jvl4V/ptObuMPVvJace+omWB+8t3CB9F7T+VWEgTeGpw5hL9Z8UyzBRVhuUuPtRU/FQNRkPfZzu7ZCdPzCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:55:34.388955Z"},"content_sha256":"606f581d45513462cdca6783512a9f2e5fe2ecd71784828d68f140a2099a9d4e","schema_version":"1.0","event_id":"sha256:606f581d45513462cdca6783512a9f2e5fe2ecd71784828d68f140a2099a9d4e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K7CQPDSAHJ2IKY4HBPGBPOZZBK/bundle.json","state_url":"https://pith.science/pith/K7CQPDSAHJ2IKY4HBPGBPOZZBK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K7CQPDSAHJ2IKY4HBPGBPOZZBK/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-05-31T19:55:34Z","links":{"resolver":"https://pith.science/pith/K7CQPDSAHJ2IKY4HBPGBPOZZBK","bundle":"https://pith.science/pith/K7CQPDSAHJ2IKY4HBPGBPOZZBK/bundle.json","state":"https://pith.science/pith/K7CQPDSAHJ2IKY4HBPGBPOZZBK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K7CQPDSAHJ2IKY4HBPGBPOZZBK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:K7CQPDSAHJ2IKY4HBPGBPOZZBK","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":"0a8068a79283f44226687f571e9d8e7da845d8a943ab974bef3766167cd74e4a","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-05-10T18:49:49Z","title_canon_sha256":"f6eed9b69c44eb7b996ada932d8167b10daa52f703e93ab073134ee95eb5b325"},"schema_version":"1.0","source":{"id":"1805.04131","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.04131","created_at":"2026-05-18T00:02:44Z"},{"alias_kind":"arxiv_version","alias_value":"1805.04131v3","created_at":"2026-05-18T00:02:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.04131","created_at":"2026-05-18T00:02:44Z"},{"alias_kind":"pith_short_12","alias_value":"K7CQPDSAHJ2I","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"K7CQPDSAHJ2IKY4H","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"K7CQPDSA","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:606f581d45513462cdca6783512a9f2e5fe2ecd71784828d68f140a2099a9d4e","target":"graph","created_at":"2026-05-18T00:02:44Z","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 present a $1.5$-approximation for the Metric Path Traveling Salesman Problem (Path TSP). All recent improvements on Path TSP crucially exploit a structural property shown by An, Kleinberg, and Shmoys [Journal of the ACM, 2015], namely that narrow cuts with respect to a Held-Karp solution form a chain. We significantly deviate from these approaches by showing the benefit of dealing with larger $s$-$t$ cuts, even though they are much less structured. More precisely, we show that a variation of the dynamic programming idea recently introduced by Traub and Vygen [SODA, 2018] is versatile enough","authors_text":"Rico Zenklusen","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-05-10T18:49:49Z","title":"A 1.5-Approximation for Path TSP"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.04131","kind":"arxiv","version":3},"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:9ffbc0f26ac0148871e2e0adbf5dabfed477bf471925e7e53455d49b61ceac82","target":"record","created_at":"2026-05-18T00:02:44Z","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":"0a8068a79283f44226687f571e9d8e7da845d8a943ab974bef3766167cd74e4a","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-05-10T18:49:49Z","title_canon_sha256":"f6eed9b69c44eb7b996ada932d8167b10daa52f703e93ab073134ee95eb5b325"},"schema_version":"1.0","source":{"id":"1805.04131","kind":"arxiv","version":3}},"canonical_sha256":"57c5078e403a748563870bcc17bb390aba38601ddec031a7ba46749bbef02503","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"57c5078e403a748563870bcc17bb390aba38601ddec031a7ba46749bbef02503","first_computed_at":"2026-05-18T00:02:44.875183Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:44.875183Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"55ejHpvDidrJM94//qNU5+LIDWWcIshbqgB97m2H4lXAfhI1m+9HRjQVHEotu8tsnsJirJnZFCDQRrL3HIwgAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:44.875766Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.04131","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9ffbc0f26ac0148871e2e0adbf5dabfed477bf471925e7e53455d49b61ceac82","sha256:606f581d45513462cdca6783512a9f2e5fe2ecd71784828d68f140a2099a9d4e"],"state_sha256":"3e5bb1858a99ebe5899453a8e3f179fc49ff882e3b1e5dd6c783a81f7fd0e345"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J4uukqY9Qrfk0JSbwX3vo7+CkWz691u90S9mQB7oKIywWQNd/b62XCB5M92qxuZOY9BROZq5H1sfCf6UTZO9Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T19:55:34.391274Z","bundle_sha256":"8e7436b7cc1814487faeaf2664bc256c4315c3a6a963cea9f9001a2d28008921"}}