{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:U7EMB3C5BKWDT5EZ5BRDSHMPQP","short_pith_number":"pith:U7EMB3C5","schema_version":"1.0","canonical_sha256":"a7c8c0ec5d0aac39f499e862391d8f83d173e6b03d35c925b509063e909936a4","source":{"kind":"arxiv","id":"1506.07490","version":4},"attestation_state":"computed","paper":{"title":"Discrete Gaussian Sampling Reduces to CVP and SVP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Noah Stephens-Davidowitz","submitted_at":"2015-06-24T18:18:54Z","abstract_excerpt":"The discrete Gaussian $D_{L- t, s}$ is the distribution that assigns to each vector $x$ in a shifted lattice $L - t$ probability proportional to $e^{-\\pi \\|x\\|^2/s^2}$. It has long been an important tool in the study of lattices. More recently, algorithms for discrete Gaussian sampling (DGS) have found many applications in computer science. In particular, polynomial-time algorithms for DGS with very high parameters $s$ have found many uses in cryptography and in reductions between lattice problems. And, in the past year, Aggarwal, Dadush, Regev, and Stephens-Davidowitz showed $2^{n+o(n)}$-time"},"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":"1506.07490","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-06-24T18:18:54Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"50916144e4ac63b268ea275ae43b1c32d5536a1ef936306a778ad94fc472b817","abstract_canon_sha256":"bda11320cd6bfca021970158fda942d099b6d00a173b25a523b87d3e7b71423a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:34.948494Z","signature_b64":"w3C39VHzY1pmpSZZ0hy8MMigoyg564zrt32LbI/F31kVkw8KHiOSw5jh2/vcCUooAD5Km3bTBbTON8ohSGn2AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7c8c0ec5d0aac39f499e862391d8f83d173e6b03d35c925b509063e909936a4","last_reissued_at":"2026-05-17T23:55:34.947979Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:34.947979Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Discrete Gaussian Sampling Reduces to CVP and SVP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Noah Stephens-Davidowitz","submitted_at":"2015-06-24T18:18:54Z","abstract_excerpt":"The discrete Gaussian $D_{L- t, s}$ is the distribution that assigns to each vector $x$ in a shifted lattice $L - t$ probability proportional to $e^{-\\pi \\|x\\|^2/s^2}$. It has long been an important tool in the study of lattices. More recently, algorithms for discrete Gaussian sampling (DGS) have found many applications in computer science. In particular, polynomial-time algorithms for DGS with very high parameters $s$ have found many uses in cryptography and in reductions between lattice problems. And, in the past year, Aggarwal, Dadush, Regev, and Stephens-Davidowitz showed $2^{n+o(n)}$-time"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.07490","kind":"arxiv","version":4},"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":"1506.07490","created_at":"2026-05-17T23:55:34.948051+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.07490v4","created_at":"2026-05-17T23:55:34.948051+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.07490","created_at":"2026-05-17T23:55:34.948051+00:00"},{"alias_kind":"pith_short_12","alias_value":"U7EMB3C5BKWD","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"U7EMB3C5BKWDT5EZ","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"U7EMB3C5","created_at":"2026-05-18T12:29:44.643036+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.09119","citing_title":"Deterministic Sampling Decoding: Where Sphere Decoding Meets Lattice Gaussian Distribution","ref_index":44,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/U7EMB3C5BKWDT5EZ5BRDSHMPQP","json":"https://pith.science/pith/U7EMB3C5BKWDT5EZ5BRDSHMPQP.json","graph_json":"https://pith.science/api/pith-number/U7EMB3C5BKWDT5EZ5BRDSHMPQP/graph.json","events_json":"https://pith.science/api/pith-number/U7EMB3C5BKWDT5EZ5BRDSHMPQP/events.json","paper":"https://pith.science/paper/U7EMB3C5"},"agent_actions":{"view_html":"https://pith.science/pith/U7EMB3C5BKWDT5EZ5BRDSHMPQP","download_json":"https://pith.science/pith/U7EMB3C5BKWDT5EZ5BRDSHMPQP.json","view_paper":"https://pith.science/paper/U7EMB3C5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.07490&json=true","fetch_graph":"https://pith.science/api/pith-number/U7EMB3C5BKWDT5EZ5BRDSHMPQP/graph.json","fetch_events":"https://pith.science/api/pith-number/U7EMB3C5BKWDT5EZ5BRDSHMPQP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U7EMB3C5BKWDT5EZ5BRDSHMPQP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U7EMB3C5BKWDT5EZ5BRDSHMPQP/action/storage_attestation","attest_author":"https://pith.science/pith/U7EMB3C5BKWDT5EZ5BRDSHMPQP/action/author_attestation","sign_citation":"https://pith.science/pith/U7EMB3C5BKWDT5EZ5BRDSHMPQP/action/citation_signature","submit_replication":"https://pith.science/pith/U7EMB3C5BKWDT5EZ5BRDSHMPQP/action/replication_record"}},"created_at":"2026-05-17T23:55:34.948051+00:00","updated_at":"2026-05-17T23:55:34.948051+00:00"}