{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:M3LVPLK4L3IOMB7UVGCXLIN4NQ","short_pith_number":"pith:M3LVPLK4","schema_version":"1.0","canonical_sha256":"66d757ad5c5ed0e607f4a98575a1bc6c2f8574abe7a138a663f0482fff26e5ea","source":{"kind":"arxiv","id":"1908.03724","version":1},"attestation_state":"computed","paper":{"title":"Slide Reduction, Revisited---Filling the Gaps in SVP Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.DS","authors_text":"Divesh Aggarwal, Jianwei Li, Noah Stephens-Davidowitz, Phong Q. Nguyen","submitted_at":"2019-08-10T10:43:45Z","abstract_excerpt":"We show how to generalize Gama and Nguyen's slide reduction algorithm [STOC '08] for solving the approximate Shortest Vector Problem over lattices (SVP). As a result, we show the fastest provably correct algorithm for $\\delta$-approximate SVP for all approximation factors $n^{1/2+\\varepsilon} \\leq \\delta \\leq n^{O(1)}$. This is the range of approximation factors most relevant for cryptography."},"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":"1908.03724","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-10T10:43:45Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"e276f7034bd29d0975e38e36ef1626b381772047bc05d2ba5b1e6776cc28def3","abstract_canon_sha256":"572f3900222489e0ca6fa20ae29cc6e3390511ba0abb97c7d1dd0f11442d5f4f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:53:17.768225Z","signature_b64":"cCQma9ocaKU169AkKTZnf45VJpWWAi71nVTsZdddDFgyuEBuK0BEZvqovAIL5ANgPxmucjM+L2eS+rVpuGEoBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66d757ad5c5ed0e607f4a98575a1bc6c2f8574abe7a138a663f0482fff26e5ea","last_reissued_at":"2026-07-04T23:53:17.767821Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:53:17.767821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Slide Reduction, Revisited---Filling the Gaps in SVP Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.DS","authors_text":"Divesh Aggarwal, Jianwei Li, Noah Stephens-Davidowitz, Phong Q. Nguyen","submitted_at":"2019-08-10T10:43:45Z","abstract_excerpt":"We show how to generalize Gama and Nguyen's slide reduction algorithm [STOC '08] for solving the approximate Shortest Vector Problem over lattices (SVP). As a result, we show the fastest provably correct algorithm for $\\delta$-approximate SVP for all approximation factors $n^{1/2+\\varepsilon} \\leq \\delta \\leq n^{O(1)}$. This is the range of approximation factors most relevant for cryptography."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.03724","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.03724/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":"1908.03724","created_at":"2026-07-04T23:53:17.767879+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.03724v1","created_at":"2026-07-04T23:53:17.767879+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.03724","created_at":"2026-07-04T23:53:17.767879+00:00"},{"alias_kind":"pith_short_12","alias_value":"M3LVPLK4L3IO","created_at":"2026-07-04T23:53:17.767879+00:00"},{"alias_kind":"pith_short_16","alias_value":"M3LVPLK4L3IOMB7U","created_at":"2026-07-04T23:53:17.767879+00:00"},{"alias_kind":"pith_short_8","alias_value":"M3LVPLK4","created_at":"2026-07-04T23:53:17.767879+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/M3LVPLK4L3IOMB7UVGCXLIN4NQ","json":"https://pith.science/pith/M3LVPLK4L3IOMB7UVGCXLIN4NQ.json","graph_json":"https://pith.science/api/pith-number/M3LVPLK4L3IOMB7UVGCXLIN4NQ/graph.json","events_json":"https://pith.science/api/pith-number/M3LVPLK4L3IOMB7UVGCXLIN4NQ/events.json","paper":"https://pith.science/paper/M3LVPLK4"},"agent_actions":{"view_html":"https://pith.science/pith/M3LVPLK4L3IOMB7UVGCXLIN4NQ","download_json":"https://pith.science/pith/M3LVPLK4L3IOMB7UVGCXLIN4NQ.json","view_paper":"https://pith.science/paper/M3LVPLK4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.03724&json=true","fetch_graph":"https://pith.science/api/pith-number/M3LVPLK4L3IOMB7UVGCXLIN4NQ/graph.json","fetch_events":"https://pith.science/api/pith-number/M3LVPLK4L3IOMB7UVGCXLIN4NQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M3LVPLK4L3IOMB7UVGCXLIN4NQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M3LVPLK4L3IOMB7UVGCXLIN4NQ/action/storage_attestation","attest_author":"https://pith.science/pith/M3LVPLK4L3IOMB7UVGCXLIN4NQ/action/author_attestation","sign_citation":"https://pith.science/pith/M3LVPLK4L3IOMB7UVGCXLIN4NQ/action/citation_signature","submit_replication":"https://pith.science/pith/M3LVPLK4L3IOMB7UVGCXLIN4NQ/action/replication_record"}},"created_at":"2026-07-04T23:53:17.767879+00:00","updated_at":"2026-07-04T23:53:17.767879+00:00"}