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 "geometric projection based switching policy for multiple energy harvesting transmitters"):
  Abstract: Transmitter switching can provide resiliency and robustness to a communication system with multiple energy harvesting transmitters. However, excessive transmitter switching will bring heavy control overhead. In this paper, a geometric projection-based transmitter switching policy is proposed for a communication system with multiple energy harvesting transmitters and one receiver, which can reduce the number of switches. The results show that the proposed transmitter switching policy outperforms several heuristic ones.

Includes members:
  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 "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 "broadcasting with an energy harvesting rechargeable transmitter":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (induced by source paper "age minimal online policies for energy harvesting sensors with random battery recharges")
  Member "a general framework for the optimization of energy harvesting communication systems with battery imperfections":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the energy and data storage management in energy harvesting wireless communications")
  Member "transmission with energy harvesting nodes in fading wireless channels optimal policies":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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-7 (induced by source paper "on the energy and data storage management in energy harvesting wireless communications")
  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)