{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:FU44FKGCVLWGMCXRVZEK55TZV4","short_pith_number":"pith:FU44FKGC","canonical_record":{"source":{"id":"1107.5478","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-07-27T14:05:55Z","cross_cats_sorted":["math.FA"],"title_canon_sha256":"ef6a5724ff5f86acb6159ea7716d78d414ef1dcefaa83e3010bf56b2db852446","abstract_canon_sha256":"39275e7c022fa33ac0e54c2bd738e9cc32508eb7f5c8c8cdd058a3c9fbbdd26e"},"schema_version":"1.0"},"canonical_sha256":"2d39c2a8c2aaec660af1ae48aef679af3075384726b6ccd5bfc14cb9784c5f92","source":{"kind":"arxiv","id":"1107.5478","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.5478","created_at":"2026-05-18T04:16:43Z"},{"alias_kind":"arxiv_version","alias_value":"1107.5478v1","created_at":"2026-05-18T04:16:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.5478","created_at":"2026-05-18T04:16:43Z"},{"alias_kind":"pith_short_12","alias_value":"FU44FKGCVLWG","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"FU44FKGCVLWGMCXR","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"FU44FKGC","created_at":"2026-05-18T12:26:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:FU44FKGCVLWGMCXRVZEK55TZV4","target":"record","payload":{"canonical_record":{"source":{"id":"1107.5478","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-07-27T14:05:55Z","cross_cats_sorted":["math.FA"],"title_canon_sha256":"ef6a5724ff5f86acb6159ea7716d78d414ef1dcefaa83e3010bf56b2db852446","abstract_canon_sha256":"39275e7c022fa33ac0e54c2bd738e9cc32508eb7f5c8c8cdd058a3c9fbbdd26e"},"schema_version":"1.0"},"canonical_sha256":"2d39c2a8c2aaec660af1ae48aef679af3075384726b6ccd5bfc14cb9784c5f92","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:16:43.093455Z","signature_b64":"bkBoDLnz9aM71viu/cKtDjmmsihTvIOJJWcCY0FJHK02xtCjJVkD0wy+BSv28l8TV83+1ZlnWRgJkL1W7PhtDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d39c2a8c2aaec660af1ae48aef679af3075384726b6ccd5bfc14cb9784c5f92","last_reissued_at":"2026-05-18T04:16:43.092915Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:16:43.092915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.5478","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-18T04:16:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2Yn00nnFyyaVf8tS55Ile+NxwNNlu7tgeXTMtCiMgMBdsf+n+F8v396pb/FqQSjkM9PJxPwpY+HeA+8MAvLBBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:20:50.732409Z"},"content_sha256":"f04bab42a79e850f4a5aaae614129a2a0d8a677088a97a5ed1e7485acca5f0eb","schema_version":"1.0","event_id":"sha256:f04bab42a79e850f4a5aaae614129a2a0d8a677088a97a5ed1e7485acca5f0eb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:FU44FKGCVLWGMCXRVZEK55TZV4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deterministic Construction of an Approximate M-Ellipsoid and its Application to Derandomizing Lattice Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.FA"],"primary_cat":"cs.CC","authors_text":"Daniel Dadush, Santosh Vempala","submitted_at":"2011-07-27T14:05:55Z","abstract_excerpt":"We give a deterministic O(log n)^n algorithm for the {\\em Shortest Vector Problem (SVP)} of a lattice under {\\em any} norm, improving on the previous best deterministic bound of n^O(n) for general norms and nearly matching the bound of 2^O(n) for the standard Euclidean norm established by Micciancio and Voulgaris (STOC 2010). Our algorithm can be viewed as a derandomization of the AKS randomized sieve algorithm, which can be used to solve SVP for any norm in 2^O(n) time with high probability. We use the technique of covering a convex body by ellipsoids, as introduced for lattice problems in (D"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.5478","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-18T04:16:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iRlPiwda4oZfoG2QILHnZwRI+ccaMDIQW6H7M/8ZUzzcQ0InQOJbi+30qPttVWywXVjz0B48p70UT/GaCG26CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:20:50.733077Z"},"content_sha256":"2456f66a2c4472116a7a6078ef98b74f3475f4efbff06c3b77b01d045f5a820e","schema_version":"1.0","event_id":"sha256:2456f66a2c4472116a7a6078ef98b74f3475f4efbff06c3b77b01d045f5a820e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FU44FKGCVLWGMCXRVZEK55TZV4/bundle.json","state_url":"https://pith.science/pith/FU44FKGCVLWGMCXRVZEK55TZV4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FU44FKGCVLWGMCXRVZEK55TZV4/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-27T11:20:50Z","links":{"resolver":"https://pith.science/pith/FU44FKGCVLWGMCXRVZEK55TZV4","bundle":"https://pith.science/pith/FU44FKGCVLWGMCXRVZEK55TZV4/bundle.json","state":"https://pith.science/pith/FU44FKGCVLWGMCXRVZEK55TZV4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FU44FKGCVLWGMCXRVZEK55TZV4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:FU44FKGCVLWGMCXRVZEK55TZV4","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":"39275e7c022fa33ac0e54c2bd738e9cc32508eb7f5c8c8cdd058a3c9fbbdd26e","cross_cats_sorted":["math.FA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-07-27T14:05:55Z","title_canon_sha256":"ef6a5724ff5f86acb6159ea7716d78d414ef1dcefaa83e3010bf56b2db852446"},"schema_version":"1.0","source":{"id":"1107.5478","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.5478","created_at":"2026-05-18T04:16:43Z"},{"alias_kind":"arxiv_version","alias_value":"1107.5478v1","created_at":"2026-05-18T04:16:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.5478","created_at":"2026-05-18T04:16:43Z"},{"alias_kind":"pith_short_12","alias_value":"FU44FKGCVLWG","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"FU44FKGCVLWGMCXR","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"FU44FKGC","created_at":"2026-05-18T12:26:28Z"}],"graph_snapshots":[{"event_id":"sha256:2456f66a2c4472116a7a6078ef98b74f3475f4efbff06c3b77b01d045f5a820e","target":"graph","created_at":"2026-05-18T04:16:43Z","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 O(log n)^n algorithm for the {\\em Shortest Vector Problem (SVP)} of a lattice under {\\em any} norm, improving on the previous best deterministic bound of n^O(n) for general norms and nearly matching the bound of 2^O(n) for the standard Euclidean norm established by Micciancio and Voulgaris (STOC 2010). Our algorithm can be viewed as a derandomization of the AKS randomized sieve algorithm, which can be used to solve SVP for any norm in 2^O(n) time with high probability. We use the technique of covering a convex body by ellipsoids, as introduced for lattice problems in (D","authors_text":"Daniel Dadush, Santosh Vempala","cross_cats":["math.FA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-07-27T14:05:55Z","title":"Deterministic Construction of an Approximate M-Ellipsoid and its Application to Derandomizing Lattice Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.5478","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:f04bab42a79e850f4a5aaae614129a2a0d8a677088a97a5ed1e7485acca5f0eb","target":"record","created_at":"2026-05-18T04:16:43Z","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":"39275e7c022fa33ac0e54c2bd738e9cc32508eb7f5c8c8cdd058a3c9fbbdd26e","cross_cats_sorted":["math.FA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-07-27T14:05:55Z","title_canon_sha256":"ef6a5724ff5f86acb6159ea7716d78d414ef1dcefaa83e3010bf56b2db852446"},"schema_version":"1.0","source":{"id":"1107.5478","kind":"arxiv","version":1}},"canonical_sha256":"2d39c2a8c2aaec660af1ae48aef679af3075384726b6ccd5bfc14cb9784c5f92","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2d39c2a8c2aaec660af1ae48aef679af3075384726b6ccd5bfc14cb9784c5f92","first_computed_at":"2026-05-18T04:16:43.092915Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:16:43.092915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bkBoDLnz9aM71viu/cKtDjmmsihTvIOJJWcCY0FJHK02xtCjJVkD0wy+BSv28l8TV83+1ZlnWRgJkL1W7PhtDA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:16:43.093455Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.5478","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f04bab42a79e850f4a5aaae614129a2a0d8a677088a97a5ed1e7485acca5f0eb","sha256:2456f66a2c4472116a7a6078ef98b74f3475f4efbff06c3b77b01d045f5a820e"],"state_sha256":"0ab8972d925d8897c15377edcb77637d0a2575e94e4e939b0914890452ca3675"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FXDH9bttnRnlfyMrCUi+Kfzt9TRqEds+vIbmG5f0QP/dJIBzoSRcqKcharfxTO9r+AqOhMz3t6EUg28j0U6LDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T11:20:50.736498Z","bundle_sha256":"0fc02a954f152a5beb565e56f42a677235e6eb0385a0122af9a98f8a3182af9d"}}