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 cooperation in energy harvesting communications"):
  Abstract: In energy harvesting communications, users transmit messages using energy harvested from nature during the course of communication. With an optimum transmit policy, the performance of the system depends only on the energy arrival profiles. In this paper, we introduce the concept of energy cooperation, where a user wirelessly transmits a portion of its energy to another energy harvesting user. This enables shaping and optimization of the energy arrivals at the energy-receiving node, and improves the overall system performance, despite the loss incurred in energy transfer. We consider several basic multi-user network structures with energy harvesting and wireless energy transfer capabilities: relay channel, two-way channel and multiple access channel. We determine energy management policies that maximize the system throughput within a given duration using a Lagrangian formulation and the resulting KKT optimality conditions. We develop a two-dimensional directional water-filling algorithm which optimally controls the flow of harvested energy in two dimensions: in time (from past to future) and among users (from energy-transferring to energy-receiving) and show that a generalized version of this algorithm achieves the boundary of the capacity region of the two-way channel.

Includes members:
  Member "throughput maximization for the gaussian relay channel with energy harvesting constraints":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "timely updates in energy harvesting two hop networks offline and online policies")
  Member "optimal scheduling and power allocation for two hop energy harvesting communication systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "single or multiple frames content delivery for robust and secure communication in energy and spectrum efficient 5g networks")
  Member "throughput optimal policies for energy harvesting wireless transmitters with non ideal circuit power":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a maximin optimal online power control policy for energy harvesting communications")
  Member "two way communication with energy exchange":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "robust transceiver design for miso interference channel with energy harvesting")
  Member "throughput maximization for an energy harvesting communication system with processing cost":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "online policies for throughput maximization of energy constrained wireless powered communication systems")
  Member "on the transfer of information and energy in multi user systems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "energy sustainable paradigms and methods for future mobile networks a survey")
  Member "enabling wireless power transfer in cellular networks architecture modeling and deployment":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "cognitive wireless power transfer in the presence of reactive primary communication user")
  Member "communicating using an energy harvesting transmitter optimum policies under energy storage losses":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "on lossy joint source channel coding in energy harvesting communication 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)