{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:LLMON244FEGLVFAE2JD2IPGBM4","short_pith_number":"pith:LLMON244","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"},"canonical_sha256":"5ad8e6eb9c290cba9404d247a43cc16735a062c211f603f2556d8a3ced1a1316","source":{"kind":"arxiv","id":"1412.6168","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.6168","created_at":"2026-05-18T02:30:54Z"},{"alias_kind":"arxiv_version","alias_value":"1412.6168v1","created_at":"2026-05-18T02:30:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.6168","created_at":"2026-05-18T02:30:54Z"},{"alias_kind":"pith_short_12","alias_value":"LLMON244FEGL","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LLMON244FEGLVFAE","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LLMON244","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:LLMON244FEGLVFAE2JD2IPGBM4","target":"record","payload":{"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"},"canonical_sha256":"5ad8e6eb9c290cba9404d247a43cc16735a062c211f603f2556d8a3ced1a1316","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"},"source_kind":"arxiv","source_id":"1412.6168","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:30:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cGKPUpKDu3NMEN/Uh29sfUCWGAZFLr6YU/aIxEfiHYZXzySIBxsxv9yWdNIZjza0Qmx8YO0qWyH3Emcf7Oe8Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:29:00.509237Z"},"content_sha256":"c3411971331e012ece50714443715e1eb70706cace75edcd0ea44724b83a8d10","schema_version":"1.0","event_id":"sha256:c3411971331e012ece50714443715e1eb70706cace75edcd0ea44724b83a8d10"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:LLMON244FEGLVFAE2JD2IPGBM4","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:30:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wSkl9QiQfmQSZlUDuKrhJrcekTQrDtQz1NUnLQVFnwpOP6Py9h8e5fciPGpqoKthYGlxHDQz/wyA7fINxJpVCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:29:00.509890Z"},"content_sha256":"2662f4e5ce3ba91bc51734b99d4b99f0f8ac21fd5f1b664e612474b24e39ec68","schema_version":"1.0","event_id":"sha256:2662f4e5ce3ba91bc51734b99d4b99f0f8ac21fd5f1b664e612474b24e39ec68"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LLMON244FEGLVFAE2JD2IPGBM4/bundle.json","state_url":"https://pith.science/pith/LLMON244FEGLVFAE2JD2IPGBM4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LLMON244FEGLVFAE2JD2IPGBM4/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T02:29:00Z","links":{"resolver":"https://pith.science/pith/LLMON244FEGLVFAE2JD2IPGBM4","bundle":"https://pith.science/pith/LLMON244FEGLVFAE2JD2IPGBM4/bundle.json","state":"https://pith.science/pith/LLMON244FEGLVFAE2JD2IPGBM4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LLMON244FEGLVFAE2JD2IPGBM4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:LLMON244FEGLVFAE2JD2IPGBM4","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"0f621d59afb0c055c4f8eaff7b4868a3b85185593abf091ea7ce88bf6c03bb21","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-18T22:35:04Z","title_canon_sha256":"571d502ef9a3f110c128d9f414b6bdcba41db54a0600bcba5114f82b01e43a61"},"schema_version":"1.0","source":{"id":"1412.6168","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.6168","created_at":"2026-05-18T02:30:54Z"},{"alias_kind":"arxiv_version","alias_value":"1412.6168v1","created_at":"2026-05-18T02:30:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.6168","created_at":"2026-05-18T02:30:54Z"},{"alias_kind":"pith_short_12","alias_value":"LLMON244FEGL","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LLMON244FEGLVFAE","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LLMON244","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:2662f4e5ce3ba91bc51734b99d4b99f0f8ac21fd5f1b664e612474b24e39ec68","target":"graph","created_at":"2026-05-18T02:30:54Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Daniel Dadush, Nicolas Bonifas","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-18T22:35:04Z","title":"Short Paths on the Voronoi Graph and the Closest Vector Problem with Preprocessing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.6168","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c3411971331e012ece50714443715e1eb70706cace75edcd0ea44724b83a8d10","target":"record","created_at":"2026-05-18T02:30:54Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"0f621d59afb0c055c4f8eaff7b4868a3b85185593abf091ea7ce88bf6c03bb21","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-18T22:35:04Z","title_canon_sha256":"571d502ef9a3f110c128d9f414b6bdcba41db54a0600bcba5114f82b01e43a61"},"schema_version":"1.0","source":{"id":"1412.6168","kind":"arxiv","version":1}},"canonical_sha256":"5ad8e6eb9c290cba9404d247a43cc16735a062c211f603f2556d8a3ced1a1316","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5ad8e6eb9c290cba9404d247a43cc16735a062c211f603f2556d8a3ced1a1316","first_computed_at":"2026-05-18T02:30:54.199373Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:30:54.199373Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UHjh9oNxSNdIdOXpZnipiWixLzPqYUe6OnrmN5nOJi1FT5J9HIrA1nSTWyZdmv44khMj3f/y0UUjIVX4HyxPAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:30:54.200113Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.6168","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c3411971331e012ece50714443715e1eb70706cace75edcd0ea44724b83a8d10","sha256:2662f4e5ce3ba91bc51734b99d4b99f0f8ac21fd5f1b664e612474b24e39ec68"],"state_sha256":"abbb150905351fed4ccd4d4011396a4b66cc1cca75d854e12ee086facfabdeca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tnIvUMKMAMJGqXSlWApAl/170yjNdvbWkt8ePVZxHhg7uTI/Kd3z5Sff2n71T+pHoFL4M2Vy4L4dFzxoHmzGBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T02:29:00.513083Z","bundle_sha256":"a1ea2f511c20044b3d9cd10becf4a6972be94456c5f909d28f877dcc8ea23000"}}