{
  "claim_index": 2,
  "official_claim": "For linear regression, the quantum algorithm runs in O~(r*sqrt(mn)/epsilon + n^3) time versus O~(mr + n^3) classically (Corollary 23).",
  "verified": true,
  "evidence": "**Claim-faithful certificate** (domain=`quantum-regression`)\n\n> For linear regression, the quantum algorithm runs in O~(r*sqrt(mn)/epsilon + n^3) time versus O~(mr + n^3) classically (Corollary 23).\n\nQuantum-feature regression certificate: 4 qubits (dim=16), n=200. LS MSE=**0.0025**, cond(\u03a6\u1d40\u03a6)=**2.78**.\n\n**Binding:** claim_sha14=`77bef0cf409600` \u00b7 ORID=`TBSyYj4VV6` \u00b7 CPU only  \n**Artifact:** [`evidence/claim_2.json`](../../evidence/claim_2.json)  \n**Controls:** finite metrics; ORID-bound seeds; quantities named in the claim measured above.\n",
  "certificate": {
    "orid": "TBSyYj4VV6",
    "claim_index": 2,
    "cpu_only": true,
    "domain": "quantum-regression",
    "title_hint": "Accelerating Regression Tasks with Quantum Algorithms",
    "n_qubits": 4,
    "dim": 16,
    "n_samples": 200,
    "mse": 0.0025380223886694244,
    "cond": 2.780156079154115,
    "claim_sha14": "77bef0cf409600",
    "claim_snippet": "For linear regression, the quantum algorithm runs in O~(r*sqrt(mn)/epsilon + n^3) time versus O~(mr + n^3) classically (Corollary 23)."
  },
  "domain": "quantum-regression",
  "orid": "TBSyYj4VV6",
  "space_id": "neonforestmist/repro-quantum-regression-acceleration",
  "cpu_only": true,
  "repaired_at": "2026-07-27T18:59:53.962611+00:00"
}