Research ideas

Every idea extracted from recent arXiv mathematics papers — verified and unverified. Click an idea to open its full card; badges show the empirical verdict.

✓✓ Beats tuned baseline 2026

Kesten–Stigum Attenuated Message Passing

Replace uniform graph-convolution aggregation with a distance-aware message transform whose strength decays as \(\gamma^k\). At hop \(k\), transform the learned local evidence with \(2\operatorname{artanh}(\gamma^k z)\) before summation, so distant nodes have a provably shrinking influence window rather than accumulating unbounded noisy evidence.

Useful8/10
Difficulty5/10
Novelty6/10
Paper: The Value of Depth in Message Passing on Sparse Graphs: A Kesten-Stigum Dichotomy arXiv:2607.16676