{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:JXBJ4SNXHCFELBXNPCSHQ33OIG","short_pith_number":"pith:JXBJ4SNX","schema_version":"1.0","canonical_sha256":"4dc29e49b7388a4586ed78a4786f6e4195a84cef916d2874ebc90c75f5f9c575","source":{"kind":"arxiv","id":"1907.04630","version":1},"attestation_state":"computed","paper":{"title":"Approximate Voronoi cells for lattices, revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.CR","cs.DM"],"primary_cat":"cs.DS","authors_text":"Thijs Laarhoven","submitted_at":"2019-07-10T11:38:38Z","abstract_excerpt":"We revisit the approximate Voronoi cells approach for solving the closest vector problem with preprocessing (CVPP) on high-dimensional lattices, and settle the open problem of Doulgerakis-Laarhoven-De Weger [PQCrypto, 2019] of determining exact asymptotics on the volume of these Voronoi cells under the Gaussian heuristic. As a result, we obtain improved upper bounds on the time complexity of the randomized iterative slicer when using less than $2^{0.076d + o(d)}$ memory, and we show how to obtain time-memory trade-offs even when using less than $2^{0.048d + o(d)}$ memory. We also settle the op"},"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":"1907.04630","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-10T11:38:38Z","cross_cats_sorted":["cs.CG","cs.CR","cs.DM"],"title_canon_sha256":"3799288d5e1b903c684c714c37678a45d128ef5d8a3de53b9f35b2f246b1f165","abstract_canon_sha256":"56d536f9aba509724178fb9aecc8939dd6d567904d0093e1bac8d2d1a2e49fb3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:57.319375Z","signature_b64":"VsKzxVugGyISrAuEmIdbgfxHFMuRWMgtaBbVCp8OxyXs2nMP6NkbMbNfHRyOE+Eud0odtlOA/MCRZxHcBcM1Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4dc29e49b7388a4586ed78a4786f6e4195a84cef916d2874ebc90c75f5f9c575","last_reissued_at":"2026-05-17T23:40:57.318741Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:57.318741Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate Voronoi cells for lattices, revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.CR","cs.DM"],"primary_cat":"cs.DS","authors_text":"Thijs Laarhoven","submitted_at":"2019-07-10T11:38:38Z","abstract_excerpt":"We revisit the approximate Voronoi cells approach for solving the closest vector problem with preprocessing (CVPP) on high-dimensional lattices, and settle the open problem of Doulgerakis-Laarhoven-De Weger [PQCrypto, 2019] of determining exact asymptotics on the volume of these Voronoi cells under the Gaussian heuristic. As a result, we obtain improved upper bounds on the time complexity of the randomized iterative slicer when using less than $2^{0.076d + o(d)}$ memory, and we show how to obtain time-memory trade-offs even when using less than $2^{0.048d + o(d)}$ memory. We also settle the op"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.04630","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":""},"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":"1907.04630","created_at":"2026-05-17T23:40:57.318837+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.04630v1","created_at":"2026-05-17T23:40:57.318837+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04630","created_at":"2026-05-17T23:40:57.318837+00:00"},{"alias_kind":"pith_short_12","alias_value":"JXBJ4SNXHCFE","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"JXBJ4SNXHCFELBXN","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"JXBJ4SNX","created_at":"2026-05-18T12:33:21.387695+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/JXBJ4SNXHCFELBXNPCSHQ33OIG","json":"https://pith.science/pith/JXBJ4SNXHCFELBXNPCSHQ33OIG.json","graph_json":"https://pith.science/api/pith-number/JXBJ4SNXHCFELBXNPCSHQ33OIG/graph.json","events_json":"https://pith.science/api/pith-number/JXBJ4SNXHCFELBXNPCSHQ33OIG/events.json","paper":"https://pith.science/paper/JXBJ4SNX"},"agent_actions":{"view_html":"https://pith.science/pith/JXBJ4SNXHCFELBXNPCSHQ33OIG","download_json":"https://pith.science/pith/JXBJ4SNXHCFELBXNPCSHQ33OIG.json","view_paper":"https://pith.science/paper/JXBJ4SNX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.04630&json=true","fetch_graph":"https://pith.science/api/pith-number/JXBJ4SNXHCFELBXNPCSHQ33OIG/graph.json","fetch_events":"https://pith.science/api/pith-number/JXBJ4SNXHCFELBXNPCSHQ33OIG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JXBJ4SNXHCFELBXNPCSHQ33OIG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JXBJ4SNXHCFELBXNPCSHQ33OIG/action/storage_attestation","attest_author":"https://pith.science/pith/JXBJ4SNXHCFELBXNPCSHQ33OIG/action/author_attestation","sign_citation":"https://pith.science/pith/JXBJ4SNXHCFELBXNPCSHQ33OIG/action/citation_signature","submit_replication":"https://pith.science/pith/JXBJ4SNXHCFELBXNPCSHQ33OIG/action/replication_record"}},"created_at":"2026-05-17T23:40:57.318837+00:00","updated_at":"2026-05-17T23:40:57.318837+00:00"}