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 "power allocation and transmitter switching for broadcasting with multiple energy harvesting transmitters"):
  Abstract: With the advancement of battery technology, energy harvesting communication systems attracted great research attention in recent years. However, energy harvesting communication systems with multiple transmitters and multiple receivers have not been considered yet. In this paper, the problem of broadcasting in a communication system with multiple energy harvesting transmitters and multiple receivers is studied. First, regarding the transmitters as a 'hole transmitter' [1], the optimal total transmission power is obtained and the optimal power allocation policy in [2] is extended to our system setup, with the aim of minimizing the transmission completion time. Then, a simpler power allocation policy is developed to allocate the optimal total transmission power to the data transmissions. As transmitter switching can provide flexibility and robustness to an energy harvesting communication system, especially when a transmitter is broken or the energy harvested by a transmitter is insufficient, a transmitter switching policy is further developed to choose a suitable transmitter to work whenever necessary. The results show that the proposed power allocation policy performs close to the optimal one and outperforms some heuristic ones in terms of transmission completion time. Besides, the proposed transmitter switching policy outperforms some heuristic ones in terms of number of switches.

Includes members:
  Member "geometric projection based switching policy for multiple energy harvesting transmitters":
    also connected through other hyperedges:
      (none)
  Member "energy cooperation in energy harvesting communications":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "transmission delay minimization in wireless powered communication systems")
  Member "throughput maximization for the gaussian relay channel with energy harvesting constraints":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "timely updates in energy harvesting two hop networks offline and online policies")
  Member "a learning theoretic approach to energy harvesting communication system optimization":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (induced by source paper "a maximin optimal online power control policy for energy harvesting communications")
  Member "energy management policies for energy neutral source channel coding":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "stochastic routing and scheduling policies for energy harvesting communication networks")
  Member "optimal save then transmit protocol for energy harvesting wireless transmitters":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "mimo underlay cognitive radio optimized power allocation effective number of transmit antennas and harvest transmit tradeoff")
  Member "broadcasting with an energy harvesting rechargeable transmitter":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "age of information minimization for an energy harvesting source with updating erasures with and without feedback")

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)