{
  "title": "Decentralized Online Convex Optimization with Efficient Communication: Improved Algorithm and Lower Bounds",
  "orid": "d9JlreUNVY",
  "space_id": "neonforestmist/decentralized-oco-efficient-communication-repro",
  "forecast": "12/12",
  "repair": "claim-faithful-v3",
  "repaired_at": "2026-07-27T19:00:50.127972+00:00",
  "pages": [
    "01-top-dogd-regret-convex-loss-functions",
    "02-top-dogd-regret-strongly-convex-loss",
    "03-reduces-dependence-compression-quality-previousl",
    "04-first-lower-bounds-decentralized-online",
    "05-algorithm-combines-two-level-blocking-update",
    "06-bandit-feedback-extensions-are-provided-one-poin",
    "conclusion"
  ],
  "artifacts": [
    "evidence/claim_1.json",
    "evidence/claim_2.json",
    "evidence/claim_3.json",
    "evidence/claim_4.json",
    "evidence/claim_5.json",
    "evidence/claim_6.json"
  ],
  "cpu_only": true
}