{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:ZCWOIHFJF5F2HFYFIKWYFB643G","short_pith_number":"pith:ZCWOIHFJ","schema_version":"1.0","canonical_sha256":"c8ace41ca92f4ba3970542ad8287dcd9b393a59d9ea8a4e735f0a020297533bf","source":{"kind":"arxiv","id":"2608.03220","version":1},"attestation_state":"computed","paper":{"title":"One Discrete Gaussian Sample in $2^{n/2+o(n)}$ Time","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jiseung Kim","submitted_at":"2026-08-04T06:53:28Z","abstract_excerpt":"Aggarwal, Dadush, Regev, and Stephens-Davidowitz (ADRS; STOC 2015) sample $2^{n/2}$ discrete Gaussians at an arbitrary parameter in $2^{n+o(n)}$ time, and above smoothing in $2^{n/2+o(n)}$ time. They ask whether the latter bound suffices for one sample at an arbitrary parameter. We answer this question affirmatively: for every rank-$n$ lattice $L\\subseteq\\R^n$ specified by a rational basis and every rational $s^2>0$, we produce one sample from $D_{L,s}$ within statistical distance $\\exp(-\\Omega(n^3))$ in expected $2^{n/2+o(n)}$ time and $2^{n/2+o(n)}$ space on every execution. The algorithm sa"},"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":"2608.03220","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-08-04T06:53:28Z","cross_cats_sorted":[],"title_canon_sha256":"a3a34368aad0e9ea145d1d555b79e87e91a42345d7dedd5d35065f181af2af7f","abstract_canon_sha256":"b8a3d12d4e4f064d1159324ec3a6da7752b94b1955adba4b2d5b032edfbbc6de"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-05T00:46:18.673298Z","signature_b64":"9ccpGFd3XjJWxY73MkwMtJ/pyAtViokH/iDS9KaKzcziDelDKASZFWHJm2g5Ik2X6jdOLwvwCbfrbm7dYynqCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8ace41ca92f4ba3970542ad8287dcd9b393a59d9ea8a4e735f0a020297533bf","last_reissued_at":"2026-08-05T00:46:18.670500Z","signature_status":"signed_v1","first_computed_at":"2026-08-05T00:46:18.670500Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"One Discrete Gaussian Sample in $2^{n/2+o(n)}$ Time","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jiseung Kim","submitted_at":"2026-08-04T06:53:28Z","abstract_excerpt":"Aggarwal, Dadush, Regev, and Stephens-Davidowitz (ADRS; STOC 2015) sample $2^{n/2}$ discrete Gaussians at an arbitrary parameter in $2^{n+o(n)}$ time, and above smoothing in $2^{n/2+o(n)}$ time. They ask whether the latter bound suffices for one sample at an arbitrary parameter. We answer this question affirmatively: for every rank-$n$ lattice $L\\subseteq\\R^n$ specified by a rational basis and every rational $s^2>0$, we produce one sample from $D_{L,s}$ within statistical distance $\\exp(-\\Omega(n^3))$ in expected $2^{n/2+o(n)}$ time and $2^{n/2+o(n)}$ space on every execution. The algorithm sa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.03220","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2608.03220/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2608.03220","created_at":"2026-08-05T00:46:18.671789+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.03220v1","created_at":"2026-08-05T00:46:18.671789+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.03220","created_at":"2026-08-05T00:46:18.671789+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZCWOIHFJF5F2","created_at":"2026-08-05T00:46:18.671789+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZCWOIHFJF5F2HFYF","created_at":"2026-08-05T00:46:18.671789+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZCWOIHFJ","created_at":"2026-08-05T00:46:18.671789+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/ZCWOIHFJF5F2HFYFIKWYFB643G","json":"https://pith.science/pith/ZCWOIHFJF5F2HFYFIKWYFB643G.json","graph_json":"https://pith.science/api/pith-number/ZCWOIHFJF5F2HFYFIKWYFB643G/graph.json","events_json":"https://pith.science/api/pith-number/ZCWOIHFJF5F2HFYFIKWYFB643G/events.json","paper":"https://pith.science/paper/ZCWOIHFJ"},"agent_actions":{"view_html":"https://pith.science/pith/ZCWOIHFJF5F2HFYFIKWYFB643G","download_json":"https://pith.science/pith/ZCWOIHFJF5F2HFYFIKWYFB643G.json","view_paper":"https://pith.science/paper/ZCWOIHFJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.03220&json=true","fetch_graph":"https://pith.science/api/pith-number/ZCWOIHFJF5F2HFYFIKWYFB643G/graph.json","fetch_events":"https://pith.science/api/pith-number/ZCWOIHFJF5F2HFYFIKWYFB643G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZCWOIHFJF5F2HFYFIKWYFB643G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZCWOIHFJF5F2HFYFIKWYFB643G/action/storage_attestation","attest_author":"https://pith.science/pith/ZCWOIHFJF5F2HFYFIKWYFB643G/action/author_attestation","sign_citation":"https://pith.science/pith/ZCWOIHFJF5F2HFYFIKWYFB643G/action/citation_signature","submit_replication":"https://pith.science/pith/ZCWOIHFJF5F2HFYFIKWYFB643G/action/replication_record"}},"created_at":"2026-08-05T00:46:18.671789+00:00","updated_at":"2026-08-05T00:46:18.671789+00:00"}