{
  "domain": "computer-science",
  "topics": [
    "learning-theory",
    "algorithms-complexity"
  ],
  "type": "proof",
  "also": [
    "algorithm"
  ],
  "source": {
    "key": "colt",
    "name": "COLT open problems",
    "url": "https://proceedings.mlr.press/v336/arvanitakis26a.html",
    "id": "v336/arvanitakis26a",
    "curator": "Conference on Learning Theory (COLT)",
    "poser": "Dionysis Arvanitakis, Vaidehi Srinivas and Aravindan Vijayaraghavan",
    "status": "open",
    "as_of": "2026-10-20",
    "catalog": "0521c19bbd38"
  },
  "review": true,
  "approval": "first-time"
}