{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:FNQX4P3PM2YI5IWST7OITUH2D5","short_pith_number":"pith:FNQX4P3P","canonical_record":{"source":{"id":"2002.07955","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-02-19T01:38:34Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"03ae0d6554c5548e32e9751d0117057181e777dab84da684444a4a745076342c","abstract_canon_sha256":"271a238581e9d5c4e1b12fcfbba18a49093093823ce21127ee03e2b89103cf39"},"schema_version":"1.0"},"canonical_sha256":"2b617e3f6f66b08ea2d29fdc89d0fa1f57b561253c7dd953262953e0fbea0d67","source":{"kind":"arxiv","id":"2002.07955","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.07955","created_at":"2026-07-05T11:54:37Z"},{"alias_kind":"arxiv_version","alias_value":"2002.07955v6","created_at":"2026-07-05T11:54:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.07955","created_at":"2026-07-05T11:54:37Z"},{"alias_kind":"pith_short_12","alias_value":"FNQX4P3PM2YI","created_at":"2026-07-05T11:54:37Z"},{"alias_kind":"pith_short_16","alias_value":"FNQX4P3PM2YI5IWS","created_at":"2026-07-05T11:54:37Z"},{"alias_kind":"pith_short_8","alias_value":"FNQX4P3P","created_at":"2026-07-05T11:54:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:FNQX4P3PM2YI5IWST7OITUH2D5","target":"record","payload":{"canonical_record":{"source":{"id":"2002.07955","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-02-19T01:38:34Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"03ae0d6554c5548e32e9751d0117057181e777dab84da684444a4a745076342c","abstract_canon_sha256":"271a238581e9d5c4e1b12fcfbba18a49093093823ce21127ee03e2b89103cf39"},"schema_version":"1.0"},"canonical_sha256":"2b617e3f6f66b08ea2d29fdc89d0fa1f57b561253c7dd953262953e0fbea0d67","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:54:37.052068Z","signature_b64":"6ir3JTTP2QG/giiHjSsuFxIhtwAFp5K4LuqjgMqXgVnc7TFfpAXVK+Rly1yl2ylPFEFfxe3SghK96UXfSs3xCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b617e3f6f66b08ea2d29fdc89d0fa1f57b561253c7dd953262953e0fbea0d67","last_reissued_at":"2026-07-05T11:54:37.051651Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:54:37.051651Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2002.07955","source_version":6,"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-07-05T11:54:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nzzZPsjKGt7R9kl7vkXLcu+KmOCgNWYuxET4EVZzhvbfEOPmvOafMepvX7OrjOMx+qyr+tvS0dDruGaNCCM6CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T11:59:05.444315Z"},"content_sha256":"936535036e3c59f7b409553298ffe698af7d97c118fb7894714826df2c073117","schema_version":"1.0","event_id":"sha256:936535036e3c59f7b409553298ffe698af7d97c118fb7894714826df2c073117"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:FNQX4P3PM2YI5IWST7OITUH2D5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Classical and Quantum Algorithms for the Shortest Vector Problem via Bounded Distance Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.DS","authors_text":"Divesh Aggarwal, Rajendra Kumar, Yanlin Chen, Yixin Shen","submitted_at":"2020-02-19T01:38:34Z","abstract_excerpt":"The most important computational problem on lattices is the Shortest Vector Problem (SVP). In this paper, we present new algorithms that improve the state-of-the-art for provable classical/quantum algorithms for SVP. We present the following results. $\\bullet$ A new algorithm for SVP that provides a smooth tradeoff between time complexity and memory requirement. For any positive integer $4\\leq q\\leq \\sqrt{n}$, our algorithm takes $q^{13n+o(n)}$ time and requires $poly(n)\\cdot q^{16n/q^2}$ memory. This tradeoff which ranges from enumeration ($q=\\sqrt{n}$) to sieving ($q$ constant), is a consequ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.07955","kind":"arxiv","version":6},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2002.07955/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T11:54:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6OjmIToZa/xpjafP1M40yvq8EM/b2j1szxzChhrITakCKtFAUxUVllXkcGarTwj1U/3uSImRQURel6SqxeZJAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T11:59:05.444691Z"},"content_sha256":"21df1cdf2dfafe53010dd6f2d856442a832329a7b1ef047ba593a7d79d77becb","schema_version":"1.0","event_id":"sha256:21df1cdf2dfafe53010dd6f2d856442a832329a7b1ef047ba593a7d79d77becb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FNQX4P3PM2YI5IWST7OITUH2D5/bundle.json","state_url":"https://pith.science/pith/FNQX4P3PM2YI5IWST7OITUH2D5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FNQX4P3PM2YI5IWST7OITUH2D5/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-08-13T11:59:05Z","links":{"resolver":"https://pith.science/pith/FNQX4P3PM2YI5IWST7OITUH2D5","bundle":"https://pith.science/pith/FNQX4P3PM2YI5IWST7OITUH2D5/bundle.json","state":"https://pith.science/pith/FNQX4P3PM2YI5IWST7OITUH2D5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FNQX4P3PM2YI5IWST7OITUH2D5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:FNQX4P3PM2YI5IWST7OITUH2D5","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":"271a238581e9d5c4e1b12fcfbba18a49093093823ce21127ee03e2b89103cf39","cross_cats_sorted":["cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-02-19T01:38:34Z","title_canon_sha256":"03ae0d6554c5548e32e9751d0117057181e777dab84da684444a4a745076342c"},"schema_version":"1.0","source":{"id":"2002.07955","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.07955","created_at":"2026-07-05T11:54:37Z"},{"alias_kind":"arxiv_version","alias_value":"2002.07955v6","created_at":"2026-07-05T11:54:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.07955","created_at":"2026-07-05T11:54:37Z"},{"alias_kind":"pith_short_12","alias_value":"FNQX4P3PM2YI","created_at":"2026-07-05T11:54:37Z"},{"alias_kind":"pith_short_16","alias_value":"FNQX4P3PM2YI5IWS","created_at":"2026-07-05T11:54:37Z"},{"alias_kind":"pith_short_8","alias_value":"FNQX4P3P","created_at":"2026-07-05T11:54:37Z"}],"graph_snapshots":[{"event_id":"sha256:21df1cdf2dfafe53010dd6f2d856442a832329a7b1ef047ba593a7d79d77becb","target":"graph","created_at":"2026-07-05T11:54:37Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2002.07955/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The most important computational problem on lattices is the Shortest Vector Problem (SVP). In this paper, we present new algorithms that improve the state-of-the-art for provable classical/quantum algorithms for SVP. We present the following results. $\\bullet$ A new algorithm for SVP that provides a smooth tradeoff between time complexity and memory requirement. For any positive integer $4\\leq q\\leq \\sqrt{n}$, our algorithm takes $q^{13n+o(n)}$ time and requires $poly(n)\\cdot q^{16n/q^2}$ memory. This tradeoff which ranges from enumeration ($q=\\sqrt{n}$) to sieving ($q$ constant), is a consequ","authors_text":"Divesh Aggarwal, Rajendra Kumar, Yanlin Chen, Yixin Shen","cross_cats":["cs.CR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-02-19T01:38:34Z","title":"Improved Classical and Quantum Algorithms for the Shortest Vector Problem via Bounded Distance Decoding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.07955","kind":"arxiv","version":6},"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:936535036e3c59f7b409553298ffe698af7d97c118fb7894714826df2c073117","target":"record","created_at":"2026-07-05T11:54:37Z","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":"271a238581e9d5c4e1b12fcfbba18a49093093823ce21127ee03e2b89103cf39","cross_cats_sorted":["cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-02-19T01:38:34Z","title_canon_sha256":"03ae0d6554c5548e32e9751d0117057181e777dab84da684444a4a745076342c"},"schema_version":"1.0","source":{"id":"2002.07955","kind":"arxiv","version":6}},"canonical_sha256":"2b617e3f6f66b08ea2d29fdc89d0fa1f57b561253c7dd953262953e0fbea0d67","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2b617e3f6f66b08ea2d29fdc89d0fa1f57b561253c7dd953262953e0fbea0d67","first_computed_at":"2026-07-05T11:54:37.051651Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:54:37.051651Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6ir3JTTP2QG/giiHjSsuFxIhtwAFp5K4LuqjgMqXgVnc7TFfpAXVK+Rly1yl2ylPFEFfxe3SghK96UXfSs3xCw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:54:37.052068Z","signed_message":"canonical_sha256_bytes"},"source_id":"2002.07955","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:936535036e3c59f7b409553298ffe698af7d97c118fb7894714826df2c073117","sha256:21df1cdf2dfafe53010dd6f2d856442a832329a7b1ef047ba593a7d79d77becb"],"state_sha256":"2b512d18d0f30cf415b77034a466a9d34a2a41080f83d291a80f1364f4f7d1d5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U2oo4ba+NBY0yTFzFf0FmnslysBJGhBfzWG5MFZ1TepBH+k8VYJwIR60UgoXd/inpAqtP0FBu5vWuh5vPLpoAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T11:59:05.447690Z","bundle_sha256":"a6f57bc215318808f0d4fc580464e58ce09b5a192d34c9c340abf73ec70ebda5"}}