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 "finite horizon energy efficient scheduling with energy harvesting transmitters over fading channels"):
  Abstract: In this paper, energy-efficient transmission schemes achieving maximal throughput over a finite time interval are studied in a problem setting including energy harvests, data arrivals and channel variation. The goal is to express the offline optimal policy in a way that facilitates a good online solution. We express any throughput maximizing energy efficient offline schedule (EE-TM-OFF) explicitly in terms of water levels. This allows per-slot real-time evaluation of transmit power and rate decisions, using estimates of the associated offline water levels. To compute the online power level, we construct a stochastic dynamic program that incorporates the offline optimal solution as a stochastic process. We introduce the "Immediate Fill" metric which provides a lower bound on the efficiency of any online policy with respect to the corresponding optimal offline solution. The online algorithms obtained this way exhibit performance close to the offline optimal, not only in the long run but also in short problem horizons, deeming them suitable for practical implementations.

Includes members:
  Member "channel sensing and communication over a time correlated channel with an energy harvesting transmitter":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "communication over a time correlated channel with an energy harvesting transmitter")
  Member "a general utility optimization framework for energy harvesting based wireless communications":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "cross layer scheduling and beamforming in smart grid powered cellular networks with heterogeneous energy coordination")
  Member "universally near optimal online power control for energy harvesting nodes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a maximin optimal online power control policy for energy harvesting communications")
  Member "finite horizon online lazy scheduling with energy harvesting transmitters over fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "age minimal transmission for energy harvesting sensors with finite batteries online policies")
  Member "a learning theoretic approach to energy harvesting communication system optimization":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a survey on machine learning based performance improvement of wireless networks phy mac and network layer")
  Member "throughput maximization for an energy harvesting communication system with processing cost":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "online policies for throughput maximization of energy constrained wireless powered communication systems")
  Member "optimal energy allocation for wireless communications with energy harvesting constraints":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "optimal energy allocation and task offloading policy for wireless powered mobile edge computing systems")
  Member "optimal offline broadcast scheduling with an energy harvesting transmitter":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "optimal offline and competitive online strategies for transmitter receiver energy harvesting")

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)