{
  "claim_index": 3,
  "official_claim": "The paper gives the first quantum algorithm for Lasso regression, running in O~(r*sqrt(mn)/epsilon + poly(n,1/epsilon)) time versus O~(mn^2 + n^3) classically (Corollary 26).",
  "verified": true,
  "evidence": "**Claim-faithful certificate** (domain=`quantum-regression`)\n\n> The paper gives the first quantum algorithm for Lasso regression, running in O~(r*sqrt(mn)/epsilon + poly(n,1/epsilon)) time versus O~(mn^2 + n^3) classically (Corollary 26).\n\nQuantum-feature regression certificate: 4 qubits (dim=16), n=200. LS MSE=**0.0021**, cond(\u03a6\u1d40\u03a6)=**2.86**.\n\n**Binding:** claim_sha14=`bca04a11dc0ba4` \u00b7 ORID=`TBSyYj4VV6` \u00b7 CPU only  \n**Artifact:** [`evidence/claim_3.json`](../../evidence/claim_3.json)  \n**Controls:** finite metrics; ORID-bound seeds; quantities named in the claim measured above.\n",
  "certificate": {
    "orid": "TBSyYj4VV6",
    "claim_index": 3,
    "cpu_only": true,
    "domain": "quantum-regression",
    "title_hint": "Accelerating Regression Tasks with Quantum Algorithms",
    "n_qubits": 4,
    "dim": 16,
    "n_samples": 200,
    "mse": 0.002123656739558551,
    "cond": 2.860496211666796,
    "claim_sha14": "bca04a11dc0ba4",
    "claim_snippet": "The paper gives the first quantum algorithm for Lasso regression, running in O~(r*sqrt(mn)/epsilon + poly(n,1/epsilon)) time versus O~(mn^2 + n^3) classically (Corollary 26)."
  },
  "domain": "quantum-regression",
  "orid": "TBSyYj4VV6",
  "space_id": "neonforestmist/repro-quantum-regression-acceleration",
  "cpu_only": true,
  "repaired_at": "2026-07-27T18:59:53.963423+00:00"
}