{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:VMVUNGVS3Q3EALS5DSAE2YIBPF","short_pith_number":"pith:VMVUNGVS","schema_version":"1.0","canonical_sha256":"ab2b469ab2dc36402e5d1c804d6101794174fc3d03129f171c800f93c3723ac6","source":{"kind":"arxiv","id":"1404.7569","version":2},"attestation_state":"computed","paper":{"title":"On the metric s-t path Traveling Salesman Problem","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Zhihan Gao","submitted_at":"2014-04-30T01:24:22Z","abstract_excerpt":"We study the metric $s$-$t$ path Traveling Salesman Problem (TSP). [An, Kleinberg, and Shmoys, STOC 2012] improved on the long standing $\\frac{5}{3}$-approximation factor and presented an algorithm that achieves an approximation factor of $\\frac{1+\\sqrt{5}}{2}\\approx1.61803$. Later [Seb\\H{o}, IPCO 2013] further improved the approximation factor to $\\frac{8}{5}$. We present a simple, self-contained analysis that unifies both results; our main contribution is a \\emph{unified correction vector}. We compare two different linear programming (LP) relaxations of the $s$-$t$ path TSP, namely, the path"},"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":"1404.7569","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.DS","submitted_at":"2014-04-30T01:24:22Z","cross_cats_sorted":[],"title_canon_sha256":"b43f681833172a87891a0ba07419fa39223fa27dcb8ae85637e9994ff4bbbd00","abstract_canon_sha256":"c40bee8e03fbd635625e57050aeb809834bad27a1904f91ef2e5cc400c3f5ea3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:27.160777Z","signature_b64":"/XTGT0FSJlw3tpDkkuf9k38BjpCWKOH6ekfLvlvgFfMx4LUOd9ZFRVTwatnDeqRgsWWTYMhvDRDi5Hh8T2NWAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab2b469ab2dc36402e5d1c804d6101794174fc3d03129f171c800f93c3723ac6","last_reissued_at":"2026-05-18T02:23:27.160103Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:27.160103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the metric s-t path Traveling Salesman Problem","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Zhihan Gao","submitted_at":"2014-04-30T01:24:22Z","abstract_excerpt":"We study the metric $s$-$t$ path Traveling Salesman Problem (TSP). [An, Kleinberg, and Shmoys, STOC 2012] improved on the long standing $\\frac{5}{3}$-approximation factor and presented an algorithm that achieves an approximation factor of $\\frac{1+\\sqrt{5}}{2}\\approx1.61803$. Later [Seb\\H{o}, IPCO 2013] further improved the approximation factor to $\\frac{8}{5}$. We present a simple, self-contained analysis that unifies both results; our main contribution is a \\emph{unified correction vector}. We compare two different linear programming (LP) relaxations of the $s$-$t$ path TSP, namely, the path"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.7569","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":""},"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":"1404.7569","created_at":"2026-05-18T02:23:27.160220+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.7569v2","created_at":"2026-05-18T02:23:27.160220+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.7569","created_at":"2026-05-18T02:23:27.160220+00:00"},{"alias_kind":"pith_short_12","alias_value":"VMVUNGVS3Q3E","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"VMVUNGVS3Q3EALS5","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"VMVUNGVS","created_at":"2026-05-18T12:28:54.890064+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/VMVUNGVS3Q3EALS5DSAE2YIBPF","json":"https://pith.science/pith/VMVUNGVS3Q3EALS5DSAE2YIBPF.json","graph_json":"https://pith.science/api/pith-number/VMVUNGVS3Q3EALS5DSAE2YIBPF/graph.json","events_json":"https://pith.science/api/pith-number/VMVUNGVS3Q3EALS5DSAE2YIBPF/events.json","paper":"https://pith.science/paper/VMVUNGVS"},"agent_actions":{"view_html":"https://pith.science/pith/VMVUNGVS3Q3EALS5DSAE2YIBPF","download_json":"https://pith.science/pith/VMVUNGVS3Q3EALS5DSAE2YIBPF.json","view_paper":"https://pith.science/paper/VMVUNGVS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.7569&json=true","fetch_graph":"https://pith.science/api/pith-number/VMVUNGVS3Q3EALS5DSAE2YIBPF/graph.json","fetch_events":"https://pith.science/api/pith-number/VMVUNGVS3Q3EALS5DSAE2YIBPF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VMVUNGVS3Q3EALS5DSAE2YIBPF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VMVUNGVS3Q3EALS5DSAE2YIBPF/action/storage_attestation","attest_author":"https://pith.science/pith/VMVUNGVS3Q3EALS5DSAE2YIBPF/action/author_attestation","sign_citation":"https://pith.science/pith/VMVUNGVS3Q3EALS5DSAE2YIBPF/action/citation_signature","submit_replication":"https://pith.science/pith/VMVUNGVS3Q3EALS5DSAE2YIBPF/action/replication_record"}},"created_at":"2026-05-18T02:23:27.160220+00:00","updated_at":"2026-05-18T02:23:27.160220+00:00"}