{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:CJEMH36LNMG5CVETHGXQLFTFVN","short_pith_number":"pith:CJEMH36L","schema_version":"1.0","canonical_sha256":"1248c3efcb6b0dd1549339af059665ab4e244b604d7b90b925e1372054c1a828","source":{"kind":"arxiv","id":"1802.01242","version":1},"attestation_state":"computed","paper":{"title":"Fast Approximations for Metric-TSP via Linear Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chandra Chekuri, Kent Quanrud","submitted_at":"2018-02-05T02:48:36Z","abstract_excerpt":"We develop faster approximation algorithms for Metric-TSP building on recent, nearly linear time approximation schemes for the LP relaxation [Chekuri and Quanrud, 2017]. We show that the LP solution can be sparsified via cut-sparsification techniques such as those of Benczur and Karger [2015]. Given a weighted graph $G$ with $m$ edges and $n$ vertices, and $\\epsilon > 0$, our randomized algorithm outputs with high probability a $(1+\\epsilon)$-approximate solution to the LP relaxation whose support has $\\operatorname{O}(n \\log n /\\epsilon^2)$ edges. The running time of the algorithm is $\\operat"},"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":"1802.01242","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-05T02:48:36Z","cross_cats_sorted":[],"title_canon_sha256":"422addcec57ba6d67fc8f6e3570fce654cc5fa616a20ebad6e329a5ca50492de","abstract_canon_sha256":"f013e695fa8bc823d01e26e4c7804d8983e9c538f695a46b0d9233a2d593d070"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:26.968413Z","signature_b64":"mYtY6ozM0REsU61ihKKj363QV+ykwG+zabLmtzR3TQGdiClp1HvcVxGpGAuqLnOxTJ9wOa+XkHnGsg+OKqX1Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1248c3efcb6b0dd1549339af059665ab4e244b604d7b90b925e1372054c1a828","last_reissued_at":"2026-05-18T00:24:26.967789Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:26.967789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Approximations for Metric-TSP via Linear Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chandra Chekuri, Kent Quanrud","submitted_at":"2018-02-05T02:48:36Z","abstract_excerpt":"We develop faster approximation algorithms for Metric-TSP building on recent, nearly linear time approximation schemes for the LP relaxation [Chekuri and Quanrud, 2017]. We show that the LP solution can be sparsified via cut-sparsification techniques such as those of Benczur and Karger [2015]. Given a weighted graph $G$ with $m$ edges and $n$ vertices, and $\\epsilon > 0$, our randomized algorithm outputs with high probability a $(1+\\epsilon)$-approximate solution to the LP relaxation whose support has $\\operatorname{O}(n \\log n /\\epsilon^2)$ edges. The running time of the algorithm is $\\operat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.01242","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1802.01242","created_at":"2026-05-18T00:24:26.967888+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.01242v1","created_at":"2026-05-18T00:24:26.967888+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.01242","created_at":"2026-05-18T00:24:26.967888+00:00"},{"alias_kind":"pith_short_12","alias_value":"CJEMH36LNMG5","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"CJEMH36LNMG5CVET","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"CJEMH36L","created_at":"2026-05-18T12:32:16.446611+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/CJEMH36LNMG5CVETHGXQLFTFVN","json":"https://pith.science/pith/CJEMH36LNMG5CVETHGXQLFTFVN.json","graph_json":"https://pith.science/api/pith-number/CJEMH36LNMG5CVETHGXQLFTFVN/graph.json","events_json":"https://pith.science/api/pith-number/CJEMH36LNMG5CVETHGXQLFTFVN/events.json","paper":"https://pith.science/paper/CJEMH36L"},"agent_actions":{"view_html":"https://pith.science/pith/CJEMH36LNMG5CVETHGXQLFTFVN","download_json":"https://pith.science/pith/CJEMH36LNMG5CVETHGXQLFTFVN.json","view_paper":"https://pith.science/paper/CJEMH36L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.01242&json=true","fetch_graph":"https://pith.science/api/pith-number/CJEMH36LNMG5CVETHGXQLFTFVN/graph.json","fetch_events":"https://pith.science/api/pith-number/CJEMH36LNMG5CVETHGXQLFTFVN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CJEMH36LNMG5CVETHGXQLFTFVN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CJEMH36LNMG5CVETHGXQLFTFVN/action/storage_attestation","attest_author":"https://pith.science/pith/CJEMH36LNMG5CVETHGXQLFTFVN/action/author_attestation","sign_citation":"https://pith.science/pith/CJEMH36LNMG5CVETHGXQLFTFVN/action/citation_signature","submit_replication":"https://pith.science/pith/CJEMH36LNMG5CVETHGXQLFTFVN/action/replication_record"}},"created_at":"2026-05-18T00:24:26.967888+00:00","updated_at":"2026-05-18T00:24:26.967888+00:00"}