# A Graphop Analysis of Graph Neural Networks on Sparse Graphs: Generalization and Universal Approximation

ORID `tRsnpaRO0m` · **claim-faithful** repair 2026-07-27T18:59:51.255680+00:00

Paper-style claim pages with **inline numbers** and linked `evidence/` artifacts.

## Claims

- [Claim 1: 01-graphops-are-introduced-self-adjoint-positivity](./01-graphops-are-introduced-self-adjoint-positivity/) — VERIFIED (2/2)
- [Claim 2: 02-restricted-subclass-called-bounded-fiber-operato](./02-restricted-subclass-called-bounded-fiber-operato/) — VERIFIED (2/2)
- [Claim 3: 03-establishes-message-passing-neural-networks](./03-establishes-message-passing-neural-networks/) — VERIFIED (2/2)
- [Claim 4: 04-space-bofop-didms-degree-indexed-distribution-me](./04-space-bofop-didms-degree-indexed-distribution-me/) — VERIFIED (2/2)
- [Claim 5: 05-uses-compactness-continuity-universal-approximat](./05-uses-compactness-continuity-universal-approximat/) — VERIFIED (2/2)
- [Claim 6: 06-derives-generalization-bounds-showing-generaliza](./06-derives-generalization-bounds-showing-generaliza/) — VERIFIED (2/2)
- [Conclusion](./conclusion/)

## Artifacts

- [`evidence/claim_1.json`](../evidence/claim_1.json)
- [`evidence/claim_2.json`](../evidence/claim_2.json)
- [`evidence/claim_3.json`](../evidence/claim_3.json)
- [`evidence/claim_4.json`](../evidence/claim_4.json)
- [`evidence/claim_5.json`](../evidence/claim_5.json)
- [`evidence/claim_6.json`](../evidence/claim_6.json)