{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:XTYU22AZTFQC5M3YAFSEXAKLT7","short_pith_number":"pith:XTYU22AZ","schema_version":"1.0","canonical_sha256":"bcf14d681999602eb37801644b814b9ff0cb21b0193cbe0617a49ce0ebb6e813","source":{"kind":"arxiv","id":"2603.27398","version":2},"attestation_state":"computed","paper":{"title":"NP-hardness of SVP in Euclidean Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.NT","authors_text":"Daqing Wan","submitted_at":"2026-03-28T20:33:18Z","abstract_excerpt":"van Emde Boas (1981) conjectured that computing a shortest non-zero vector of a lattice in an Euclidean space is NP-hard. In this paper, we prove that this conjecture is true and hence de-randomize the classical randomness result of Ajtai (1998). We follow the locally dense lattice de-randomizion program as formulated and systematically studied by Micciancio (1998-2014). Our proof builds on the construction of Bennett-Peikert (2023) on locally dense lattices via Reed-Solomon codes, and depends crucially on the work of Deligne on the Weil conjectures for higher dimensional varieties over finite"},"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":"2603.27398","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2026-03-28T20:33:18Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"1d5d6216d5ac9fa7987353756878421612330a21625ba2f9738d165aacf5d7ea","abstract_canon_sha256":"c2d015e6b7da12f2d79363f7956fab1e2bd7036b225ef1efbddba3ce447331f2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-16T01:22:38.877559Z","signature_b64":"7b6fbCtxe8JeKlfgGY9lMua2mYCo/iEvShpt4fqjXydySNos3yoL7mCh85nq1AV6cGPC6hyA2aqQmipWD9h1Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bcf14d681999602eb37801644b814b9ff0cb21b0193cbe0617a49ce0ebb6e813","last_reissued_at":"2026-07-16T01:22:38.876620Z","signature_status":"signed_v1","first_computed_at":"2026-07-16T01:22:38.876620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"NP-hardness of SVP in Euclidean Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.NT","authors_text":"Daqing Wan","submitted_at":"2026-03-28T20:33:18Z","abstract_excerpt":"van Emde Boas (1981) conjectured that computing a shortest non-zero vector of a lattice in an Euclidean space is NP-hard. In this paper, we prove that this conjecture is true and hence de-randomize the classical randomness result of Ajtai (1998). We follow the locally dense lattice de-randomizion program as formulated and systematically studied by Micciancio (1998-2014). Our proof builds on the construction of Bennett-Peikert (2023) on locally dense lattices via Reed-Solomon codes, and depends crucially on the work of Deligne on the Weil conjectures for higher dimensional varieties over finite"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.27398","kind":"arxiv","version":2},"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/2603.27398/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":"2603.27398","created_at":"2026-07-16T01:22:38.877052+00:00"},{"alias_kind":"arxiv_version","alias_value":"2603.27398v2","created_at":"2026-07-16T01:22:38.877052+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.27398","created_at":"2026-07-16T01:22:38.877052+00:00"},{"alias_kind":"pith_short_12","alias_value":"XTYU22AZTFQC","created_at":"2026-07-16T01:22:38.877052+00:00"},{"alias_kind":"pith_short_16","alias_value":"XTYU22AZTFQC5M3Y","created_at":"2026-07-16T01:22:38.877052+00:00"},{"alias_kind":"pith_short_8","alias_value":"XTYU22AZ","created_at":"2026-07-16T01:22:38.877052+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.24426","citing_title":"When Do Subset Sums in Finite Abelian Groups Support $2$-Designs?","ref_index":21,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XTYU22AZTFQC5M3YAFSEXAKLT7","json":"https://pith.science/pith/XTYU22AZTFQC5M3YAFSEXAKLT7.json","graph_json":"https://pith.science/api/pith-number/XTYU22AZTFQC5M3YAFSEXAKLT7/graph.json","events_json":"https://pith.science/api/pith-number/XTYU22AZTFQC5M3YAFSEXAKLT7/events.json","paper":"https://pith.science/paper/XTYU22AZ"},"agent_actions":{"view_html":"https://pith.science/pith/XTYU22AZTFQC5M3YAFSEXAKLT7","download_json":"https://pith.science/pith/XTYU22AZTFQC5M3YAFSEXAKLT7.json","view_paper":"https://pith.science/paper/XTYU22AZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2603.27398&json=true","fetch_graph":"https://pith.science/api/pith-number/XTYU22AZTFQC5M3YAFSEXAKLT7/graph.json","fetch_events":"https://pith.science/api/pith-number/XTYU22AZTFQC5M3YAFSEXAKLT7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XTYU22AZTFQC5M3YAFSEXAKLT7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XTYU22AZTFQC5M3YAFSEXAKLT7/action/storage_attestation","attest_author":"https://pith.science/pith/XTYU22AZTFQC5M3YAFSEXAKLT7/action/author_attestation","sign_citation":"https://pith.science/pith/XTYU22AZTFQC5M3YAFSEXAKLT7/action/citation_signature","submit_replication":"https://pith.science/pith/XTYU22AZTFQC5M3YAFSEXAKLT7/action/replication_record"}},"created_at":"2026-07-16T01:22:38.877052+00:00","updated_at":"2026-07-16T01:22:38.877052+00:00"}