{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:IWXP6XH6E7DN2PENMSXY75HI4Y","short_pith_number":"pith:IWXP6XH6","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"},"canonical_sha256":"45aeff5cfe27c6dd3c8d64af8ff4e8e637c243c6009571609b02bac3f25412c4","source":{"kind":"arxiv","id":"2011.03778","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.03778","created_at":"2026-07-05T09:05:58Z"},{"alias_kind":"arxiv_version","alias_value":"2011.03778v3","created_at":"2026-07-05T09:05:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.03778","created_at":"2026-07-05T09:05:58Z"},{"alias_kind":"pith_short_12","alias_value":"IWXP6XH6E7DN","created_at":"2026-07-05T09:05:58Z"},{"alias_kind":"pith_short_16","alias_value":"IWXP6XH6E7DN2PEN","created_at":"2026-07-05T09:05:58Z"},{"alias_kind":"pith_short_8","alias_value":"IWXP6XH6","created_at":"2026-07-05T09:05:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:IWXP6XH6E7DN2PENMSXY75HI4Y","target":"record","payload":{"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"},"canonical_sha256":"45aeff5cfe27c6dd3c8d64af8ff4e8e637c243c6009571609b02bac3f25412c4","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"},"source_kind":"arxiv","source_id":"2011.03778","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:05:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RSDRqJrIaBbodG0hQdGeEvpnp9sU6uexqctVs2v1vrTSqIkkuF3y2UHA9I6alUm/y4u+I2U9gNSCNkHW9CkfCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T14:22:52.267547Z"},"content_sha256":"27e7704b211ccf4b604151638fae29e4fbb8ba8299af244c14fa1dfc6d2781e6","schema_version":"1.0","event_id":"sha256:27e7704b211ccf4b604151638fae29e4fbb8ba8299af244c14fa1dfc6d2781e6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:IWXP6XH6E7DN2PENMSXY75HI4Y","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:05:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2XOucRm+jZrMT/NW8bsStUG2OHRRjveeV9w4ycId/g3A5XJg2rR4//+zzdlU/P1ydyXFAy4b7967ea2xd1rZAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T14:22:52.268130Z"},"content_sha256":"e5cf247384a95c4607abb12757147928f5ba9a039799ddbaddfa823c6d3ebf6c","schema_version":"1.0","event_id":"sha256:e5cf247384a95c4607abb12757147928f5ba9a039799ddbaddfa823c6d3ebf6c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IWXP6XH6E7DN2PENMSXY75HI4Y/bundle.json","state_url":"https://pith.science/pith/IWXP6XH6E7DN2PENMSXY75HI4Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IWXP6XH6E7DN2PENMSXY75HI4Y/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-15T14:22:52Z","links":{"resolver":"https://pith.science/pith/IWXP6XH6E7DN2PENMSXY75HI4Y","bundle":"https://pith.science/pith/IWXP6XH6E7DN2PENMSXY75HI4Y/bundle.json","state":"https://pith.science/pith/IWXP6XH6E7DN2PENMSXY75HI4Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IWXP6XH6E7DN2PENMSXY75HI4Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:IWXP6XH6E7DN2PENMSXY75HI4Y","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"185a7494fae281d828102b2ac7be2ccfb40515b19f202efdba9c5fc2096b7d82","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.CG","submitted_at":"2020-11-07T13:50:43Z","title_canon_sha256":"61a05d0557687a185e4b8f469f614be963dbe5961f72d2891be32144ed38e3f9"},"schema_version":"1.0","source":{"id":"2011.03778","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.03778","created_at":"2026-07-05T09:05:58Z"},{"alias_kind":"arxiv_version","alias_value":"2011.03778v3","created_at":"2026-07-05T09:05:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.03778","created_at":"2026-07-05T09:05:58Z"},{"alias_kind":"pith_short_12","alias_value":"IWXP6XH6E7DN","created_at":"2026-07-05T09:05:58Z"},{"alias_kind":"pith_short_16","alias_value":"IWXP6XH6E7DN2PEN","created_at":"2026-07-05T09:05:58Z"},{"alias_kind":"pith_short_8","alias_value":"IWXP6XH6","created_at":"2026-07-05T09:05:58Z"}],"graph_snapshots":[{"event_id":"sha256:e5cf247384a95c4607abb12757147928f5ba9a039799ddbaddfa823c6d3ebf6c","target":"graph","created_at":"2026-07-05T09:05:58Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2011.03778/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Jesper Nederlof, Karol W\\k{e}grzycki, S\\'andor Kisfaludi-Bak","cross_cats":["cs.CC","cs.DS"],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.CG","submitted_at":"2020-11-07T13:50:43Z","title":"A Gap-ETH-Tight Approximation Scheme for Euclidean TSP"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.03778","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:27e7704b211ccf4b604151638fae29e4fbb8ba8299af244c14fa1dfc6d2781e6","target":"record","created_at":"2026-07-05T09:05:58Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"185a7494fae281d828102b2ac7be2ccfb40515b19f202efdba9c5fc2096b7d82","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.CG","submitted_at":"2020-11-07T13:50:43Z","title_canon_sha256":"61a05d0557687a185e4b8f469f614be963dbe5961f72d2891be32144ed38e3f9"},"schema_version":"1.0","source":{"id":"2011.03778","kind":"arxiv","version":3}},"canonical_sha256":"45aeff5cfe27c6dd3c8d64af8ff4e8e637c243c6009571609b02bac3f25412c4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"45aeff5cfe27c6dd3c8d64af8ff4e8e637c243c6009571609b02bac3f25412c4","first_computed_at":"2026-07-05T09:05:58.429236Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:05:58.429236Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LD4vLAeMXGZ50iEvTzIbu18emeAkl28UmFNl+ZaQdIQAF71e8CDwpxNy+mjXf8PN/AQLUBM9y26YxaNNZ5yZDg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:05:58.429639Z","signed_message":"canonical_sha256_bytes"},"source_id":"2011.03778","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:27e7704b211ccf4b604151638fae29e4fbb8ba8299af244c14fa1dfc6d2781e6","sha256:e5cf247384a95c4607abb12757147928f5ba9a039799ddbaddfa823c6d3ebf6c"],"state_sha256":"9022d29fcbdf544288dd00c83a67be3093315686d89c4fd4cc33f03f61f358a1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4b7CfnZu8CL5bIxfm3E6qH1V/t+yOzdTXgeGqoIqXuPJBhNiYh+QU2AkglpmGcmIQ/fPfL73vKXE5R8QJfjjDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T14:22:52.273302Z","bundle_sha256":"1f5633747d27d41e10a08c4e8fc72f03e6dd3a118e861571cbda0495e1d67675"}}