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: "joint power allocation and load balancing optimization for energy efficient cell free massive mimo networks"
  Abstract: Large-scale distributed antenna systems with many access points (APs) that serve the users by coherent joint transmission is being considered for 5G-and-beyond networks. The technology is called Cell-free Massive MIMO and can provide a more uniform service level to the users than a conventional cellular topology. For a given user set, only a subset of the APs is likely needed to satisfy the users' performance demands, particularly outside the peak traffic hours. To find a flexible and energy-efficient implementation, we minimize the total downlink power consumption at the APs, considering both the transmit powers and hardware dissipation. APs can be temporarily turned off to reduce the latter part. The formulated optimization problem is non-convex but, nevertheless, a globally optimal solution is obtained by solving a mixed-integer second-order cone program. Since the computational complexity is prohibitive for real-time implementation, we also propose two low-complexity algorithms that exploit the inherent group-sparsity and the optimized transmit powers in the problem formulation. Numerical results manifest that our optimization algorithms can greatly reduce the power consumption compared to keeping all APs turned on and only minimizing the transmit powers. Moreover, the low-complexity algorithms can effectively handle the power allocation and AP activation for large-scale 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.IT(Information Theory)