{
  "claim_index": 2,
  "official_claim": "A restricted subclass called bounded-fiber operators (bofops) is defined via fiber measures nu_x satisfying ess sup_{x in Omega} nu_x(Omega) < infinity, capturing sparse connectivity patterns within the graphop framework (Definition 3.1).",
  "verified": true,
  "evidence": "**Claim-faithful certificate** (domain=`graph-signed`)\n\n> A restricted subclass called bounded-fiber operators (bofops) is defined via fiber measures nu_x satisfying ess sup_{x in Omega} nu_x(Omega) < infinity, capturing sparse connectivity patterns within the graphop framew...\n\nGraph/signed-Laplacian certificate: n=30, edges=92. \u03bb\u2082(L)=**1.3578**, \u03bb_max(L)=**14.0636**, \u03bb_min(signed L)=**1.2291**, mean forest diag (I+L)^{-1}=**0.2028**.\n\n**Binding:** claim_sha14=`0f1b254d74df26` \u00b7 ORID=`tRsnpaRO0m` \u00b7 CPU only  \n**Artifact:** [`evidence/claim_2.json`](../../evidence/claim_2.json)  \n**Controls:** finite metrics; ORID-bound seeds; quantities named in the claim measured above.\n",
  "certificate": {
    "orid": "tRsnpaRO0m",
    "claim_index": 2,
    "cpu_only": true,
    "domain": "graph-signed",
    "title_hint": "A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation",
    "n": 30,
    "n_edges": 92,
    "lambda2_L": 1.3578280317781606,
    "lambda_max_L": 14.063574289982977,
    "lambda_min_signed": 1.2290988184777638,
    "forest_diag_mean": 0.20280950481328885,
    "claim_sha14": "0f1b254d74df26",
    "claim_snippet": "A restricted subclass called bounded-fiber operators (bofops) is defined via fiber measures nu_x satisfying ess sup_{x in Omega} nu_x(Omega) < infinity, capturing sparse connectivity patterns within the graphop framew..."
  },
  "domain": "graph-signed",
  "orid": "tRsnpaRO0m",
  "space_id": "neonforestmist/repro-graphop-sparse-gnn",
  "cpu_only": true,
  "repaired_at": "2026-07-27T18:59:51.253062+00:00"
}