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: "simple energy efficiency maximization methods for mu miso systems based on saturation power"
  Abstract: In this paper, we investigate an energy efficiency (EE) maximization problem in multi-user multiple input single output downlink channels. The optimization problem in this system model is difficult to solve in general, since it is in non-convex fractional form. Hence, conventional algorithms have addressed the problem in an iterative manner for each channel realization, which leads to high computational complexity. To tackle this complexity issue, we propose a new simple method by utilizing the fact that the EE maximization is identical to the spectral efficiency (SE) maximization for the region of the power below a certain transmit power referred to as saturation power. In order to calculate the saturation power, we first introduce upper and lower bounds of the EE performance by adopting a maximal ratio transmission beamforming strategy. Then, we propose an efficient way to compute the saturation power for the EE maximization problem. Once we determine the saturation power corresponding to the maximum EE in advance, we can solve the EE maximization problem with SE maximization schemes with low complexity. The derived saturation power is parameterized by employing random matrix theory, which relies only on the second order channel statistics. Hence, this approach requires much lower computational complexity compared to a conventional scheme which exploits instantaneous channel state information, and provides insight on the saturation power. Numerical results validate that the proposed algorithm achieves near optimal EE performance with significantly reduced complexity.

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)