human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "multi user provisioning in millimeter wave urban cellular networks"
  Abstract: In this paper we present the first comprehensive study of the multi-user capacity of millimeter-wave (mm-wave) urban cellular networks, using site-specific ray-tracing propagation data and realistic antenna array patterns. We compare the performance of TDMA and SDMA (time and spatial division multiple access, respectively) for diverse network scenarios and antenna configurations. We propose a greedy heuristic algorithm to solve the network-wide directional link allocation problem, thereby estimating the achievable capacity and coverage of multi-user mm-wave networks. Our results show that inter-cell interference is negligible, so that TDMA performance is strictly limited by air-time sharing. By contrast, the major limiting factor for SDMA is intra-cell interference, emphasizing the impact of real antenna array sidelobes. Nonetheless, SDMA significantly outperforms TDMA in terms of average UE throughput, by up to 2 Gbps using 8x8 arrays. As an important design insight, our results show that larger base station antenna arrays limit intra-cell interference while compensating for small UE arrays, reducing costs and beamforming requirements in practical SDMA networks. Our analysis also shows that the limited number of antenna sub-arrays in a practical hybrid beamforming architecture may force SDMA to drop UEs with good coverage, highlighting a tradeoff between base station densification and antenna resources.

Question: Please tell me which class the center node belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.NI(Networking and Internet Architecture)