{
  "id": "hkkl26-constant-approximation",
  "categoryId": "svp-constant-approximation",
  "paperId": "paper-c70730f20075",
  "year": 2026,
  "date": "2026-11-04",
  "time": {
    "coefficient": 0.409,
    "expression": "2^{0.409 n + o(n)}"
  },
  "space": {
    "coefficient": 0.259,
    "expression": "2^{0.259 n + o(n)}"
  },
  "tags": [
    "arbitrary lattices",
    "Euclidean",
    "exact implies constant approximation"
  ],
  "review": {
    "status": "source-checked"
  },
  "certificate": {
    "status": "not-provided",
    "lean": null
  },
  "notes": "The exact-SVP theorem immediately supplies this approximation guarantee without changing time or space. This is a transferred guarantee, not another algorithm or a separate new result. Claim in the 4 November 2026 preprint abstract: optimized worst-case SVP time 0.409 and space 0.259. Dense superlattices, random shifts, and midpoint-shell tests. Source checked; proof not independently audited.",
  "extra": {
    "norm": "Euclidean ℓ₂",
    "success": "High probability",
    "model": "Classical randomized; polynomial factors suppressed",
    "reference": "HKKL26",
    "approximation": "Exact output (μ = 1), hence meets every relaxed constant-factor guarantee"
  }
}