{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:PL7PCKOBBOQGBPKYROIX2ZR6KE","short_pith_number":"pith:PL7PCKOB","schema_version":"1.0","canonical_sha256":"7afef129c10ba060bd588b917d663e51320f2d24a3920c345c90fbbffb88a81d","source":{"kind":"arxiv","id":"2608.02478","version":1},"attestation_state":"computed","paper":{"title":"Solving the Shortest Vector Problem in time $2^{0.6039n}$ Time via Mid-point Hessian","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.DS","authors_text":"Minki Hhan","submitted_at":"2026-08-03T16:46:49Z","abstract_excerpt":"We present randomized algorithms for the shortest vector problem (SVP). For the $n$-dimensional lattice $\\mathcal L$, our algorithms solve SVP in time $2^{0.6039n+o(n)}$ classically and $2^{0.5411n+o(n)}$ quantumly and space $2^{0.5n+o(n)}$, improving the previous best algorithm running in $2^{n+o(n)}$ time and space of Aggarwal, Dadush, Regev, and Stephens-Davidowitz [STOC'15].\n  Our algorithms heavily use the property of the Hessian of the periodic Gaussian function at the half shortest vector: For a shortest vector $v \\in \\mathcal L$, the Hessian at $v/2$ has the eigenvector close to $v$, w"},"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":"2608.02478","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-08-03T16:46:49Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"da2012a4d6c725b50e1eda95ea649564f1f4feb0cfb2c81b092058f2240676b9","abstract_canon_sha256":"1d7d075d1860fadb7efac4aa8f9a19d39fbce32b6f97a910190c546c5730d5bf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-04T02:43:45.827720Z","signature_b64":"FyMM54EYG6CIfp718Gf43bZ/ts0EUljWs3qprUoD/JbLl1ei46BcaCN11OOP4/0xX/fKZ9Jpiy9QgKayfxLHAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7afef129c10ba060bd588b917d663e51320f2d24a3920c345c90fbbffb88a81d","last_reissued_at":"2026-08-04T02:43:45.825329Z","signature_status":"signed_v1","first_computed_at":"2026-08-04T02:43:45.825329Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving the Shortest Vector Problem in time $2^{0.6039n}$ Time via Mid-point Hessian","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.DS","authors_text":"Minki Hhan","submitted_at":"2026-08-03T16:46:49Z","abstract_excerpt":"We present randomized algorithms for the shortest vector problem (SVP). For the $n$-dimensional lattice $\\mathcal L$, our algorithms solve SVP in time $2^{0.6039n+o(n)}$ classically and $2^{0.5411n+o(n)}$ quantumly and space $2^{0.5n+o(n)}$, improving the previous best algorithm running in $2^{n+o(n)}$ time and space of Aggarwal, Dadush, Regev, and Stephens-Davidowitz [STOC'15].\n  Our algorithms heavily use the property of the Hessian of the periodic Gaussian function at the half shortest vector: For a shortest vector $v \\in \\mathcal L$, the Hessian at $v/2$ has the eigenvector close to $v$, w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.02478","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/2608.02478/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":"2608.02478","created_at":"2026-08-04T02:43:45.827707+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.02478v1","created_at":"2026-08-04T02:43:45.827707+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.02478","created_at":"2026-08-04T02:43:45.827707+00:00"},{"alias_kind":"pith_short_12","alias_value":"PL7PCKOBBOQG","created_at":"2026-08-04T02:43:45.827707+00:00"},{"alias_kind":"pith_short_16","alias_value":"PL7PCKOBBOQGBPKY","created_at":"2026-08-04T02:43:45.827707+00:00"},{"alias_kind":"pith_short_8","alias_value":"PL7PCKOB","created_at":"2026-08-04T02:43:45.827707+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.03220","citing_title":"One Discrete Gaussian Sample in $2^{n/2+o(n)}$ Time","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PL7PCKOBBOQGBPKYROIX2ZR6KE","json":"https://pith.science/pith/PL7PCKOBBOQGBPKYROIX2ZR6KE.json","graph_json":"https://pith.science/api/pith-number/PL7PCKOBBOQGBPKYROIX2ZR6KE/graph.json","events_json":"https://pith.science/api/pith-number/PL7PCKOBBOQGBPKYROIX2ZR6KE/events.json","paper":"https://pith.science/paper/PL7PCKOB"},"agent_actions":{"view_html":"https://pith.science/pith/PL7PCKOBBOQGBPKYROIX2ZR6KE","download_json":"https://pith.science/pith/PL7PCKOBBOQGBPKYROIX2ZR6KE.json","view_paper":"https://pith.science/paper/PL7PCKOB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.02478&json=true","fetch_graph":"https://pith.science/api/pith-number/PL7PCKOBBOQGBPKYROIX2ZR6KE/graph.json","fetch_events":"https://pith.science/api/pith-number/PL7PCKOBBOQGBPKYROIX2ZR6KE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PL7PCKOBBOQGBPKYROIX2ZR6KE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PL7PCKOBBOQGBPKYROIX2ZR6KE/action/storage_attestation","attest_author":"https://pith.science/pith/PL7PCKOBBOQGBPKYROIX2ZR6KE/action/author_attestation","sign_citation":"https://pith.science/pith/PL7PCKOBBOQGBPKYROIX2ZR6KE/action/citation_signature","submit_replication":"https://pith.science/pith/PL7PCKOBBOQGBPKYROIX2ZR6KE/action/replication_record"}},"created_at":"2026-08-04T02:43:45.827707+00:00","updated_at":"2026-08-04T02:43:45.827707+00:00"}