{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:D4UPKODRPH6DGSPRC74RFKBMZU","short_pith_number":"pith:D4UPKODR","schema_version":"1.0","canonical_sha256":"1f28f5387179fc3349f117f912a82ccd2cf384d20752488d12ce55f4e9d9a956","source":{"kind":"arxiv","id":"1709.01535","version":1},"attestation_state":"computed","paper":{"title":"Just Take the Average! An Embarrassingly Simple $2^n$-Time Algorithm for SVP (and CVP)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Divesh Aggarwal, Noah Stephens-Davidowitz","submitted_at":"2017-09-05T18:06:21Z","abstract_excerpt":"We show a $2^{n+o(n)}$-time (and space) algorithm for the Shortest Vector Problem on lattices (SVP) that works by repeatedly running an embarrassingly simple \"pair and average\" sieving-like procedure on a list of lattice vectors. This matches the running time (and space) of the current fastest known algorithm, due to Aggarwal, Dadush, Regev, and Stephens-Davidowitz (ADRS, in STOC, 2015), with a far simpler algorithm. Our algorithm is in fact a modification of the ADRS algorithm, with a certain careful rejection sampling step removed.\n  The correctness of our algorithm follows from a more gener"},"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":"1709.01535","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-05T18:06:21Z","cross_cats_sorted":[],"title_canon_sha256":"67f9059b48b2b91ba0c2cc69f199b8bc8a9d370f9f6771b0e735b800b9db9eea","abstract_canon_sha256":"262122a37c54607baeb72234ceba7ff887d912e6ec62bef49cf637bdd94012e8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:34.677019Z","signature_b64":"Xc+2E4BXVidRXCBTNUlJZ5yKTBu8UqYPJVrssvquTa6qrS5r7FEgNpX8nXCBYVIaIzzgShiKZjwYkmfCafcDAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f28f5387179fc3349f117f912a82ccd2cf384d20752488d12ce55f4e9d9a956","last_reissued_at":"2026-05-17T23:55:34.676395Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:34.676395Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Just Take the Average! An Embarrassingly Simple $2^n$-Time Algorithm for SVP (and CVP)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Divesh Aggarwal, Noah Stephens-Davidowitz","submitted_at":"2017-09-05T18:06:21Z","abstract_excerpt":"We show a $2^{n+o(n)}$-time (and space) algorithm for the Shortest Vector Problem on lattices (SVP) that works by repeatedly running an embarrassingly simple \"pair and average\" sieving-like procedure on a list of lattice vectors. This matches the running time (and space) of the current fastest known algorithm, due to Aggarwal, Dadush, Regev, and Stephens-Davidowitz (ADRS, in STOC, 2015), with a far simpler algorithm. Our algorithm is in fact a modification of the ADRS algorithm, with a certain careful rejection sampling step removed.\n  The correctness of our algorithm follows from a more gener"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.01535","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1709.01535","created_at":"2026-05-17T23:55:34.676480+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.01535v1","created_at":"2026-05-17T23:55:34.676480+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.01535","created_at":"2026-05-17T23:55:34.676480+00:00"},{"alias_kind":"pith_short_12","alias_value":"D4UPKODRPH6D","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"D4UPKODRPH6DGSPR","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"D4UPKODR","created_at":"2026-05-18T12:31:10.602751+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/D4UPKODRPH6DGSPRC74RFKBMZU","json":"https://pith.science/pith/D4UPKODRPH6DGSPRC74RFKBMZU.json","graph_json":"https://pith.science/api/pith-number/D4UPKODRPH6DGSPRC74RFKBMZU/graph.json","events_json":"https://pith.science/api/pith-number/D4UPKODRPH6DGSPRC74RFKBMZU/events.json","paper":"https://pith.science/paper/D4UPKODR"},"agent_actions":{"view_html":"https://pith.science/pith/D4UPKODRPH6DGSPRC74RFKBMZU","download_json":"https://pith.science/pith/D4UPKODRPH6DGSPRC74RFKBMZU.json","view_paper":"https://pith.science/paper/D4UPKODR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.01535&json=true","fetch_graph":"https://pith.science/api/pith-number/D4UPKODRPH6DGSPRC74RFKBMZU/graph.json","fetch_events":"https://pith.science/api/pith-number/D4UPKODRPH6DGSPRC74RFKBMZU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D4UPKODRPH6DGSPRC74RFKBMZU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D4UPKODRPH6DGSPRC74RFKBMZU/action/storage_attestation","attest_author":"https://pith.science/pith/D4UPKODRPH6DGSPRC74RFKBMZU/action/author_attestation","sign_citation":"https://pith.science/pith/D4UPKODRPH6DGSPRC74RFKBMZU/action/citation_signature","submit_replication":"https://pith.science/pith/D4UPKODRPH6DGSPRC74RFKBMZU/action/replication_record"}},"created_at":"2026-05-17T23:55:34.676480+00:00","updated_at":"2026-05-17T23:55:34.676480+00:00"}