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 allocation policy for cellular networks powered by renewable energy"):
  Abstract: The explosive wireless data service requirement accompanied with carbon dioxide emission and consumption of traditional energy has put pressure on both industry and academia. Wireless networks powered with the uneven and intermittent generated renewable energy have been widely researched and lead to a new research paradigm called green communication. In this paper, we comprehensively consider the total generated renewable energy, QoS requirement and channel quality, then propose a utility based renewable energy allocation policy. The utility here means the satisfaction degree of users with a certain amount allocated renewable energy. The energy allocation problem is formulated as a constraint optimization problem and a heuristic algorithm with low complexity is derived to solve the raised problem. Numerical results show that the renewable energy allocation policy is applicable for any situation. When the renewable energy is very scarce, only users with good channel quality can achieve allocated energy.

Includes members:
  Member "energy harvesting wireless communications a review of recent advances":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "analysis of d2d communication with rf energy harvesting and interference management")
  Member "power allocation for conventional and buffer aided link adaptive relaying systems with energy harvesting nodes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "energy efficient resource allocation for time varying ofdma relay systems with hybrid energy supplies")
  Member "wireless information and power transfer energy efficiency optimization in ofdma systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the performance gain of noma over oma in uplink communication systems")
  Member "optimal scheduling and power allocation for two hop energy harvesting communication systems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "single or multiple frames content delivery for robust and secure communication in energy and spectrum efficient 5g networks")
  Member "optimal energy allocation for wireless communications with energy harvesting constraints":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "optimal energy allocation and task offloading policy for wireless powered mobile edge computing systems")

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)