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 harvesting networks with general utility functions near optimal online policies"):
  Abstract: We consider online scheduling policies for single-user energy harvesting communication systems, where the goal is to characterize online policies that maximize the long term average utility, for some general concave and monotonically increasing utility function. In our setting, the transmitter relies on energy harvested from nature to send its messages to the receiver, and is equipped with a finite-sized battery to store its energy. Energy packets are independent and identically distributed (i.i.d.) over time slots, and are revealed causally to the transmitter. Only the average arrival rate is known a priori. We first characterize the optimal solution for the case of Bernoulli arrivals. Then, for general i.i.d. arrivals, we first show that fixed fraction policies [Shaviv-Ozgur] are within a constant multiplicative gap from the optimal solution for all energy arrivals and battery sizes. We then derive a set of sufficient conditions on the utility function to guarantee that fixed fraction policies are within a constant additive gap as well from the optimal solution.

Includes members:
  Member "finite horizon energy efficient scheduling with energy harvesting transmitters over fading channels":
    also connected through other hyperedges:
      (none)
  Member "online power control optimization for wireless transmission with energy harvesting and storage":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "online power allocation at energy harvesting transmitter for multiple receivers with and without individual rate constraints for oma and noma transmissions")
  Member "optimal offline and competitive online strategies for transmitter receiver energy harvesting":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "online energy harvesting problem over an arbitrary directed acyclic graph network")
  Member "optimal policies for wireless networks with energy harvesting transmitters and receivers effects of decoding costs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "joint energy and sinr coverage in spatially clustered rf powered iot network")
  Member "iterative dynamic water filling for fading multiple access channels with energy harvesting":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "design of an miso swipt aided code index modulated multi carrier m dcsk system for e health iot")
  Member "energy harvesting networks with energy cooperation procrastinating policies":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "real time transmission mechanism design for wireless iot sensors with energy harvesting under power saving mode")
  Member "universally near optimal online power control for energy harvesting nodes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a maximin optimal online power control policy for energy harvesting communications")
  Member "energy harvesting broadband communication systems with processing energy cost":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "flexible functional split and power control for energy harvesting cloud radio access networks")

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)