{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:FQ7Y5LJULLD72JTK7ZNKHWTHI7","short_pith_number":"pith:FQ7Y5LJU","canonical_record":{"source":{"id":"1212.6781","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-12-30T21:29:27Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"70a8bb74182a56ebfa04aa2784a4c3b0baf13631c54f182c296a469f6ae378e5","abstract_canon_sha256":"de665b1a087d1eaffe9397128ba1de95297c135ffcedd0497b08e61897648789"},"schema_version":"1.0"},"canonical_sha256":"2c3f8ead345ac7fd266afe5aa3da6747cef738e4a699d348d2cad814bb4a22ac","source":{"kind":"arxiv","id":"1212.6781","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.6781","created_at":"2026-05-18T03:37:30Z"},{"alias_kind":"arxiv_version","alias_value":"1212.6781v1","created_at":"2026-05-18T03:37:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.6781","created_at":"2026-05-18T03:37:30Z"},{"alias_kind":"pith_short_12","alias_value":"FQ7Y5LJULLD7","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"FQ7Y5LJULLD72JTK","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"FQ7Y5LJU","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:FQ7Y5LJULLD72JTK7ZNKHWTHI7","target":"record","payload":{"canonical_record":{"source":{"id":"1212.6781","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-12-30T21:29:27Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"70a8bb74182a56ebfa04aa2784a4c3b0baf13631c54f182c296a469f6ae378e5","abstract_canon_sha256":"de665b1a087d1eaffe9397128ba1de95297c135ffcedd0497b08e61897648789"},"schema_version":"1.0"},"canonical_sha256":"2c3f8ead345ac7fd266afe5aa3da6747cef738e4a699d348d2cad814bb4a22ac","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:37:30.954270Z","signature_b64":"gphd7ndWh9PUtU45m4PCRMS3vUdfq3fXVP5N4RNNlwOTiLTX4jQiPwT3c2SsN5tKOjvH7l+UH1yG/tadydnyAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c3f8ead345ac7fd266afe5aa3da6747cef738e4a699d348d2cad814bb4a22ac","last_reissued_at":"2026-05-18T03:37:30.953494Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:37:30.953494Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.6781","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-18T03:37:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vyhsg08/S6dcjlqyoP/3y5XRQRZCBUeHSww8XqbKes4K9FHEenyJXkLvjOR7jygzb5a6bRBTWhObCdwMSb4ZBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:18:40.450844Z"},"content_sha256":"4c2f73dc7afdd46f03d0b7babe5e4bf19b46fddf1910573a903506cd446d532e","schema_version":"1.0","event_id":"sha256:4c2f73dc7afdd46f03d0b7babe5e4bf19b46fddf1910573a903506cd446d532e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:FQ7Y5LJULLD72JTK7ZNKHWTHI7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lattice Sparsification and the Approximate Closest Vector Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Daniel Dadush, Gabor Kun","submitted_at":"2012-12-30T21:29:27Z","abstract_excerpt":"We give a deterministic algorithm for solving the (1+eps)-approximate Closest Vector Problem (CVP) on any n dimensional lattice and any norm in 2^{O(n)}(1+1/eps)^n time and 2^n poly(n) space. Our algorithm builds on the lattice point enumeration techniques of Micciancio and Voulgaris (STOC 2010) and Dadush, Peikert and Vempala (FOCS 2011), and gives an elegant, deterministic alternative to the \"AKS Sieve\" based algorithms for (1+eps)-CVP (Ajtai, Kumar, and Sivakumar; STOC 2001 and CCC 2002). Furthermore, assuming the existence of a poly(n)-space and 2^{O(n)} time algorithm for exact CVP in the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.6781","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-18T03:37:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CaktFYW3i/MTdyQ96gdbp7wo8CQuCVPZj/SBX1OwoKaUWa8HLcnTctGcdV5Fz09n8E8mbNwqH2sGm0yORbIXAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:18:40.451610Z"},"content_sha256":"b15bba96427a82de60b5f7f1212cedd4a842b07b89902009cd1bdc1df90cbb23","schema_version":"1.0","event_id":"sha256:b15bba96427a82de60b5f7f1212cedd4a842b07b89902009cd1bdc1df90cbb23"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FQ7Y5LJULLD72JTK7ZNKHWTHI7/bundle.json","state_url":"https://pith.science/pith/FQ7Y5LJULLD72JTK7ZNKHWTHI7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FQ7Y5LJULLD72JTK7ZNKHWTHI7/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-27T10:18:40Z","links":{"resolver":"https://pith.science/pith/FQ7Y5LJULLD72JTK7ZNKHWTHI7","bundle":"https://pith.science/pith/FQ7Y5LJULLD72JTK7ZNKHWTHI7/bundle.json","state":"https://pith.science/pith/FQ7Y5LJULLD72JTK7ZNKHWTHI7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FQ7Y5LJULLD72JTK7ZNKHWTHI7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:FQ7Y5LJULLD72JTK7ZNKHWTHI7","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":"de665b1a087d1eaffe9397128ba1de95297c135ffcedd0497b08e61897648789","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-12-30T21:29:27Z","title_canon_sha256":"70a8bb74182a56ebfa04aa2784a4c3b0baf13631c54f182c296a469f6ae378e5"},"schema_version":"1.0","source":{"id":"1212.6781","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.6781","created_at":"2026-05-18T03:37:30Z"},{"alias_kind":"arxiv_version","alias_value":"1212.6781v1","created_at":"2026-05-18T03:37:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.6781","created_at":"2026-05-18T03:37:30Z"},{"alias_kind":"pith_short_12","alias_value":"FQ7Y5LJULLD7","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"FQ7Y5LJULLD72JTK","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"FQ7Y5LJU","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:b15bba96427a82de60b5f7f1212cedd4a842b07b89902009cd1bdc1df90cbb23","target":"graph","created_at":"2026-05-18T03:37:30Z","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 give a deterministic algorithm for solving the (1+eps)-approximate Closest Vector Problem (CVP) on any n dimensional lattice and any norm in 2^{O(n)}(1+1/eps)^n time and 2^n poly(n) space. Our algorithm builds on the lattice point enumeration techniques of Micciancio and Voulgaris (STOC 2010) and Dadush, Peikert and Vempala (FOCS 2011), and gives an elegant, deterministic alternative to the \"AKS Sieve\" based algorithms for (1+eps)-CVP (Ajtai, Kumar, and Sivakumar; STOC 2001 and CCC 2002). Furthermore, assuming the existence of a poly(n)-space and 2^{O(n)} time algorithm for exact CVP in the","authors_text":"Daniel Dadush, Gabor Kun","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-12-30T21:29:27Z","title":"Lattice Sparsification and the Approximate Closest Vector Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.6781","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:4c2f73dc7afdd46f03d0b7babe5e4bf19b46fddf1910573a903506cd446d532e","target":"record","created_at":"2026-05-18T03:37:30Z","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":"de665b1a087d1eaffe9397128ba1de95297c135ffcedd0497b08e61897648789","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-12-30T21:29:27Z","title_canon_sha256":"70a8bb74182a56ebfa04aa2784a4c3b0baf13631c54f182c296a469f6ae378e5"},"schema_version":"1.0","source":{"id":"1212.6781","kind":"arxiv","version":1}},"canonical_sha256":"2c3f8ead345ac7fd266afe5aa3da6747cef738e4a699d348d2cad814bb4a22ac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2c3f8ead345ac7fd266afe5aa3da6747cef738e4a699d348d2cad814bb4a22ac","first_computed_at":"2026-05-18T03:37:30.953494Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:37:30.953494Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gphd7ndWh9PUtU45m4PCRMS3vUdfq3fXVP5N4RNNlwOTiLTX4jQiPwT3c2SsN5tKOjvH7l+UH1yG/tadydnyAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:37:30.954270Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.6781","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4c2f73dc7afdd46f03d0b7babe5e4bf19b46fddf1910573a903506cd446d532e","sha256:b15bba96427a82de60b5f7f1212cedd4a842b07b89902009cd1bdc1df90cbb23"],"state_sha256":"b62cdbb88589a06cddc0e26b3482bc52205aad83853fccf519cec5ae1641a616"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+nuS4ycPyGWwJJd4Yc4Ox/F0p0+Pmqj/x0j7RSjByr6GZFLu/6sswlBZ1lqJLgkkM4BsX0uWM1VXaYE6H7yNBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T10:18:40.455258Z","bundle_sha256":"c01cf1d20f64bd2c6b1f4a85e7aa8ee86097933ea4e7bc4be873fe2dd54607a4"}}