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 "optimization of weighted individual energy efficiencies in interference networks"):
  Abstract: This paper studies the maximization of the weighted sum energy efficiency (WSEE). We derive a first-order optimal algorithm applicable to a wide class of communication scenarios exhibiting very fast convergence. We also discuss how to leverage monotonic optimization and fractional programming to obtain a global optimal solution at the cost of higher computational complexity. The WSEE of interference networks is studied in detail with an application to relay-assisted multi-cell communication. This scenario is modeled as a non-regenerative multi-way relay channel and the achievable rate region is derived. We apply the proposed algorithm to this scenario and compare its performance to the global optimal algorithm. The results indicate that the proposed algorithm often achieves the global optimal solution and is close to it otherwise. Convergence is achieved within 10 iterations, while the global optimal solution may require more than 106 iterations.

Includes members:
  Member "energy efficient beam coordination strategies with rate dependent processing power":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "energy efficiency optimization for downlink massive mimo with statistical csit")
  Member "energy efficient power control a look at 5g wireless technologies":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "energy efficiency optimization for downlink massive mimo with statistical csit")
  Member "an overview of sustainable green 5g networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "cross layer scheduling and beamforming in smart grid powered cellular networks with heterogeneous energy coordination")
  Member "practical non linear energy harvesting model and resource allocation for swipt systems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "wirelessly powered sensor networks power allocation for channel estimation and energy beamforming")
  Member "energy efficient scheduling and power allocation in downlink ofdma networks with base station coordination":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "multiple antenna technologies for beyond 5g")
  Member "massive mimo for maximal spectral efficiency how many users and pilots should be allocated":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "massive mimo for internet of things iot connectivity")

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)