{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:43PJ63MLYOZKJOW24MNJTAYX32","short_pith_number":"pith:43PJ63ML","schema_version":"1.0","canonical_sha256":"e6de9f6d8bc3b2a4badae31a998317de8e037094c7eed17e025523d31f4af3df","source":{"kind":"arxiv","id":"1411.4613","version":4},"attestation_state":"computed","paper":{"title":"Effective-Resistance-Reducing Flows, Spectrally Thin Trees, and Asymmetric TSP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Nima Anari, Shayan Oveis Gharan","submitted_at":"2014-11-17T20:03:26Z","abstract_excerpt":"We show that the integrality gap of the natural LP relaxation of the Asymmetric Traveling Salesman Problem is $\\text{polyloglog}(n)$. In other words, there is a polynomial time algorithm that approximates the value of the optimum tour within a factor of $\\text{polyloglog}(n)$, where $\\text{polyloglog}(n)$ is a bounded degree polynomial of $\\log\\log(n)$. We prove this by showing that any $k$-edge-connected unweighted graph has a $\\text{polyloglog}(n)/k$-thin spanning tree.\n  Our main new ingredient is a procedure, albeit an exponentially sized convex program, that \"transforms\" graphs that do no"},"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":"1411.4613","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-17T20:03:26Z","cross_cats_sorted":[],"title_canon_sha256":"d9fa2eccb74c7e2e35061cfac138aa51e2351b98ed9f31d300939a52262019de","abstract_canon_sha256":"3236c98cf592e5e868076c27849c64e9816cd23204be5969eb11f7a1486da647"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:13.259846Z","signature_b64":"SUCGD8iBtlVQsKXWQP30SV/gWWkq4NFTgkB2Y2TEoSz74euQXPsLdui9+yfjteY9U1p1O2vt3T2aJqomzGT3DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6de9f6d8bc3b2a4badae31a998317de8e037094c7eed17e025523d31f4af3df","last_reissued_at":"2026-05-18T01:34:13.259280Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:13.259280Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Effective-Resistance-Reducing Flows, Spectrally Thin Trees, and Asymmetric TSP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Nima Anari, Shayan Oveis Gharan","submitted_at":"2014-11-17T20:03:26Z","abstract_excerpt":"We show that the integrality gap of the natural LP relaxation of the Asymmetric Traveling Salesman Problem is $\\text{polyloglog}(n)$. In other words, there is a polynomial time algorithm that approximates the value of the optimum tour within a factor of $\\text{polyloglog}(n)$, where $\\text{polyloglog}(n)$ is a bounded degree polynomial of $\\log\\log(n)$. We prove this by showing that any $k$-edge-connected unweighted graph has a $\\text{polyloglog}(n)/k$-thin spanning tree.\n  Our main new ingredient is a procedure, albeit an exponentially sized convex program, that \"transforms\" graphs that do no"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.4613","kind":"arxiv","version":4},"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":"1411.4613","created_at":"2026-05-18T01:34:13.259391+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.4613v4","created_at":"2026-05-18T01:34:13.259391+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.4613","created_at":"2026-05-18T01:34:13.259391+00:00"},{"alias_kind":"pith_short_12","alias_value":"43PJ63MLYOZK","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"43PJ63MLYOZKJOW2","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"43PJ63ML","created_at":"2026-05-18T12:28:11.866339+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/43PJ63MLYOZKJOW24MNJTAYX32","json":"https://pith.science/pith/43PJ63MLYOZKJOW24MNJTAYX32.json","graph_json":"https://pith.science/api/pith-number/43PJ63MLYOZKJOW24MNJTAYX32/graph.json","events_json":"https://pith.science/api/pith-number/43PJ63MLYOZKJOW24MNJTAYX32/events.json","paper":"https://pith.science/paper/43PJ63ML"},"agent_actions":{"view_html":"https://pith.science/pith/43PJ63MLYOZKJOW24MNJTAYX32","download_json":"https://pith.science/pith/43PJ63MLYOZKJOW24MNJTAYX32.json","view_paper":"https://pith.science/paper/43PJ63ML","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.4613&json=true","fetch_graph":"https://pith.science/api/pith-number/43PJ63MLYOZKJOW24MNJTAYX32/graph.json","fetch_events":"https://pith.science/api/pith-number/43PJ63MLYOZKJOW24MNJTAYX32/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/43PJ63MLYOZKJOW24MNJTAYX32/action/timestamp_anchor","attest_storage":"https://pith.science/pith/43PJ63MLYOZKJOW24MNJTAYX32/action/storage_attestation","attest_author":"https://pith.science/pith/43PJ63MLYOZKJOW24MNJTAYX32/action/author_attestation","sign_citation":"https://pith.science/pith/43PJ63MLYOZKJOW24MNJTAYX32/action/citation_signature","submit_replication":"https://pith.science/pith/43PJ63MLYOZKJOW24MNJTAYX32/action/replication_record"}},"created_at":"2026-05-18T01:34:13.259391+00:00","updated_at":"2026-05-18T01:34:13.259391+00:00"}