{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:FNQX4P3PM2YI5IWST7OITUH2D5","short_pith_number":"pith:FNQX4P3P","schema_version":"1.0","canonical_sha256":"2b617e3f6f66b08ea2d29fdc89d0fa1f57b561253c7dd953262953e0fbea0d67","source":{"kind":"arxiv","id":"2002.07955","version":6},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2002.07955","created_at":"2026-07-05T11:54:37.051705+00:00"},{"alias_kind":"arxiv_version","alias_value":"2002.07955v6","created_at":"2026-07-05T11:54:37.051705+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.07955","created_at":"2026-07-05T11:54:37.051705+00:00"},{"alias_kind":"pith_short_12","alias_value":"FNQX4P3PM2YI","created_at":"2026-07-05T11:54:37.051705+00:00"},{"alias_kind":"pith_short_16","alias_value":"FNQX4P3PM2YI5IWS","created_at":"2026-07-05T11:54:37.051705+00:00"},{"alias_kind":"pith_short_8","alias_value":"FNQX4P3P","created_at":"2026-07-05T11:54:37.051705+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2410.13759","citing_title":"On the practicality of quantum sieving algorithms for the shortest vector problem","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FNQX4P3PM2YI5IWST7OITUH2D5","json":"https://pith.science/pith/FNQX4P3PM2YI5IWST7OITUH2D5.json","graph_json":"https://pith.science/api/pith-number/FNQX4P3PM2YI5IWST7OITUH2D5/graph.json","events_json":"https://pith.science/api/pith-number/FNQX4P3PM2YI5IWST7OITUH2D5/events.json","paper":"https://pith.science/paper/FNQX4P3P"},"agent_actions":{"view_html":"https://pith.science/pith/FNQX4P3PM2YI5IWST7OITUH2D5","download_json":"https://pith.science/pith/FNQX4P3PM2YI5IWST7OITUH2D5.json","view_paper":"https://pith.science/paper/FNQX4P3P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2002.07955&json=true","fetch_graph":"https://pith.science/api/pith-number/FNQX4P3PM2YI5IWST7OITUH2D5/graph.json","fetch_events":"https://pith.science/api/pith-number/FNQX4P3PM2YI5IWST7OITUH2D5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FNQX4P3PM2YI5IWST7OITUH2D5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FNQX4P3PM2YI5IWST7OITUH2D5/action/storage_attestation","attest_author":"https://pith.science/pith/FNQX4P3PM2YI5IWST7OITUH2D5/action/author_attestation","sign_citation":"https://pith.science/pith/FNQX4P3PM2YI5IWST7OITUH2D5/action/citation_signature","submit_replication":"https://pith.science/pith/FNQX4P3PM2YI5IWST7OITUH2D5/action/replication_record"}},"created_at":"2026-07-05T11:54:37.051705+00:00","updated_at":"2026-07-05T11:54:37.051705+00:00"}