{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:YOI5OY2HVHKA4DQUVQYIFH4LHQ","short_pith_number":"pith:YOI5OY2H","schema_version":"1.0","canonical_sha256":"c391d76347a9d40e0e14ac30829f8b3c3077a74df1b049fd3d79428d9f44c528","source":{"kind":"arxiv","id":"1412.7994","version":5},"attestation_state":"computed","paper":{"title":"Solving the Shortest Vector Problem in $2^n$ Time via Discrete Gaussian Sampling","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, Oded Regev","submitted_at":"2014-12-26T21:36:03Z","abstract_excerpt":"We give a randomized $2^{n+o(n)}$-time and space algorithm for solving the Shortest Vector Problem (SVP) 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 (STOC 2010, SIAM J. Comp. 2013).\n  In fact, we give a conceptually simple algorithm that solves the (in our opinion, even more interesting) problem of discrete Gaussian sampling (DGS). More specifically, we show how to sample $2^{n/2}$ vectors from the discrete Gaussian distribution at any param"},"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":"1412.7994","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-26T21:36:03Z","cross_cats_sorted":[],"title_canon_sha256":"f4d0ae175e2485a3b535e4c9d517adb71ebafaa2b75d1b8cf64fa2abe6a19233","abstract_canon_sha256":"267cfdbc4d07f54eb277c73e404a5fc14ba74c4e43d4e4cbadcf999fe330d7d4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:34.975989Z","signature_b64":"yOENnBrWt2zUUtnCs80NBMXaHg/BNqG7yi6s52HI4SrNe0Y+FC3gvZ6rwMcK7QCwG8kUS/b5Zr0UvF8eBa+nBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c391d76347a9d40e0e14ac30829f8b3c3077a74df1b049fd3d79428d9f44c528","last_reissued_at":"2026-05-17T23:55:34.975533Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:34.975533Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving the Shortest Vector Problem in $2^n$ Time via Discrete Gaussian Sampling","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, Oded Regev","submitted_at":"2014-12-26T21:36:03Z","abstract_excerpt":"We give a randomized $2^{n+o(n)}$-time and space algorithm for solving the Shortest Vector Problem (SVP) 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 (STOC 2010, SIAM J. Comp. 2013).\n  In fact, we give a conceptually simple algorithm that solves the (in our opinion, even more interesting) problem of discrete Gaussian sampling (DGS). More specifically, we show how to sample $2^{n/2}$ vectors from the discrete Gaussian distribution at any param"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.7994","kind":"arxiv","version":5},"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":"1412.7994","created_at":"2026-05-17T23:55:34.975599+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.7994v5","created_at":"2026-05-17T23:55:34.975599+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.7994","created_at":"2026-05-17T23:55:34.975599+00:00"},{"alias_kind":"pith_short_12","alias_value":"YOI5OY2HVHKA","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"YOI5OY2HVHKA4DQU","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"YOI5OY2H","created_at":"2026-05-18T12:28:57.508820+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.03220","citing_title":"One Discrete Gaussian Sample in $2^{n/2+o(n)}$ Time","ref_index":2015,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YOI5OY2HVHKA4DQUVQYIFH4LHQ","json":"https://pith.science/pith/YOI5OY2HVHKA4DQUVQYIFH4LHQ.json","graph_json":"https://pith.science/api/pith-number/YOI5OY2HVHKA4DQUVQYIFH4LHQ/graph.json","events_json":"https://pith.science/api/pith-number/YOI5OY2HVHKA4DQUVQYIFH4LHQ/events.json","paper":"https://pith.science/paper/YOI5OY2H"},"agent_actions":{"view_html":"https://pith.science/pith/YOI5OY2HVHKA4DQUVQYIFH4LHQ","download_json":"https://pith.science/pith/YOI5OY2HVHKA4DQUVQYIFH4LHQ.json","view_paper":"https://pith.science/paper/YOI5OY2H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.7994&json=true","fetch_graph":"https://pith.science/api/pith-number/YOI5OY2HVHKA4DQUVQYIFH4LHQ/graph.json","fetch_events":"https://pith.science/api/pith-number/YOI5OY2HVHKA4DQUVQYIFH4LHQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YOI5OY2HVHKA4DQUVQYIFH4LHQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YOI5OY2HVHKA4DQUVQYIFH4LHQ/action/storage_attestation","attest_author":"https://pith.science/pith/YOI5OY2HVHKA4DQUVQYIFH4LHQ/action/author_attestation","sign_citation":"https://pith.science/pith/YOI5OY2HVHKA4DQUVQYIFH4LHQ/action/citation_signature","submit_replication":"https://pith.science/pith/YOI5OY2HVHKA4DQUVQYIFH4LHQ/action/replication_record"}},"created_at":"2026-05-17T23:55:34.975599+00:00","updated_at":"2026-05-17T23:55:34.975599+00:00"}