{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:YOI5OY2HVHKA4DQUVQYIFH4LHQ","short_pith_number":"pith:YOI5OY2H","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"},"canonical_sha256":"c391d76347a9d40e0e14ac30829f8b3c3077a74df1b049fd3d79428d9f44c528","source":{"kind":"arxiv","id":"1412.7994","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.7994","created_at":"2026-05-17T23:55:34Z"},{"alias_kind":"arxiv_version","alias_value":"1412.7994v5","created_at":"2026-05-17T23:55:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.7994","created_at":"2026-05-17T23:55:34Z"},{"alias_kind":"pith_short_12","alias_value":"YOI5OY2HVHKA","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"YOI5OY2HVHKA4DQU","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"YOI5OY2H","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:YOI5OY2HVHKA4DQUVQYIFH4LHQ","target":"record","payload":{"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"},"canonical_sha256":"c391d76347a9d40e0e14ac30829f8b3c3077a74df1b049fd3d79428d9f44c528","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"},"source_kind":"arxiv","source_id":"1412.7994","source_version":5,"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-05-17T23:55:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+zk7MlXhXY0vGpwV9NcFalV5IZtHsZCHMwkLOGMuX6kl0diCHT4P4dtlMidyE23RSNwm9EYMUiqB+HuKzZZbDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:20:19.507475Z"},"content_sha256":"348980eedfca79e55ec865d266f7404f65a0a355ee18b69283b5400f02ff2991","schema_version":"1.0","event_id":"sha256:348980eedfca79e55ec865d266f7404f65a0a355ee18b69283b5400f02ff2991"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:YOI5OY2HVHKA4DQUVQYIFH4LHQ","target":"graph","payload":{"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"},"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-05-17T23:55:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oRpT1L5NhOIZlymTBL1SHMG0a8xOcww04ugyUh7BzmiyTWiSO2nXVnDlnjsfD8h7K+IZP5HUQCpOoZZve7ArAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:20:19.508108Z"},"content_sha256":"422048238319cebfe331a162e79e9320b39dd7e8ea8cbd1d2961b2beba905a84","schema_version":"1.0","event_id":"sha256:422048238319cebfe331a162e79e9320b39dd7e8ea8cbd1d2961b2beba905a84"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YOI5OY2HVHKA4DQUVQYIFH4LHQ/bundle.json","state_url":"https://pith.science/pith/YOI5OY2HVHKA4DQUVQYIFH4LHQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YOI5OY2HVHKA4DQUVQYIFH4LHQ/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-05-27T22:20:19Z","links":{"resolver":"https://pith.science/pith/YOI5OY2HVHKA4DQUVQYIFH4LHQ","bundle":"https://pith.science/pith/YOI5OY2HVHKA4DQUVQYIFH4LHQ/bundle.json","state":"https://pith.science/pith/YOI5OY2HVHKA4DQUVQYIFH4LHQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YOI5OY2HVHKA4DQUVQYIFH4LHQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:YOI5OY2HVHKA4DQUVQYIFH4LHQ","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":"267cfdbc4d07f54eb277c73e404a5fc14ba74c4e43d4e4cbadcf999fe330d7d4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-26T21:36:03Z","title_canon_sha256":"f4d0ae175e2485a3b535e4c9d517adb71ebafaa2b75d1b8cf64fa2abe6a19233"},"schema_version":"1.0","source":{"id":"1412.7994","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.7994","created_at":"2026-05-17T23:55:34Z"},{"alias_kind":"arxiv_version","alias_value":"1412.7994v5","created_at":"2026-05-17T23:55:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.7994","created_at":"2026-05-17T23:55:34Z"},{"alias_kind":"pith_short_12","alias_value":"YOI5OY2HVHKA","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"YOI5OY2HVHKA4DQU","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"YOI5OY2H","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:422048238319cebfe331a162e79e9320b39dd7e8ea8cbd1d2961b2beba905a84","target":"graph","created_at":"2026-05-17T23:55:34Z","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"},"paper":{"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","authors_text":"Daniel Dadush, Divesh Aggarwal, Noah Stephens-Davidowitz, Oded Regev","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-26T21:36:03Z","title":"Solving the Shortest Vector Problem in $2^n$ Time via Discrete Gaussian Sampling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.7994","kind":"arxiv","version":5},"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:348980eedfca79e55ec865d266f7404f65a0a355ee18b69283b5400f02ff2991","target":"record","created_at":"2026-05-17T23:55:34Z","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":"267cfdbc4d07f54eb277c73e404a5fc14ba74c4e43d4e4cbadcf999fe330d7d4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-26T21:36:03Z","title_canon_sha256":"f4d0ae175e2485a3b535e4c9d517adb71ebafaa2b75d1b8cf64fa2abe6a19233"},"schema_version":"1.0","source":{"id":"1412.7994","kind":"arxiv","version":5}},"canonical_sha256":"c391d76347a9d40e0e14ac30829f8b3c3077a74df1b049fd3d79428d9f44c528","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c391d76347a9d40e0e14ac30829f8b3c3077a74df1b049fd3d79428d9f44c528","first_computed_at":"2026-05-17T23:55:34.975533Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:34.975533Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yOENnBrWt2zUUtnCs80NBMXaHg/BNqG7yi6s52HI4SrNe0Y+FC3gvZ6rwMcK7QCwG8kUS/b5Zr0UvF8eBa+nBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:34.975989Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.7994","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:348980eedfca79e55ec865d266f7404f65a0a355ee18b69283b5400f02ff2991","sha256:422048238319cebfe331a162e79e9320b39dd7e8ea8cbd1d2961b2beba905a84"],"state_sha256":"4272334226c7b4a0714690f501e1fd4ba89601faf90680cba6566ffc72c1f303"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"imtMfS6kwweVnjN+YgquHBs5mBt9GNCZsvBvYcbGxcLe08rSlQm17/kJ7HTbuXYX7pOJxONgveIhSecNsVI1Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T22:20:19.511813Z","bundle_sha256":"4cf1c6a5e41bbe4096033ede48dd41041d2ecc6418515cfce2861c2ca23636b2"}}