{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:QVJCU5PUILUFY3BJ56QTLWWKFS","short_pith_number":"pith:QVJCU5PU","schema_version":"1.0","canonical_sha256":"85522a75f442e85c6c29efa135daca2cb3537bf8f1ed50c6d4b44c6e3edd60d8","source":{"kind":"arxiv","id":"1604.02486","version":2},"attestation_state":"computed","paper":{"title":"The Salesman's Improved Paths: 3/2+1/34 Integrality Gap and Approximation Ratio","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"Andr\\'as Seb\\H{o}, Anke van Zuylen","submitted_at":"2016-04-08T21:05:05Z","abstract_excerpt":"We give a new, strongly polynomial-time algorithm and improved analysis for the metric $s-t$ path TSP. It finds a tour of cost less than 1.53 times the optimum of the subtour elimination LP, while known examples show that 1.5 is a lower bound for the integrality gap.\n  A key new idea is the deletion of some edges of Christofides' trees, which is then accompanied by novel arguments of the analysis: edge-deletion disconnects the trees, which are then partly reconnected by `parity correction'. We show that the arising `connectivity correction' can be achieved for a minor extra cost.\n  On the one "},"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":"1604.02486","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-04-08T21:05:05Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"93589c128f2ab8c62ffbbaa8f3d5b2d83a55725bb7fa4f0ea93de545c55cb75b","abstract_canon_sha256":"f86c62f88f3f865c15acaab5030fb1d87d22b862677a37f827022a17e9313ee8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:12.609606Z","signature_b64":"o2o3RuQhmXvrBPx+INg/Vj+F/boB8f1EBll2nypM02K1+fDLIaCQnl5YEBX1L9uVS5jozWhpk/fwBb6NO1tGBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85522a75f442e85c6c29efa135daca2cb3537bf8f1ed50c6d4b44c6e3edd60d8","last_reissued_at":"2026-05-18T00:07:12.608955Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:12.608955Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Salesman's Improved Paths: 3/2+1/34 Integrality Gap and Approximation Ratio","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"Andr\\'as Seb\\H{o}, Anke van Zuylen","submitted_at":"2016-04-08T21:05:05Z","abstract_excerpt":"We give a new, strongly polynomial-time algorithm and improved analysis for the metric $s-t$ path TSP. It finds a tour of cost less than 1.53 times the optimum of the subtour elimination LP, while known examples show that 1.5 is a lower bound for the integrality gap.\n  A key new idea is the deletion of some edges of Christofides' trees, which is then accompanied by novel arguments of the analysis: edge-deletion disconnects the trees, which are then partly reconnected by `parity correction'. We show that the arising `connectivity correction' can be achieved for a minor extra cost.\n  On the one "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.02486","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":"1604.02486","created_at":"2026-05-18T00:07:12.609060+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.02486v2","created_at":"2026-05-18T00:07:12.609060+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.02486","created_at":"2026-05-18T00:07:12.609060+00:00"},{"alias_kind":"pith_short_12","alias_value":"QVJCU5PUILUF","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"QVJCU5PUILUFY3BJ","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"QVJCU5PU","created_at":"2026-05-18T12:30:41.710351+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/QVJCU5PUILUFY3BJ56QTLWWKFS","json":"https://pith.science/pith/QVJCU5PUILUFY3BJ56QTLWWKFS.json","graph_json":"https://pith.science/api/pith-number/QVJCU5PUILUFY3BJ56QTLWWKFS/graph.json","events_json":"https://pith.science/api/pith-number/QVJCU5PUILUFY3BJ56QTLWWKFS/events.json","paper":"https://pith.science/paper/QVJCU5PU"},"agent_actions":{"view_html":"https://pith.science/pith/QVJCU5PUILUFY3BJ56QTLWWKFS","download_json":"https://pith.science/pith/QVJCU5PUILUFY3BJ56QTLWWKFS.json","view_paper":"https://pith.science/paper/QVJCU5PU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.02486&json=true","fetch_graph":"https://pith.science/api/pith-number/QVJCU5PUILUFY3BJ56QTLWWKFS/graph.json","fetch_events":"https://pith.science/api/pith-number/QVJCU5PUILUFY3BJ56QTLWWKFS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QVJCU5PUILUFY3BJ56QTLWWKFS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QVJCU5PUILUFY3BJ56QTLWWKFS/action/storage_attestation","attest_author":"https://pith.science/pith/QVJCU5PUILUFY3BJ56QTLWWKFS/action/author_attestation","sign_citation":"https://pith.science/pith/QVJCU5PUILUFY3BJ56QTLWWKFS/action/citation_signature","submit_replication":"https://pith.science/pith/QVJCU5PUILUFY3BJ56QTLWWKFS/action/replication_record"}},"created_at":"2026-05-18T00:07:12.609060+00:00","updated_at":"2026-05-18T00:07:12.609060+00:00"}