Save products you love by clicking the heart icon.
We use privacy-friendly analytics (Plausible + Umami) to understand how visitors use this site. No analytics are loaded without your consent. Privacy Policy
Published on Zenodo: 10.5281/zenodo.20479512
This preprint synthesises the complete Riemann Project — 11 experiment tracks, 7 GNN architectures, 200,000 weight-2 newforms from the LMFDB, and a formal theoretical analysis of why message-passing GNNs fail on algebraic graphs.
Related articles: GNN + Riemann Hypothesis, Trace-Index Graph Prediction, ML Pipeline for Modular Forms
The 12-page preprint (32 references) consolidates every experiment track and theoretical contribution:
GNNs systematically fail on vertex-transitive algebraic graphs. Across GCN, GAT, GIN, ChebConv, and GraphSage — on subgraph and full-graph scales — no architecture achieves ΔR² > +0.042 over a trivial log(N) baseline. The root cause is vertex-transitivity: every node is structurally identical, collapsing local neighborhood information that message-passing depends on. Formalised via the Weisfeiler-Leman hierarchy: MPNNs on vertex-transitive graphs are limited to functions of diameter and degree.
When the data has structure, ML succeeds:
| Experiment | Sample | Best Result |
|---|---|---|
| Cayley spectral gap (GNN) | 27 primes, 1M+ node graphs | ΔR² = +0.042 (chance-level) |
| Hecke trace regression | 53,000 forms | R² = 0.987 (sklearn GBR) |
| Analytic rank | 46,347 forms | F₁ = 0.970 |
| L-zero prediction (GAT) | 46,347 forms, 1000-node graphs | R² = 0.731 |
| CM classification | 46,347 forms | F₁ = 0.919 |
| GAT attention (prime bias) | 2000 graphs, 56M edges | d = 0.035 (negligible) |
| ζ zeros via CvS | N = 100 | 10⁻¹⁶ machine precision |
Weiss, T. (2026). Machine Learning for Modular Forms: Graph Neural Networks, Spectral Methods, and L-Function Phenomenology. Zenodo. https://doi.org/10.5281/zenodo.20479512
All code, data pipelines, and experimental scripts are available in the Riemann Project repository (Dockerised, with Makefile targets for reproduction). The repository includes the full knowledge graph (Cypher/Neo4j), 7 GNN implementations, eigenvalue computation via sparse Lanczos, and Sato-Tate moment analysis.