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 "a maximin optimal online power control policy for energy harvesting communications"):
  Abstract: A general theory of online power control for discrete-time battery limited energy harvesting communications is developed, which leads to, among other things, an explicit characterization of a maximin optimal policy. This policy only requires the knowledge of the (effective) mean of the energy arrival process and maximizes the minimum asymptotic expected average reward (with the minimization taken over all energy arrival distributions of a given (effective) mean). Moreover, it is universally near optimal and has strictly better worst-case performance as compared to the fixed fraction policy proposed by Shaviv and Ozgur when the objective is to maximize the throughput over an additive white Gaussian noise channel. The competitiveness of this maximin optimal policy is also demonstrated via numerical examples.

Includes members:
  Member "the optimal power control policy for an energy harvesting system with look ahead bernoulli energy arrivals":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the optimality of the greedy policy for battery limited energy harvesting communications")
  Member "on the optimality of the greedy policy for battery limited energy harvesting communications":
    also connected through other hyperedges:
      (none)
  Member "energy harvesting wireless communications a review of recent advances":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "analysis of d2d communication with rf energy harvesting and interference management")
  Member "universally near optimal online power control for energy harvesting nodes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the optimality of the greedy policy for battery limited energy harvesting communications")
  Member "near optimal energy control and approximate capacity of energy harvesting communication":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the optimality of the greedy policy for battery limited energy harvesting communications")
  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 optimal policies for energy harvesting wireless transmitters with non ideal circuit power":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "spatial and temporal management of cellular hetnets with multiple solar powered drones")
  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")

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)