human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "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.

Includes members:
  Member "optimal design of energy efficient multi user mimo systems is massive mimo the answer":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "rate splitting multiple access for multi antenna downlink communication systems spectral and energy efficiency tradeoff")
  Member "massive mimo and small cells improving energy efficiency by optimal soft cell coordination":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a data aided channel estimation scheme for decoupled systems in heterogeneous networks")
  Member "large system analysis of linear precoding in correlated miso broadcast channels under limited feedback":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "covariance aided csi acquisition with non orthogonal pilots in massive mimo a large system performance analysis")
  Member "multi cell mimo downlink with cell cooperation and fair scheduling a large system limit analysis":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "joint user selection power allocation and precoding design with imperfect csit for multi cell mu mimo downlink systems")
  Member "energy and spectral efficiency of very large multiuser mimo systems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "downlink secrecy rate of one bit massive mimo system with active eavesdropping")
  Member "framework for link level energy efficiency optimization with informed transmitter":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "distributed power control with partial channel state information performance characterization and design")

Question: Please tell me which class the source paper 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)