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: "energy efficient massive mimo through distributed precoder design"
  Abstract: This paper presents an energy-efficient downlink precoding scheme with the objective of maximizing system energy efficiency in a multi-cell massive MIMO system. The proposed precoding design jointly considers the issues of power control, interference management, antenna switching and user throughput in a cluster of base stations (BS). We demonstrate that the precoding design can be formulated into a general sparsity-inducing non-convex problem, which is NP-hard. We thus apply a smooth approximation of zero-norm in the antenna power management to enable the application of the gradient-based algorithms. The non-convexity of the problem may also cause slow convergence or even divergence if some classical gradient algorithms are directly applied. We thus develop an efficient alternative algorithm combining features from augmented multiplier (AM) and quadratic programming (QP) to guarantee the convergence. We theoretically prove the convergence conditions for our algorithm both locally and globally under realistic assumptions. Our proposed algorithms further facilitate a distributed implementation that reduces backhaul overhead by offloading data-intensive steps to local computation at each BS. Numerical results confirm that our methods indeed achieve higher energy efficiency with superior convergence rate, compared to some well-known existing methods.

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)