{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:LLMON244FEGLVFAE2JD2IPGBM4","short_pith_number":"pith:LLMON244","schema_version":"1.0","canonical_sha256":"5ad8e6eb9c290cba9404d247a43cc16735a062c211f603f2556d8a3ced1a1316","source":{"kind":"arxiv","id":"1412.6168","version":1},"attestation_state":"computed","paper":{"title":"Short Paths on the Voronoi Graph and the Closest Vector Problem with Preprocessing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel Dadush, Nicolas Bonifas","submitted_at":"2014-12-18T22:35:04Z","abstract_excerpt":"Improving on the Voronoi cell based techniques of Micciancio and Voulgaris (SIAM J. Comp. 13), and Sommer, Feder and Shalvi (SIAM J. Disc. Math. 09), we give a Las Vegas $\\tilde{O}(2^n)$ expected time and space algorithm for CVPP (the preprocessing version of the Closest Vector Problem, CVP). This improves on the $\\tilde{O}(4^n)$ deterministic runtime of the Micciancio Voulgaris algorithm, henceforth MV, for CVPP (which also solves CVP) at the cost of a polynomial amount of randomness (which only affects runtime, not correctness). As in MV, our algorithm proceeds by computing a short path on t"},"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":"1412.6168","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-18T22:35:04Z","cross_cats_sorted":[],"title_canon_sha256":"571d502ef9a3f110c128d9f414b6bdcba41db54a0600bcba5114f82b01e43a61","abstract_canon_sha256":"0f621d59afb0c055c4f8eaff7b4868a3b85185593abf091ea7ce88bf6c03bb21"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:54.200113Z","signature_b64":"UHjh9oNxSNdIdOXpZnipiWixLzPqYUe6OnrmN5nOJi1FT5J9HIrA1nSTWyZdmv44khMj3f/y0UUjIVX4HyxPAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ad8e6eb9c290cba9404d247a43cc16735a062c211f603f2556d8a3ced1a1316","last_reissued_at":"2026-05-18T02:30:54.199373Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:54.199373Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Short Paths on the Voronoi Graph and the Closest Vector Problem with Preprocessing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel Dadush, Nicolas Bonifas","submitted_at":"2014-12-18T22:35:04Z","abstract_excerpt":"Improving on the Voronoi cell based techniques of Micciancio and Voulgaris (SIAM J. Comp. 13), and Sommer, Feder and Shalvi (SIAM J. Disc. Math. 09), we give a Las Vegas $\\tilde{O}(2^n)$ expected time and space algorithm for CVPP (the preprocessing version of the Closest Vector Problem, CVP). This improves on the $\\tilde{O}(4^n)$ deterministic runtime of the Micciancio Voulgaris algorithm, henceforth MV, for CVPP (which also solves CVP) at the cost of a polynomial amount of randomness (which only affects runtime, not correctness). As in MV, our algorithm proceeds by computing a short path on t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.6168","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":"1412.6168","created_at":"2026-05-18T02:30:54.199495+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.6168v1","created_at":"2026-05-18T02:30:54.199495+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.6168","created_at":"2026-05-18T02:30:54.199495+00:00"},{"alias_kind":"pith_short_12","alias_value":"LLMON244FEGL","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"LLMON244FEGLVFAE","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"LLMON244","created_at":"2026-05-18T12:28:38.356838+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/LLMON244FEGLVFAE2JD2IPGBM4","json":"https://pith.science/pith/LLMON244FEGLVFAE2JD2IPGBM4.json","graph_json":"https://pith.science/api/pith-number/LLMON244FEGLVFAE2JD2IPGBM4/graph.json","events_json":"https://pith.science/api/pith-number/LLMON244FEGLVFAE2JD2IPGBM4/events.json","paper":"https://pith.science/paper/LLMON244"},"agent_actions":{"view_html":"https://pith.science/pith/LLMON244FEGLVFAE2JD2IPGBM4","download_json":"https://pith.science/pith/LLMON244FEGLVFAE2JD2IPGBM4.json","view_paper":"https://pith.science/paper/LLMON244","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.6168&json=true","fetch_graph":"https://pith.science/api/pith-number/LLMON244FEGLVFAE2JD2IPGBM4/graph.json","fetch_events":"https://pith.science/api/pith-number/LLMON244FEGLVFAE2JD2IPGBM4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LLMON244FEGLVFAE2JD2IPGBM4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LLMON244FEGLVFAE2JD2IPGBM4/action/storage_attestation","attest_author":"https://pith.science/pith/LLMON244FEGLVFAE2JD2IPGBM4/action/author_attestation","sign_citation":"https://pith.science/pith/LLMON244FEGLVFAE2JD2IPGBM4/action/citation_signature","submit_replication":"https://pith.science/pith/LLMON244FEGLVFAE2JD2IPGBM4/action/replication_record"}},"created_at":"2026-05-18T02:30:54.199495+00:00","updated_at":"2026-05-18T02:30:54.199495+00:00"}