Metraipolis › archive › dc_bf0a9448daed

Congruence Decomposition with Neural Block Solvers for Large-Scale PCI Assignment — arXiv:2608.21485

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.21485
License (as archived)
CC0-1.0
Archived
2026-10-18T10:13:07.084Z
SHA-256 of the archived text
60fb42cb5af93dea8d3699bc2f20828b8b28d272c8a26c5ff2453b58bfda1bd8
Stable URL of this page
https://metraipolis.com/documento/dc_bf0a9448daed

How to cite

Congruence Decomposition with Neural Block Solvers for Large-Scale PCI Assignment — arXiv:2608.21485 — arXiv (en), https://arxiv.org/abs/2608.21485 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_bf0a9448daed (Metraipolis archive dc_bf0a9448daed, sha256 60fb42cb5af93dea8d3699bc2f20828b8b28d272c8a26c5ff2453b58bfda1bd8)
BibTeX
@misc{dcbf0a9448daed,
  title = {Congruence Decomposition with Neural Block Solvers for Large-Scale PCI Assignment — arXiv:2608.21485},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.21485},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_bf0a9448daed; sha256 60fb42cb5af93dea8d3699bc2f20828b8b28d272c8a26c5ff2453b58bfda1bd8},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.21485. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Physical Cell Identity (PCI) assignment is essential for interference management in dense 5G networks. As cellular networks scale, PCI reuse becomes unavoidable, which may cause collisions, confusions, and multiple forms of modular interference. Jointly mitigating these effects gives rise to a large-scale, multi-objective combinatorial optimization problem that is difficult to solve efficiently at practical network scales. In this work, we propose a congruence decomposition framework with neural block solvers for large-scale PCI assignment. The proposed decomposition exploits the arithmetic structure of PCI values to decouple multiple modular interference objectives into a collection of blockwise Min-$k$-Partition subproblems, followed by a graph coloring procedure to resolve PCI conflicts. For the resulting NP-hard Min-$k$-Partition subproblems, we develop neural block solvers by parameterizing their relaxed quadratic formulations with graph neural networks, enabling efficient optimization at large scales. Discrete assignments are recovered through conditional expectation rounding with theoretical guarantees. Experiments on synthetic cellular graphs and real-world 5G networks show that the proposed method consistently outperforms existing modular-interference-aware baselines in modular interference reduction, conflict elimination, and computational efficiency.

Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-08-25 in eess.SP).
Categorie arXiv: Machine Learning (cs.LG) ; Signal Processing (eess.SP).
Pagina del lavoro: https://arxiv.org/abs/2608.21485 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-18T10:08:38.297Z dalla pagina https://arxiv.org/catchup/eess.SP/2026-08-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).