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 offline and competitive online strategies for transmitter receiver energy harvesting"):
  Abstract: A joint transmitter–receiver energy harvesting model is considered, where both the transmitter and the receiver are powered by random (renewable) energy source. Given a fixed number of bits, the problem is to find the optimal transmission power profile at the transmitter and ON–OFF profile at the receiver to minimize the transmission time. With infinite capacity at both the transmitter and the receiver, the optimal offline and optimal online policies are derived. The optimal online policy is shown to be two-competitive in the arbitrary input case. With finite battery capacities at both ends, only random energy arrival sequence with given distribution is considered, for which an online policy with bounded expected competitive ratio is proposed.

Includes members:
  Member "finite horizon optimal transmission policies for energy harvesting sensors":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "long term throughput and approximate capacity of transmitter receiver energy harvesting channel with fading")
  Member "long term throughput and approximate capacity of transmitter receiver energy harvesting channel with fading":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on distributed power control for uncoordinated dual energy harvesting links performance bounds and near optimal policies")
  Member "near optimal energy control and approximate capacity of energy harvesting communication":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a maximin optimal online power control policy for energy harvesting communications")
  Member "competitive ratio analysis of online algorithms to minimize data transmission time in energy harvesting communication system":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "online energy harvesting problem over an arbitrary directed acyclic graph network")
  Member "optimal offline broadcast scheduling with an energy harvesting transmitter":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "finite horizon energy efficient scheduling with energy harvesting transmitters over fading channels")
  Member "transmission with energy harvesting nodes in fading wireless channels optimal policies":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "closed form analysis of non linear age of information in status updates with an energy harvesting transmitter")
  Member "optimum transmission policies for battery limited energy harvesting nodes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on the energy and data storage management in energy harvesting wireless communications")
  Member "optimal packet scheduling in an energy harvesting communication system":
    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)