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 "an optimal transmission policy for energy harvesting systems with continuous energy and data arrivals"):
  Abstract: Energy harvesting has been developed as an effective technology for communication systems in order to extend the lifetime of these systems. In this work, we consider a singleuser energy harvesting wireless communication system, in which arrival data and harvested energy curves are modeled as continuous functions. For the single-user model, our first goal is to find an offline algorithm, which maximizes the amount of data which is transmitted to the receiver node by a given deadline. If more than one scheme exists that transmits the maximum data, we choose the one with minimum utilized energy at the transmitter node. Next, we propose an online algorithm for this system. We also consider a multi-hop energy harvesting wireless communication system in a full-duplex mode and find the optimal offline algorithm to maximize the throughput.

Includes members:
  Member "optimal offline and competitive online strategies for transmitter receiver energy harvesting":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "online energy harvesting problem over an arbitrary directed acyclic graph network")
  Member "optimal power and rate allocation in the degraded gaussian relay channel with energy harvesting nodes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "energy harvesting systems with continuous energy and data arrivals the optimal offline and a heuristic online algorithms")
  Member "energy cooperation in energy harvesting communications":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "transmission delay minimization in wireless powered communication systems")
  Member "throughput maximization for the gaussian relay channel with energy harvesting constraints":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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-5 (induced by source paper "single or multiple frames content delivery for robust and secure communication in energy and spectrum efficient 5g networks")
  Member "optimal transmission policies for energy harvesting two hop networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "distributed user association in energy harvesting small cell networks a probabilistic bandit model")
  Member "broadcasting with an energy harvesting rechargeable transmitter":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "age of information minimization for an energy harvesting source with updating erasures with and without feedback")
  Member "two hop communication with energy harvesting":
    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)