{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:EAH4ZIWX7WGBREXW3DPMKOB7S2","short_pith_number":"pith:EAH4ZIWX","canonical_record":{"source":{"id":"1409.8063","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-29T10:40:28Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"6f9edc1fc29fd1d5b4b68c6825751e30a0d0672489c41282aae8fc6f8de33dbe","abstract_canon_sha256":"e9bc86a58f5e92cd1f9ea049a00cd220218f6242993d52041a91d954c4672f80"},"schema_version":"1.0"},"canonical_sha256":"200fcca2d7fd8c1892f6d8dec5383f96b2db911958ae8708f2b932da5ab86027","source":{"kind":"arxiv","id":"1409.8063","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.8063","created_at":"2026-05-17T23:55:34Z"},{"alias_kind":"arxiv_version","alias_value":"1409.8063v2","created_at":"2026-05-17T23:55:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.8063","created_at":"2026-05-17T23:55:34Z"},{"alias_kind":"pith_short_12","alias_value":"EAH4ZIWX7WGB","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"EAH4ZIWX7WGBREXW","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"EAH4ZIWX","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:EAH4ZIWX7WGBREXW3DPMKOB7S2","target":"record","payload":{"canonical_record":{"source":{"id":"1409.8063","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-29T10:40:28Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"6f9edc1fc29fd1d5b4b68c6825751e30a0d0672489c41282aae8fc6f8de33dbe","abstract_canon_sha256":"e9bc86a58f5e92cd1f9ea049a00cd220218f6242993d52041a91d954c4672f80"},"schema_version":"1.0"},"canonical_sha256":"200fcca2d7fd8c1892f6d8dec5383f96b2db911958ae8708f2b932da5ab86027","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:34.982284Z","signature_b64":"TRdGbjAGMYpU1Z09s0aNcri1aKNZRM1TG8egkmT66erM34KFiFDvNtKxW9pBaCilFxP+qujJCttJ6Ar2fIekCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"200fcca2d7fd8c1892f6d8dec5383f96b2db911958ae8708f2b932da5ab86027","last_reissued_at":"2026-05-17T23:55:34.981857Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:34.981857Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.8063","source_version":2,"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-17T23:55:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"psyhcatKmtaa9mmdQ/ey47GaL1h2lHxLsw6/HnBZ2uU0JCrNmyjUawDOCtxmMb7mIYT/dfpp33s7pH8SU61ICQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:27:02.755311Z"},"content_sha256":"915ffb0009e7f678e8a453be4897327cf024df1d9861e1ea1bf54105f66104ae","schema_version":"1.0","event_id":"sha256:915ffb0009e7f678e8a453be4897327cf024df1d9861e1ea1bf54105f66104ae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:EAH4ZIWX7WGBREXW3DPMKOB7S2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Closest Vector Problem with a Distance Guarantee","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Daniel Dadush, Noah Stephens-Davidowitz, Oded Regev","submitted_at":"2014-09-29T10:40:28Z","abstract_excerpt":"We present a substantially more efficient variant, both in terms of running time and size of preprocessing advice, of the algorithm by Liu, Lyubashevsky, and Micciancio for solving CVPP (the preprocessing version of the Closest Vector Problem, CVP) with a distance guarantee. For instance, for any $\\alpha < 1/2$, our algorithm finds the (unique) closest lattice point for any target point whose distance from the lattice is at most $\\alpha$ times the length of the shortest nonzero lattice vector, requires as preprocessing advice only $N \\approx \\widetilde{O}(n \\exp(\\alpha^2 n /(1-2\\alpha)^2))$ ve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.8063","kind":"arxiv","version":2},"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-17T23:55:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tTrYRSJVoIimi6acAzm6pK4654fkH1HA9o0vfPbtDLqzwGAjBScfjMtQGhXGE1hv7ti1XFitqxoc0odAiTYDCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:27:02.755878Z"},"content_sha256":"1cbb49d8adc4236107ff88cd3ac060bcb23e85c4ca562a88937db7a22969f208","schema_version":"1.0","event_id":"sha256:1cbb49d8adc4236107ff88cd3ac060bcb23e85c4ca562a88937db7a22969f208"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EAH4ZIWX7WGBREXW3DPMKOB7S2/bundle.json","state_url":"https://pith.science/pith/EAH4ZIWX7WGBREXW3DPMKOB7S2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EAH4ZIWX7WGBREXW3DPMKOB7S2/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-06-05T01:27:02Z","links":{"resolver":"https://pith.science/pith/EAH4ZIWX7WGBREXW3DPMKOB7S2","bundle":"https://pith.science/pith/EAH4ZIWX7WGBREXW3DPMKOB7S2/bundle.json","state":"https://pith.science/pith/EAH4ZIWX7WGBREXW3DPMKOB7S2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EAH4ZIWX7WGBREXW3DPMKOB7S2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:EAH4ZIWX7WGBREXW3DPMKOB7S2","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":"e9bc86a58f5e92cd1f9ea049a00cd220218f6242993d52041a91d954c4672f80","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-29T10:40:28Z","title_canon_sha256":"6f9edc1fc29fd1d5b4b68c6825751e30a0d0672489c41282aae8fc6f8de33dbe"},"schema_version":"1.0","source":{"id":"1409.8063","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.8063","created_at":"2026-05-17T23:55:34Z"},{"alias_kind":"arxiv_version","alias_value":"1409.8063v2","created_at":"2026-05-17T23:55:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.8063","created_at":"2026-05-17T23:55:34Z"},{"alias_kind":"pith_short_12","alias_value":"EAH4ZIWX7WGB","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"EAH4ZIWX7WGBREXW","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"EAH4ZIWX","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:1cbb49d8adc4236107ff88cd3ac060bcb23e85c4ca562a88937db7a22969f208","target":"graph","created_at":"2026-05-17T23:55:34Z","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":"We present a substantially more efficient variant, both in terms of running time and size of preprocessing advice, of the algorithm by Liu, Lyubashevsky, and Micciancio for solving CVPP (the preprocessing version of the Closest Vector Problem, CVP) with a distance guarantee. For instance, for any $\\alpha < 1/2$, our algorithm finds the (unique) closest lattice point for any target point whose distance from the lattice is at most $\\alpha$ times the length of the shortest nonzero lattice vector, requires as preprocessing advice only $N \\approx \\widetilde{O}(n \\exp(\\alpha^2 n /(1-2\\alpha)^2))$ ve","authors_text":"Daniel Dadush, Noah Stephens-Davidowitz, Oded Regev","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-29T10:40:28Z","title":"On the Closest Vector Problem with a Distance Guarantee"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.8063","kind":"arxiv","version":2},"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:915ffb0009e7f678e8a453be4897327cf024df1d9861e1ea1bf54105f66104ae","target":"record","created_at":"2026-05-17T23:55:34Z","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":"e9bc86a58f5e92cd1f9ea049a00cd220218f6242993d52041a91d954c4672f80","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-29T10:40:28Z","title_canon_sha256":"6f9edc1fc29fd1d5b4b68c6825751e30a0d0672489c41282aae8fc6f8de33dbe"},"schema_version":"1.0","source":{"id":"1409.8063","kind":"arxiv","version":2}},"canonical_sha256":"200fcca2d7fd8c1892f6d8dec5383f96b2db911958ae8708f2b932da5ab86027","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"200fcca2d7fd8c1892f6d8dec5383f96b2db911958ae8708f2b932da5ab86027","first_computed_at":"2026-05-17T23:55:34.981857Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:34.981857Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TRdGbjAGMYpU1Z09s0aNcri1aKNZRM1TG8egkmT66erM34KFiFDvNtKxW9pBaCilFxP+qujJCttJ6Ar2fIekCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:34.982284Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.8063","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:915ffb0009e7f678e8a453be4897327cf024df1d9861e1ea1bf54105f66104ae","sha256:1cbb49d8adc4236107ff88cd3ac060bcb23e85c4ca562a88937db7a22969f208"],"state_sha256":"bdb1b01c083620cccc8c83eb13a71258fdea7c3a53d38e313ce71d28d16a7305"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ow3SQu/fB/vJiqxh2+6Qq33DqBOrqknEN89XVbs+Wn2FB3NTW+cFlAvPuRSwrSZJevWmk2EL0E+tjEp59afZBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T01:27:02.758976Z","bundle_sha256":"5247b6f53f8fced4d3901becc27e66f9c2833f5e06c713830f9d60ad14ec8b4f"}}