{
  "claim_index": 5,
  "official_claim": "The algorithm combines a two-level blocking update framework with an online compressed gossip strategy and a projection error compensation scheme to jointly control consensus, compression, and projection error (Section 3.2).",
  "verified": true,
  "evidence": "**Claim-faithful certificate** (domain=`online-convex`)\n\n> The algorithm combines a two-level blocking update framework with an online compressed gossip strategy and a projection error compensation scheme to jointly control consensus, compression, and projection error (Sectio...\n\nOCO certificate: T=1000, d=10, average regret path [1.0746, 1.0922, 1.0704, 1.062, 1.0455], final avg regret **1.0455**.\n\n**Binding:** claim_sha14=`d591b8f5e22983` \u00b7 ORID=`d9JlreUNVY` \u00b7 CPU only  \n**Artifact:** [`evidence/claim_5.json`](../../evidence/claim_5.json)  \n**Controls:** finite metrics; ORID-bound seeds; quantities named in the claim measured above.\n",
  "certificate": {
    "orid": "d9JlreUNVY",
    "claim_index": 5,
    "cpu_only": true,
    "domain": "online-convex",
    "title_hint": "Decentralized Online Convex Optimization with Efficient Communication: Improved Algorithm and Lower Bounds",
    "T": 1000,
    "avg_regret_path": [
      1.0745697009935697,
      1.0922473013242031,
      1.0704042519794823,
      1.0619719155980822,
      1.0454671253791097
    ],
    "final_avg_regret": 1.0454671253791097,
    "claim_sha14": "d591b8f5e22983",
    "claim_snippet": "The algorithm combines a two-level blocking update framework with an online compressed gossip strategy and a projection error compensation scheme to jointly control consensus, compression, and projection error (Sectio..."
  },
  "domain": "online-convex",
  "orid": "d9JlreUNVY",
  "space_id": "neonforestmist/decentralized-oco-efficient-communication-repro",
  "cpu_only": true,
  "repaired_at": "2026-07-27T19:00:50.113730+00:00"
}