{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:W2ZK5YILGNVBB2S6BMMK4DCCY4","short_pith_number":"pith:W2ZK5YIL","schema_version":"1.0","canonical_sha256":"b6b2aee10b336a10ea5e0b18ae0c42c72a1d31a797b4bbd968651ff56d88794b","source":{"kind":"arxiv","id":"1811.08532","version":3},"attestation_state":"computed","paper":{"title":"On compact representations of Voronoi cells of lattices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Christoph Hunkenschr\\\"oder, Gina Reuland, Matthias Schymura","submitted_at":"2018-11-20T23:50:23Z","abstract_excerpt":"In a seminal work, Micciancio & Voulgaris (2013) described a deterministic single-exponential time algorithm for the Closest Vector Problem (CVP) on lattices. It is based on the computation of the Voronoi cell of the given lattice and thus may need exponential space as well. We address the major open question whether there exists such an algorithm that requires only polynomial space.\n  To this end, we define a lattice basis to be $c$-compact if every facet normal of the Voronoi cell is a linear combination of the basis vectors using coefficients that are bounded by $c$ in absolute value. Given"},"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":"1811.08532","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-20T23:50:23Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"02e2270e30ff06c28aed7336bf1fa374778716acac4a25c5aaf3a3eb5b7f4207","abstract_canon_sha256":"773c59ee44b128e998635d51081625b285471988a9f262dcdd1a0113d51e1879"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:29:59.577602Z","signature_b64":"sdbCAhMnDV+wkBVRyk5q52d796Jk/3xlwJvmggbB+0rhx5MvJKO6U3rC0Ou269g+iMVe7Ap6UZbFIFUBBim1CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6b2aee10b336a10ea5e0b18ae0c42c72a1d31a797b4bbd968651ff56d88794b","last_reissued_at":"2026-07-05T00:29:59.577158Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:29:59.577158Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On compact representations of Voronoi cells of lattices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Christoph Hunkenschr\\\"oder, Gina Reuland, Matthias Schymura","submitted_at":"2018-11-20T23:50:23Z","abstract_excerpt":"In a seminal work, Micciancio & Voulgaris (2013) described a deterministic single-exponential time algorithm for the Closest Vector Problem (CVP) on lattices. It is based on the computation of the Voronoi cell of the given lattice and thus may need exponential space as well. We address the major open question whether there exists such an algorithm that requires only polynomial space.\n  To this end, we define a lattice basis to be $c$-compact if every facet normal of the Voronoi cell is a linear combination of the basis vectors using coefficients that are bounded by $c$ in absolute value. Given"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.08532","kind":"arxiv","version":3},"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/1811.08532/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":"1811.08532","created_at":"2026-07-05T00:29:59.577217+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.08532v3","created_at":"2026-07-05T00:29:59.577217+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.08532","created_at":"2026-07-05T00:29:59.577217+00:00"},{"alias_kind":"pith_short_12","alias_value":"W2ZK5YILGNVB","created_at":"2026-07-05T00:29:59.577217+00:00"},{"alias_kind":"pith_short_16","alias_value":"W2ZK5YILGNVBB2S6","created_at":"2026-07-05T00:29:59.577217+00:00"},{"alias_kind":"pith_short_8","alias_value":"W2ZK5YIL","created_at":"2026-07-05T00:29:59.577217+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/W2ZK5YILGNVBB2S6BMMK4DCCY4","json":"https://pith.science/pith/W2ZK5YILGNVBB2S6BMMK4DCCY4.json","graph_json":"https://pith.science/api/pith-number/W2ZK5YILGNVBB2S6BMMK4DCCY4/graph.json","events_json":"https://pith.science/api/pith-number/W2ZK5YILGNVBB2S6BMMK4DCCY4/events.json","paper":"https://pith.science/paper/W2ZK5YIL"},"agent_actions":{"view_html":"https://pith.science/pith/W2ZK5YILGNVBB2S6BMMK4DCCY4","download_json":"https://pith.science/pith/W2ZK5YILGNVBB2S6BMMK4DCCY4.json","view_paper":"https://pith.science/paper/W2ZK5YIL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.08532&json=true","fetch_graph":"https://pith.science/api/pith-number/W2ZK5YILGNVBB2S6BMMK4DCCY4/graph.json","fetch_events":"https://pith.science/api/pith-number/W2ZK5YILGNVBB2S6BMMK4DCCY4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W2ZK5YILGNVBB2S6BMMK4DCCY4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W2ZK5YILGNVBB2S6BMMK4DCCY4/action/storage_attestation","attest_author":"https://pith.science/pith/W2ZK5YILGNVBB2S6BMMK4DCCY4/action/author_attestation","sign_citation":"https://pith.science/pith/W2ZK5YILGNVBB2S6BMMK4DCCY4/action/citation_signature","submit_replication":"https://pith.science/pith/W2ZK5YILGNVBB2S6BMMK4DCCY4/action/replication_record"}},"created_at":"2026-07-05T00:29:59.577217+00:00","updated_at":"2026-07-05T00:29:59.577217+00:00"}