{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ZS5DQEJBJNVBVQV75MMB7LR3MO","short_pith_number":"pith:ZS5DQEJB","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"},"canonical_sha256":"ccba3811214b6a1ac2bfeb181fae3b63900af43b330dc65add16a2e14a771cb5","source":{"kind":"arxiv","id":"1504.01995","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.01995","created_at":"2026-05-17T23:55:34Z"},{"alias_kind":"arxiv_version","alias_value":"1504.01995v2","created_at":"2026-05-17T23:55:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.01995","created_at":"2026-05-17T23:55:34Z"},{"alias_kind":"pith_short_12","alias_value":"ZS5DQEJBJNVB","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZS5DQEJBJNVBVQV7","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZS5DQEJB","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ZS5DQEJBJNVBVQV75MMB7LR3MO","target":"record","payload":{"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"},"canonical_sha256":"ccba3811214b6a1ac2bfeb181fae3b63900af43b330dc65add16a2e14a771cb5","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"},"source_kind":"arxiv","source_id":"1504.01995","source_version":2,"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":"eqzTDxRsTaHMOUWshWgh0yQTgWN6+I+M/nySCFHocsE+F9kIFF2VVz+bl6Bmo1mCyVvVUA6i3AGzOvgPzD9rCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:18:14.389339Z"},"content_sha256":"864f59557c344f04d60146966be501bc18ffb752e93fbb7f0ffd8d1cdc6e2325","schema_version":"1.0","event_id":"sha256:864f59557c344f04d60146966be501bc18ffb752e93fbb7f0ffd8d1cdc6e2325"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ZS5DQEJBJNVBVQV75MMB7LR3MO","target":"graph","payload":{"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"},"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":"xYspUEzehC3XlNeYlI56Oa+4brHTvn7YiTgdtosZmpBWhs7v6jLT0e0SCutk5wWukOZNGR3D48dynu2eciKuCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:18:14.390008Z"},"content_sha256":"689751d4bd18642707b485112fbd820ee904cbb7f98d40e7765680605b764ce9","schema_version":"1.0","event_id":"sha256:689751d4bd18642707b485112fbd820ee904cbb7f98d40e7765680605b764ce9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZS5DQEJBJNVBVQV75MMB7LR3MO/bundle.json","state_url":"https://pith.science/pith/ZS5DQEJBJNVBVQV75MMB7LR3MO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZS5DQEJBJNVBVQV75MMB7LR3MO/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-27T01:18:14Z","links":{"resolver":"https://pith.science/pith/ZS5DQEJBJNVBVQV75MMB7LR3MO","bundle":"https://pith.science/pith/ZS5DQEJBJNVBVQV75MMB7LR3MO/bundle.json","state":"https://pith.science/pith/ZS5DQEJBJNVBVQV75MMB7LR3MO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZS5DQEJBJNVBVQV75MMB7LR3MO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ZS5DQEJBJNVBVQV75MMB7LR3MO","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":"4d0187fd665d4e7d726d4a91701426fab7fa5ec701354f8ac6405f3e97cbce3a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-08T14:54:39Z","title_canon_sha256":"2040f1ba9aae9a9a386b86bff1c4b1b7566817af3ba3fb5ab757690dca8b5faf"},"schema_version":"1.0","source":{"id":"1504.01995","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.01995","created_at":"2026-05-17T23:55:34Z"},{"alias_kind":"arxiv_version","alias_value":"1504.01995v2","created_at":"2026-05-17T23:55:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.01995","created_at":"2026-05-17T23:55:34Z"},{"alias_kind":"pith_short_12","alias_value":"ZS5DQEJBJNVB","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZS5DQEJBJNVBVQV7","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZS5DQEJB","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:689751d4bd18642707b485112fbd820ee904cbb7f98d40e7765680605b764ce9","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 $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],","authors_text":"Daniel Dadush, Divesh Aggarwal, Noah Stephens-Davidowitz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-08T14:54:39Z","title":"Solving the Closest Vector Problem in $2^n$ Time--- The Discrete Gaussian Strikes Again!"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.01995","kind":"arxiv","version":2},"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:864f59557c344f04d60146966be501bc18ffb752e93fbb7f0ffd8d1cdc6e2325","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":"4d0187fd665d4e7d726d4a91701426fab7fa5ec701354f8ac6405f3e97cbce3a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-08T14:54:39Z","title_canon_sha256":"2040f1ba9aae9a9a386b86bff1c4b1b7566817af3ba3fb5ab757690dca8b5faf"},"schema_version":"1.0","source":{"id":"1504.01995","kind":"arxiv","version":2}},"canonical_sha256":"ccba3811214b6a1ac2bfeb181fae3b63900af43b330dc65add16a2e14a771cb5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ccba3811214b6a1ac2bfeb181fae3b63900af43b330dc65add16a2e14a771cb5","first_computed_at":"2026-05-17T23:55:34.960974Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:34.960974Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rXYUy2QPbSREqe6RybdQmQ53iBo6Bv5HhNd6EkSVGzLwZZV+U0S9iJa02ZnKZAOs4KUiEDU17/8S7kqI7IqfBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:34.961424Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.01995","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:864f59557c344f04d60146966be501bc18ffb752e93fbb7f0ffd8d1cdc6e2325","sha256:689751d4bd18642707b485112fbd820ee904cbb7f98d40e7765680605b764ce9"],"state_sha256":"3f91878a84bdfbe358fa533047cfd4016e12926f54c5f27b607b450b4a157ccd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yjGwBB4EBQzajKAuRq5nfLEKRDNvSuLl3JMNGu9Nny6ZPvq81mwy9thnYhuSc0enA9a8phGJhQMt3XY+FuUZDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T01:18:14.393707Z","bundle_sha256":"8f8411850b0e0b21332bdeec1fcf167e67aabd677127fb6b744ddf61dcb35bb8"}}