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 "online energy efficient packet scheduling for a common deadline with and without energy harvesting"):
  Abstract: The problem of online packet scheduling to minimize the required conventional grid energy for transmitting a fixed number of packets given a common deadline is considered. The total number of packets arriving within the deadline is known, but the packet arrival times are unknown, and can be arbitrary. The proposed algorithm tries to finish the transmission of each packet assuming all future packets are going to arrive at equal time intervals within the left-over time. The proposed online algorithm is shown to have competitive ratio that is logarithmic in the number of packet arrivals. The hybrid energy paradigm is also considered, where in addition to grid energy, energy is also available via extraction from renewable sources. The objective here is to minimize the grid energy use. A suitably modified version of the previous algorithm is also shown to have competitive ratio that is logarithmic in the number of packet arrivals.

Includes members:
  Member "online independent set beyond the worst case secretaries prophets and periods":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "robust algorithms for the secretary problem")
  Member "optimal power allocation for energy harvesting and power grid coexisting wireless communication systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "flexible functional split and power control for energy harvesting cloud radio access networks")
  Member "delay aware bs discontinuous transmission control and user scheduling for energy harvesting downlink coordinated mimo systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "minimum age of information in the internet of things with non uniform status packet sizes")
  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 "transmission with energy harvesting nodes in fading wireless channels optimal policies":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "closed form analysis of non linear age of information in status updates with an energy harvesting transmitter")
  Member "optimal packet scheduling on an energy harvesting broadcast link":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the energy and data storage management in energy harvesting wireless communications")
  Member "energy optimal transmission scheduling in wireless sensor networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "energy management for energy harvesting wireless sensors with adaptive retransmission")
  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)