{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:E6YOTMWH2Q52I6FHEFEDROBFPL","short_pith_number":"pith:E6YOTMWH","schema_version":"1.0","canonical_sha256":"27b0e9b2c7d43ba478a7214838b8257af6a074263d6c212ae94de5188fde8958","source":{"kind":"arxiv","id":"1908.08384","version":3},"attestation_state":"computed","paper":{"title":"Covering convex bodies and the Closest Vector Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"M\\'arton Nasz\\'odi, Moritz Venzin","submitted_at":"2019-08-22T13:58:33Z","abstract_excerpt":"We present algorithms for the $(1+\\epsilon)$-approximate version of the closest vector problem for certain norms. The currently fastest algorithm (Dadush and Kun 2016) for general norms has running time of $2^{O(n)} (1/\\epsilon)^n$. We improve this substantially in the following two cases. For $\\ell_p$-norms with $p>2$ (resp. $p \\in [1,2]$) fixed, we present an algorithm with a running time of $2^{O(n)} (1/\\epsilon)^{n/2}$ (resp. $2^{O(n)} (1/\\epsilon)^{n/p}$). This result is based on a geometric covering problem, that was introduced in the context of CVP by Eisenbrand et al.: How many convex "},"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":"1908.08384","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-22T13:58:33Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"5748c3d5ba90dc9ab0fcc805cc3da725524356177bb34dcdc232126f687906cc","abstract_canon_sha256":"e3ff433ee464ac916569480bccf35764f35b98364ba324a4642b8c1d8954e87c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:27:54.293493Z","signature_b64":"Yjkz+MJTJUaKK1OwqbAdKCWJ500hCpmHQU95oX1wYqGlRn6HRpznsVHEkuGuT5R+tz09RNG0YJm53whc3+7rAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27b0e9b2c7d43ba478a7214838b8257af6a074263d6c212ae94de5188fde8958","last_reissued_at":"2026-07-05T03:27:54.292929Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:27:54.292929Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Covering convex bodies and the Closest Vector Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"M\\'arton Nasz\\'odi, Moritz Venzin","submitted_at":"2019-08-22T13:58:33Z","abstract_excerpt":"We present algorithms for the $(1+\\epsilon)$-approximate version of the closest vector problem for certain norms. The currently fastest algorithm (Dadush and Kun 2016) for general norms has running time of $2^{O(n)} (1/\\epsilon)^n$. We improve this substantially in the following two cases. For $\\ell_p$-norms with $p>2$ (resp. $p \\in [1,2]$) fixed, we present an algorithm with a running time of $2^{O(n)} (1/\\epsilon)^{n/2}$ (resp. $2^{O(n)} (1/\\epsilon)^{n/p}$). This result is based on a geometric covering problem, that was introduced in the context of CVP by Eisenbrand et al.: How many convex "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.08384","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/1908.08384/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":"1908.08384","created_at":"2026-07-05T03:27:54.292997+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.08384v3","created_at":"2026-07-05T03:27:54.292997+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.08384","created_at":"2026-07-05T03:27:54.292997+00:00"},{"alias_kind":"pith_short_12","alias_value":"E6YOTMWH2Q52","created_at":"2026-07-05T03:27:54.292997+00:00"},{"alias_kind":"pith_short_16","alias_value":"E6YOTMWH2Q52I6FH","created_at":"2026-07-05T03:27:54.292997+00:00"},{"alias_kind":"pith_short_8","alias_value":"E6YOTMWH","created_at":"2026-07-05T03:27:54.292997+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/E6YOTMWH2Q52I6FHEFEDROBFPL","json":"https://pith.science/pith/E6YOTMWH2Q52I6FHEFEDROBFPL.json","graph_json":"https://pith.science/api/pith-number/E6YOTMWH2Q52I6FHEFEDROBFPL/graph.json","events_json":"https://pith.science/api/pith-number/E6YOTMWH2Q52I6FHEFEDROBFPL/events.json","paper":"https://pith.science/paper/E6YOTMWH"},"agent_actions":{"view_html":"https://pith.science/pith/E6YOTMWH2Q52I6FHEFEDROBFPL","download_json":"https://pith.science/pith/E6YOTMWH2Q52I6FHEFEDROBFPL.json","view_paper":"https://pith.science/paper/E6YOTMWH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.08384&json=true","fetch_graph":"https://pith.science/api/pith-number/E6YOTMWH2Q52I6FHEFEDROBFPL/graph.json","fetch_events":"https://pith.science/api/pith-number/E6YOTMWH2Q52I6FHEFEDROBFPL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E6YOTMWH2Q52I6FHEFEDROBFPL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E6YOTMWH2Q52I6FHEFEDROBFPL/action/storage_attestation","attest_author":"https://pith.science/pith/E6YOTMWH2Q52I6FHEFEDROBFPL/action/author_attestation","sign_citation":"https://pith.science/pith/E6YOTMWH2Q52I6FHEFEDROBFPL/action/citation_signature","submit_replication":"https://pith.science/pith/E6YOTMWH2Q52I6FHEFEDROBFPL/action/replication_record"}},"created_at":"2026-07-05T03:27:54.292997+00:00","updated_at":"2026-07-05T03:27:54.292997+00:00"}