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 harvesting networks with energy cooperation procrastinating policies"):
  Abstract: This paper considers multiterminal networks with energy harvesting transmitter nodes that are also capable of wirelessly transferring energy to or receiving energy from other nodes in the network. In particular, the jointly optimal transmit power and energy transfer policies that maximize sum-throughput for the two-way, two-hop, and multiple access channels are identified. It is shown for nodes with infinite-sized batteries that delaying energy transfers until energy is needed immediately at the receiving node is sum-throughput optimal. Focusing on such procrastinating policies without loss of optimality, the stated joint optimization problem can be decomposed into energy transfer and consumed energy allocation problems which are solved in tandem. This decomposition is shown to hold for the finite-sized battery case as well, using partially procrastinating policies that avoid battery overflows. It is observed that for the two-hop channel, the proposed algorithm has a two fluid water-filling interpretation, and for the multiple access channel, it reduces to a single transmitter problem with aggregate energy arrivals. Numerical results demonstrate the throughput improvement with bi-directional energy cooperation over no cooperation and uni-directional cooperation.

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 "wireless networks with rf energy harvesting a contemporary survey":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "wirelessly powered sensor networks power allocation for channel estimation and energy beamforming")
  Member "power allocation for conventional and buffer aided link adaptive relaying systems with energy harvesting nodes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "energy efficient resource allocation for time varying ofdma relay systems with hybrid energy supplies")
  Member "energy efficient resource allocation in multiuser ofdm systems with wireless information and power transfer":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "artificial noise aided secrecy information and power transfer in ofdma systems")
  Member "energy efficient optimization for wireless information and power transfer in large scale mimo systems employing energy beamforming":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "transmission delay minimization in wireless powered communication systems")
  Member "energy cooperation in energy harvesting communications":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "transmission delay minimization in wireless powered communication systems")
  Member "interactive joint transfer of energy and information":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "wirelessly powered data aggregation for iot via over the air functional computation beamforming and power control")
  Member "throughput maximization for the gaussian relay channel with energy harvesting constraints":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "timely updates in energy harvesting two hop networks offline and online policies")

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)