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 "optimal cooperative power allocation for energy harvesting enabled relay networks"):
  Abstract: In this paper, we present a new power allocation scheme for a decode-and-forward (DF) relaying-enhanced cooperative wireless system. While both source and relay nodes may have limited traditional brown power supply or fixed green energy storage, the hybrid source node can also draw power from the surrounding radio frequency (RF) signals. In particular, we assume a deterministic RF energy harvesting (EH) model under which the signals transmitted by the relay serve as the renewable energy source for the source node. The amount of harvested energy is known for a given transmission power of the forwarding signal and channel condition between the source and relay nodes. To maximize the overall throughput while meeting the constraints imposed by the non-sustainable energy sources and the renewable energy source, an optimization problem is formulated and solved. Based on different harvesting efficiency and channel condition, closed form solutions are derived to obtain the optimal source and relay power allocation jointly. It is shown that instead of demanding high on-grid power supply or high green energy availability, the system can achieve compatible or higher throughput by utilizing the harvested energy.

Includes members:
  Member "joint spectrum and power allocation for multi node cooperative wireless systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "joint spectrum allocation and structure optimization in green powered heterogeneous cognitive radio networks")
  Member "rf energy harvesting enabled power sharing in relay networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on green energy powered cognitive radio networks")
  Member "power allocation strategies in energy harvesting wireless cooperative networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on maximizing information reliability in wireless powered cooperative networks")
  Member "on green energy powered cognitive radio networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "harvest or transmit policy for cognitive radio networks a learning theoretic approach")
  Member "throughput maximization for the gaussian relay channel with energy harvesting constraints":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "timely updates in energy harvesting two hop networks offline and online policies")
  Member "relaying protocols for wireless energy harvesting and information processing":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on maximizing information reliability in wireless powered cooperative networks")
  Member "optimal save then transmit protocol for energy harvesting wireless transmitters":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "mimo underlay cognitive radio optimized power allocation effective number of transmit antennas and harvest transmit tradeoff")
  Member "optimal energy allocation for wireless communications with energy harvesting constraints":
    also connected through other hyperedges:
      - Hyperedge HE-8 (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.IT(Information Theory)