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 "event trigger based robust optimal control for energy harvesting transmitter"):
  Abstract: This paper studies an online algorithm for an energy harvesting transmitter, where the transmission (completion) time is considered as the system performance. Unlike the existing online algorithms which more or less require the knowledge on the future behavior of the energy-harvesting rate, we consider a practical but significantly more challenging scenario where the energy-harvesting rate is assumed to be totally unknown. Our design is formulated as a robust-optimal control problem which aims to optimize the worst-case performance. The transmit power is designed only based on the current battery energy level and the data queue length directly monitored by the transmitter itself. Specifically, we apply an event-trigger approach in which the transmitter continuously monitors the battery energy and triggers an event when a significant change occurs. Once an event is triggered, the transmit power is updated according to the solution to the robust-optimal control problem, which is given in a simple analytic form. We present numerical results on the transmission time achieved by the proposed design and demonstrate its robust-optimality.

Includes members:
  Member "closed form delay optimal power control for energy harvesting wireless system with finite energy storage":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "non asymptotic achievable rates for gaussian energy harvesting channels best effort and save and transmit")
  Member "a learning theoretic approach to energy harvesting communication system optimization":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a survey on machine learning based performance improvement of wireless networks phy mac and network layer")
  Member "on the delay throughput tradeoff in distributed wireless networks":
    also connected through other hyperedges:
      (none)
  Member "energy efficient relaying over multiple slots with causal csi":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "power and load coupling in cellular networks for energy optimization")
  Member "broadcasting with an energy harvesting rechargeable transmitter":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "age of information minimization for an energy harvesting source with updating erasures with and without feedback")
  Member "sum rate optimal power policies for energy harvesting transmitters in an interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "age minimal online policies for energy harvesting sensors with random battery recharges")
  Member "optimal energy allocation for wireless communications with energy harvesting constraints":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "optimal energy allocation and task offloading policy for wireless powered mobile edge computing systems")
  Member "competitive ratio analysis of online algorithms to minimize data transmission time in energy harvesting communication system":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "online energy harvesting problem over an arbitrary directed acyclic graph network")

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)