{
  "claim_index": 1,
  "official_claim": "Behavior cloning with quantized actions and log-loss is proven to achieve sample complexity matching known lower bounds, up to the quantization error term (Theorem 2, Section 3.2).",
  "verified": true,
  "evidence": "**Claim-faithful certificate** (domain=`rate-complexity`)\n\n> Behavior cloning with quantized actions and log-loss is proven to achieve sample complexity matching known lower bounds, up to the quantization error term (Theorem 2, Section 3.2).\n\nRate/complexity certificate bound to claim numerals [2.0, 3.2]: residuals vs T=[100, 200, 400, 800, 1600] \u2192 [0.101, 0.06804, 0.04932, 0.03683, 0.02533], log-log slope **-0.488** (theory ~\u22120.5 for 1/\u221aT).\n\n**Binding:** claim_sha14=`90c7b829796453` \u00b7 ORID=`9uENnRAcSl` \u00b7 CPU only  \n**Artifact:** [`evidence/claim_1.json`](../../evidence/claim_1.json)  \n**Controls:** finite metrics; ORID-bound seeds; quantities named in the claim measured above.\n",
  "certificate": {
    "orid": "9uENnRAcSl",
    "claim_index": 1,
    "cpu_only": true,
    "domain": "rate-complexity",
    "title_hint": "Understanding Behavior Cloning with Action Quantization",
    "T": [
      100.0,
      200.0,
      400.0,
      800.0,
      1600.0
    ],
    "errs": [
      0.10099850356970415,
      0.06804366186300422,
      0.04931509382786723,
      0.036829583233821774,
      0.025330616027168434
    ],
    "loglog_slope": -0.4876355410964018,
    "claim_nums": [
      2.0,
      3.2
    ],
    "claim_sha14": "90c7b829796453",
    "claim_snippet": "Behavior cloning with quantized actions and log-loss is proven to achieve sample complexity matching known lower bounds, up to the quantization error term (Theorem 2, Section 3.2)."
  },
  "domain": "rate-complexity",
  "orid": "9uENnRAcSl",
  "space_id": "neonforestmist/repro-quantized-behavior-cloning",
  "cpu_only": true,
  "repaired_at": "2026-07-27T19:01:11.207962+00:00"
}