{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ZS5DQEJBJNVBVQV75MMB7LR3MO","short_pith_number":"pith:ZS5DQEJB","schema_version":"1.0","canonical_sha256":"ccba3811214b6a1ac2bfeb181fae3b63900af43b330dc65add16a2e14a771cb5","source":{"kind":"arxiv","id":"1504.01995","version":2},"attestation_state":"computed","paper":{"title":"Solving the Closest Vector Problem in $2^n$ Time--- The Discrete Gaussian Strikes Again!","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel Dadush, Divesh Aggarwal, Noah Stephens-Davidowitz","submitted_at":"2015-04-08T14:54:39Z","abstract_excerpt":"We give a $2^{n+o(n)}$-time and space randomized algorithm for solving the exact Closest Vector Problem (CVP) on $n$-dimensional Euclidean lattices. This improves on the previous fastest algorithm, the deterministic $\\widetilde{O}(4^{n})$-time and $\\widetilde{O}(2^{n})$-space algorithm of Micciancio and Voulgaris.\n  We achieve our main result in three steps. First, we show how to modify the sampling algorithm from [ADRS15] to solve the problem of discrete Gaussian sampling over lattice shifts, $L- t$, with very low parameters. While the actual algorithm is a natural generalization of [ADRS15],"},"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":"1504.01995","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-08T14:54:39Z","cross_cats_sorted":[],"title_canon_sha256":"2040f1ba9aae9a9a386b86bff1c4b1b7566817af3ba3fb5ab757690dca8b5faf","abstract_canon_sha256":"4d0187fd665d4e7d726d4a91701426fab7fa5ec701354f8ac6405f3e97cbce3a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:34.961424Z","signature_b64":"rXYUy2QPbSREqe6RybdQmQ53iBo6Bv5HhNd6EkSVGzLwZZV+U0S9iJa02ZnKZAOs4KUiEDU17/8S7kqI7IqfBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ccba3811214b6a1ac2bfeb181fae3b63900af43b330dc65add16a2e14a771cb5","last_reissued_at":"2026-05-17T23:55:34.960974Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:34.960974Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving the Closest Vector Problem in $2^n$ Time--- The Discrete Gaussian Strikes Again!","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel Dadush, Divesh Aggarwal, Noah Stephens-Davidowitz","submitted_at":"2015-04-08T14:54:39Z","abstract_excerpt":"We give a $2^{n+o(n)}$-time and space randomized algorithm for solving the exact Closest Vector Problem (CVP) on $n$-dimensional Euclidean lattices. This improves on the previous fastest algorithm, the deterministic $\\widetilde{O}(4^{n})$-time and $\\widetilde{O}(2^{n})$-space algorithm of Micciancio and Voulgaris.\n  We achieve our main result in three steps. First, we show how to modify the sampling algorithm from [ADRS15] to solve the problem of discrete Gaussian sampling over lattice shifts, $L- t$, with very low parameters. While the actual algorithm is a natural generalization of [ADRS15],"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.01995","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":"1504.01995","created_at":"2026-05-17T23:55:34.961032+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.01995v2","created_at":"2026-05-17T23:55:34.961032+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.01995","created_at":"2026-05-17T23:55:34.961032+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZS5DQEJBJNVB","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZS5DQEJBJNVBVQV7","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZS5DQEJB","created_at":"2026-05-18T12:29:52.810259+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/ZS5DQEJBJNVBVQV75MMB7LR3MO","json":"https://pith.science/pith/ZS5DQEJBJNVBVQV75MMB7LR3MO.json","graph_json":"https://pith.science/api/pith-number/ZS5DQEJBJNVBVQV75MMB7LR3MO/graph.json","events_json":"https://pith.science/api/pith-number/ZS5DQEJBJNVBVQV75MMB7LR3MO/events.json","paper":"https://pith.science/paper/ZS5DQEJB"},"agent_actions":{"view_html":"https://pith.science/pith/ZS5DQEJBJNVBVQV75MMB7LR3MO","download_json":"https://pith.science/pith/ZS5DQEJBJNVBVQV75MMB7LR3MO.json","view_paper":"https://pith.science/paper/ZS5DQEJB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.01995&json=true","fetch_graph":"https://pith.science/api/pith-number/ZS5DQEJBJNVBVQV75MMB7LR3MO/graph.json","fetch_events":"https://pith.science/api/pith-number/ZS5DQEJBJNVBVQV75MMB7LR3MO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZS5DQEJBJNVBVQV75MMB7LR3MO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZS5DQEJBJNVBVQV75MMB7LR3MO/action/storage_attestation","attest_author":"https://pith.science/pith/ZS5DQEJBJNVBVQV75MMB7LR3MO/action/author_attestation","sign_citation":"https://pith.science/pith/ZS5DQEJBJNVBVQV75MMB7LR3MO/action/citation_signature","submit_replication":"https://pith.science/pith/ZS5DQEJBJNVBVQV75MMB7LR3MO/action/replication_record"}},"created_at":"2026-05-17T23:55:34.961032+00:00","updated_at":"2026-05-17T23:55:34.961032+00:00"}