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 "optimal transmission policies for energy harvesting two hop networks"):
  Abstract: In this paper, a two-hop communication system with energy harvesting nodes is considered. Unlike battery powered wireless nodes, both the source and the relay are able to harvest energy from environment during communication, therefore, both data and energy causality over the two hops need to be considered. Assuming both nodes know the harvested energies in advance, properties of optimal transmission policies to maximize the delivered data by a given deadline are identified. Using these properties, optimal power allocation and transmission schedule for the case in which both nodes harvest two energy packets is developed.

Includes members:
  Member "throughput maximization for the gaussian relay channel with energy harvesting constraints":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "timely updates in energy harvesting two hop networks offline and online policies")
  Member "two hop communication with energy harvesting":
    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 "optimal energy allocation for wireless communications with energy harvesting constraints":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimal energy allocation and task offloading policy for wireless powered mobile edge computing systems")
  Member "a general framework for the optimization of energy harvesting communication systems with battery imperfections":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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-5 (induced by source paper "closed form analysis of non linear age of information in status updates with an energy harvesting transmitter")
  Member "optimum transmission policies for battery limited energy harvesting nodes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the energy and data storage management in energy harvesting wireless communications")
  Member "optimal energy management policies for energy harvesting sensor nodes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "achievable rate of multi antenna wsrns with eh constraint in the presence of a jammer")

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)