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 "energy efficiency of massive mimo coping with daily load variation"):
  Abstract: Massive MIMO is a promising technique to meet the exponential growth of mobile traffic demand. However, contrary to the current systems, energy consumption of next generation networks is required to be load adaptive as the network load varies significantly throughout the day. In this paper, we propose a load adaptive multi-cell massive MIMO system where each base station (BS) adapts the number of antennas to the daily load profile (DLP) in order to maximize the downlink energy efficiency (EE). In order to incorporate the DLP, the load at each BS is modeled as an M/G/m/m state dependent queue under the assumption that the network is dimensioned to serve a maximum number of users at the peak load. The EE maximization problem is formulated in a game theoretic framework where the number of antennas to be used by a BS is determined through best response iteration. This load adaptive system achieves around 24% higher EE and saves around 40% energy compared to a baseline system where the BSs always run with the fixed number of antennas that is most energy efficient at the peak load and that can be switched off when there is no traffic.

Includes members:
  Member "massive mimo for next generation wireless systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "joint power control and lsfd for wireless powered cell free massive mimo")
  Member "energy and spectral efficiency of very large multiuser mimo systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "downlink secrecy rate of one bit massive mimo system with active eavesdropping")

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.NI(Networking and Internet Architecture)