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: "full downlink channel reconstruction using incomplete uplink channel measurements in massive mimo networks"
  Abstract: While more and more antennas are integrated into single mobile user equipment to increase communication quality and throughput, the number of antennas used for transmission is commonly restricted due to the concerns on hardware complexity and energy consumption, making it impossible to achieve the maximum channel capacity. This paper investigates the problem of reconstructing the full downlink channel from incomplete uplink channel measurements in Massive MIMO systems. We present ARDI, a scheme that builds a bridge between the radio channel and physical signal propagation environment to link spatial information about the non-transmitting antennas with their radio channels. By inferring locations and orientations of the non-transmitting antennas from an incomplete set of uplink channels, ARDI can reconstruct the downlink channels for non-transmitting antennas. We derive a closed-form solution to reconstruct antenna orientation in both single-path and multi-path propagation environments. The performance of ARDI is evaluated using simulations with realistic human movement. The results demonstrate that ARDI is capable of accurately reconstructing full downlink channels when the signal-to-noise ratio is higher than 15dB, thereby expanding the channel capacity of Massive MIMO networks.

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)