{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:VHJ4EMENQZMWYO5WLSG7JIP2WS","short_pith_number":"pith:VHJ4EMEN","schema_version":"1.0","canonical_sha256":"a9d3c2308d86596c3bb65c8df4a1fab4ba3629df2a4b8cae31da01bc39832dfb","source":{"kind":"arxiv","id":"1112.0699","version":2},"attestation_state":"computed","paper":{"title":"The Traveling Salesman Problem: Low-Dimensionality Implies a Polynomial Time Approximation Scheme","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Lee-Ad Gottlieb, Robert Krauthgamer, Yair Bartal","submitted_at":"2011-12-03T22:58:13Z","abstract_excerpt":"The Traveling Salesman Problem (TSP) is among the most famous NP-hard optimization problems. We design for this problem a randomized polynomial-time algorithm that computes a (1+eps)-approximation to the optimal tour, for any fixed eps>0, in TSP instances that form an arbitrary metric space with bounded intrinsic dimension.\n  The celebrated results of Arora (A-98) and Mitchell (M-99) prove that the above result holds in the special case of TSP in a fixed-dimensional Euclidean space. Thus, our algorithm demonstrates that the algorithmic tractability of metric TSP depends on the dimensionality o"},"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":"1112.0699","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-12-03T22:58:13Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"97ef3b2a2c6d7796be7f1c826761cb9fb4485d3cad7082dfc86d51879a704ccc","abstract_canon_sha256":"4610b301d453633b1c3c5e361f3d6294302673a896ac8f29c06a50fcb8af0263"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:58.331401Z","signature_b64":"8rqxYPYnTeJ5HY4T7foQ24Iwtfh3HiENKISeHkDc7iRXitr05SAsBq/moWN+GmD21QoKBI5wgas3vFY1JJRxBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9d3c2308d86596c3bb65c8df4a1fab4ba3629df2a4b8cae31da01bc39832dfb","last_reissued_at":"2026-05-18T01:04:58.330546Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:58.330546Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Traveling Salesman Problem: Low-Dimensionality Implies a Polynomial Time Approximation Scheme","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Lee-Ad Gottlieb, Robert Krauthgamer, Yair Bartal","submitted_at":"2011-12-03T22:58:13Z","abstract_excerpt":"The Traveling Salesman Problem (TSP) is among the most famous NP-hard optimization problems. We design for this problem a randomized polynomial-time algorithm that computes a (1+eps)-approximation to the optimal tour, for any fixed eps>0, in TSP instances that form an arbitrary metric space with bounded intrinsic dimension.\n  The celebrated results of Arora (A-98) and Mitchell (M-99) prove that the above result holds in the special case of TSP in a fixed-dimensional Euclidean space. Thus, our algorithm demonstrates that the algorithmic tractability of metric TSP depends on the dimensionality o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.0699","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":"1112.0699","created_at":"2026-05-18T01:04:58.330684+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.0699v2","created_at":"2026-05-18T01:04:58.330684+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.0699","created_at":"2026-05-18T01:04:58.330684+00:00"},{"alias_kind":"pith_short_12","alias_value":"VHJ4EMENQZMW","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_16","alias_value":"VHJ4EMENQZMWYO5W","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_8","alias_value":"VHJ4EMEN","created_at":"2026-05-18T12:26:44.992195+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/VHJ4EMENQZMWYO5WLSG7JIP2WS","json":"https://pith.science/pith/VHJ4EMENQZMWYO5WLSG7JIP2WS.json","graph_json":"https://pith.science/api/pith-number/VHJ4EMENQZMWYO5WLSG7JIP2WS/graph.json","events_json":"https://pith.science/api/pith-number/VHJ4EMENQZMWYO5WLSG7JIP2WS/events.json","paper":"https://pith.science/paper/VHJ4EMEN"},"agent_actions":{"view_html":"https://pith.science/pith/VHJ4EMENQZMWYO5WLSG7JIP2WS","download_json":"https://pith.science/pith/VHJ4EMENQZMWYO5WLSG7JIP2WS.json","view_paper":"https://pith.science/paper/VHJ4EMEN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.0699&json=true","fetch_graph":"https://pith.science/api/pith-number/VHJ4EMENQZMWYO5WLSG7JIP2WS/graph.json","fetch_events":"https://pith.science/api/pith-number/VHJ4EMENQZMWYO5WLSG7JIP2WS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VHJ4EMENQZMWYO5WLSG7JIP2WS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VHJ4EMENQZMWYO5WLSG7JIP2WS/action/storage_attestation","attest_author":"https://pith.science/pith/VHJ4EMENQZMWYO5WLSG7JIP2WS/action/author_attestation","sign_citation":"https://pith.science/pith/VHJ4EMENQZMWYO5WLSG7JIP2WS/action/citation_signature","submit_replication":"https://pith.science/pith/VHJ4EMENQZMWYO5WLSG7JIP2WS/action/replication_record"}},"created_at":"2026-05-18T01:04:58.330684+00:00","updated_at":"2026-05-18T01:04:58.330684+00:00"}