Michael Chiaramonte · March 2026
PCI optimization has been misformulated as graph coloring — the wrong graph, the wrong objective, and the wrong evaluation. This paper applies the RA-NN formulation to PCI planning, constructing a sparse interaction graph from UE measurement reports and targeting confusion (the actual operational problem) instead of collisions. The resolution procedure uses message passing over the graph's 2-hop neighborhood structure, converges monotonically, executes in under 0.1 seconds on a 1,500-cell network, and changes only the cells that need to change.
Michael Chiaramonte · January 2026
This paper introduces the RA-NN — a neural systems formulation that treats the radio access network itself as a learnable system. Rather than applying AI models on top of legacy RAN abstractions, the RA-NN defines a new architectural foundation where the network learns its own structure from per-UE observations, builds a shared latent substrate, and derives control policies directly from that substrate.