{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:IWXP6XH6E7DN2PENMSXY75HI4Y","short_pith_number":"pith:IWXP6XH6","schema_version":"1.0","canonical_sha256":"45aeff5cfe27c6dd3c8d64af8ff4e8e637c243c6009571609b02bac3f25412c4","source":{"kind":"arxiv","id":"2011.03778","version":3},"attestation_state":"computed","paper":{"title":"A Gap-ETH-Tight Approximation Scheme for Euclidean TSP","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"cs.CG","authors_text":"Jesper Nederlof, Karol W\\k{e}grzycki, S\\'andor Kisfaludi-Bak","submitted_at":"2020-11-07T13:50:43Z","abstract_excerpt":"We revisit the classic task of finding the shortest tour of $n$ points in $d$-dimensional Euclidean space, for any fixed constant $d \\geq 2$. We determine the optimal dependence on $\\varepsilon$ in the running time of an algorithm that computes a $(1+\\varepsilon)$-approximate tour, under a plausible assumption. Specifically, we give an algorithm that runs in $2^{\\mathcal{O}(1/\\varepsilon^{d-1})} n\\log n$ time. This improves the previously smallest dependence on $\\varepsilon$ in the running time $(1/\\varepsilon)^{\\mathcal{O}(1/\\varepsilon^{d-1})}n \\log n$ of the algorithm by Rao and Smith~(STOC"},"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":"2011.03778","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.CG","submitted_at":"2020-11-07T13:50:43Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"61a05d0557687a185e4b8f469f614be963dbe5961f72d2891be32144ed38e3f9","abstract_canon_sha256":"185a7494fae281d828102b2ac7be2ccfb40515b19f202efdba9c5fc2096b7d82"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:05:58.429639Z","signature_b64":"LD4vLAeMXGZ50iEvTzIbu18emeAkl28UmFNl+ZaQdIQAF71e8CDwpxNy+mjXf8PN/AQLUBM9y26YxaNNZ5yZDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45aeff5cfe27c6dd3c8d64af8ff4e8e637c243c6009571609b02bac3f25412c4","last_reissued_at":"2026-07-05T09:05:58.429236Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:05:58.429236Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Gap-ETH-Tight Approximation Scheme for Euclidean TSP","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"cs.CG","authors_text":"Jesper Nederlof, Karol W\\k{e}grzycki, S\\'andor Kisfaludi-Bak","submitted_at":"2020-11-07T13:50:43Z","abstract_excerpt":"We revisit the classic task of finding the shortest tour of $n$ points in $d$-dimensional Euclidean space, for any fixed constant $d \\geq 2$. We determine the optimal dependence on $\\varepsilon$ in the running time of an algorithm that computes a $(1+\\varepsilon)$-approximate tour, under a plausible assumption. Specifically, we give an algorithm that runs in $2^{\\mathcal{O}(1/\\varepsilon^{d-1})} n\\log n$ time. This improves the previously smallest dependence on $\\varepsilon$ in the running time $(1/\\varepsilon)^{\\mathcal{O}(1/\\varepsilon^{d-1})}n \\log n$ of the algorithm by Rao and Smith~(STOC"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.03778","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2011.03778/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2011.03778","created_at":"2026-07-05T09:05:58.429290+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.03778v3","created_at":"2026-07-05T09:05:58.429290+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.03778","created_at":"2026-07-05T09:05:58.429290+00:00"},{"alias_kind":"pith_short_12","alias_value":"IWXP6XH6E7DN","created_at":"2026-07-05T09:05:58.429290+00:00"},{"alias_kind":"pith_short_16","alias_value":"IWXP6XH6E7DN2PEN","created_at":"2026-07-05T09:05:58.429290+00:00"},{"alias_kind":"pith_short_8","alias_value":"IWXP6XH6","created_at":"2026-07-05T09:05:58.429290+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/IWXP6XH6E7DN2PENMSXY75HI4Y","json":"https://pith.science/pith/IWXP6XH6E7DN2PENMSXY75HI4Y.json","graph_json":"https://pith.science/api/pith-number/IWXP6XH6E7DN2PENMSXY75HI4Y/graph.json","events_json":"https://pith.science/api/pith-number/IWXP6XH6E7DN2PENMSXY75HI4Y/events.json","paper":"https://pith.science/paper/IWXP6XH6"},"agent_actions":{"view_html":"https://pith.science/pith/IWXP6XH6E7DN2PENMSXY75HI4Y","download_json":"https://pith.science/pith/IWXP6XH6E7DN2PENMSXY75HI4Y.json","view_paper":"https://pith.science/paper/IWXP6XH6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.03778&json=true","fetch_graph":"https://pith.science/api/pith-number/IWXP6XH6E7DN2PENMSXY75HI4Y/graph.json","fetch_events":"https://pith.science/api/pith-number/IWXP6XH6E7DN2PENMSXY75HI4Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IWXP6XH6E7DN2PENMSXY75HI4Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IWXP6XH6E7DN2PENMSXY75HI4Y/action/storage_attestation","attest_author":"https://pith.science/pith/IWXP6XH6E7DN2PENMSXY75HI4Y/action/author_attestation","sign_citation":"https://pith.science/pith/IWXP6XH6E7DN2PENMSXY75HI4Y/action/citation_signature","submit_replication":"https://pith.science/pith/IWXP6XH6E7DN2PENMSXY75HI4Y/action/replication_record"}},"created_at":"2026-07-05T09:05:58.429290+00:00","updated_at":"2026-07-05T09:05:58.429290+00:00"}