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: "interference management in massive mimo hetnets a nested array approach"
  Abstract: The nested array, which is implemented by nonuniform antenna placement, is an effective approach to achieve O(N^2) degrees of freedom (DoF) with an antenna array of N antennas. Such DoF refers to the number of directions of incoming signals that can be resolved. With the increased number of DoF, an important application of nested array is to nullify the interference signals from multiple directions. In this paper, we apply nested array in a massive MIMO heterogeneous network (HetNet) for interference management. With nested array based interference nulling, each base station (BS) can nullify a certain number of interference signals. A key design issue is to select the interference sources to be nullified at each BS. We formulate this problem as an integer programming problem. The objective is to maximize the sum rate of all users, subject to BS DoF constraints. We propose an approximation scheme to solve this problem and derive a performance upper bound. Simulation results show that the proposed scheme effectively improves the sum rate and achieves a near optimal performance.

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)