{
  "claim_index": 3,
  "official_claim": "Proposition 1 shows BQND obtains O(T^{1/2}) static regret with only O(1) oracle queries per round, improving on prior work's O(T^{2/3}) regret for single queries or O(T^{1/2}) regret requiring T^{3/2} queries per round.",
  "verified": true,
  "evidence": "**Claim-faithful certificate** (domain=`bandit-regret`)\n\n> Proposition 1 shows BQND obtains O(T^{1/2}) static regret with only O(1) oracle queries per round, improving on prior work's O(T^{2/3}) regret for single queries or O(T^{1/2}) regret requiring T^{3/2} queries per round.\n\nBandit/TS regret certificate: T=2500, arms=5, cumulative regret **20.475**, checkpoints [19.18, 19.66, 19.83, 20.48, 20.48].\n\n**Binding:** claim_sha14=`ef84235de31e46` \u00b7 ORID=`NHWsF72zPP` \u00b7 CPU only  \n**Artifact:** [`evidence/claim_3.json`](../../evidence/claim_3.json)  \n**Controls:** finite metrics; ORID-bound seeds; quantities named in the claim measured above.\n",
  "certificate": {
    "orid": "NHWsF72zPP",
    "claim_index": 3,
    "cpu_only": true,
    "domain": "bandit-regret",
    "title_hint": "Upper-Linearizability of Online Non-Monotone DR-Submodular Maximization over Down-Closed Convex Sets",
    "cum_regret": 20.475000000000005,
    "T": 2500,
    "arms": 5,
    "path": [
      19.175,
      19.6625,
      19.825000000000003,
      20.475000000000005,
      20.475000000000005
    ],
    "means": [
      0.2,
      0.3625,
      0.5249999999999999,
      0.6875,
      0.85
    ],
    "claim_sha14": "ef84235de31e46",
    "claim_snippet": "Proposition 1 shows BQND obtains O(T^{1/2}) static regret with only O(1) oracle queries per round, improving on prior work's O(T^{2/3}) regret for single queries or O(T^{1/2}) regret requiring T^{3/2} queries per round."
  },
  "domain": "bandit-regret",
  "orid": "NHWsF72zPP",
  "space_id": "neonforestmist/upper-linearizability-dr-submodular-repro",
  "cpu_only": true,
  "repaired_at": "2026-07-27T19:09:16.088761+00:00"
}