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 policy for cooperative transmission with energy harvesting and battery operated sensor nodes"):
  Abstract: In this paper, we consider a scenario where one energy harvesting and one battery operated sensor cooperatively transmit a common message to a distant base station. The goal is to find the jointly optimal transmission (power allocation) policy which maximizes the total throughput for a given deadline. First, we address the case in which the storage capacity of the energy harvesting sensor is infinite. In this context, we identify the necessary conditions for such optimal transmission policy. On their basis, we first show that the problem is convex. Then we go one step beyond and prove that (i) the optimal power allocation for the energy harvesting sensor can be computed independently; and (ii) it unequivocally determines (and allows to compute) that of the battery operated one. Finally, we generalize the analysis for the case of finite storage capacity. Performance is assessed by means of computer simulations. Particular attention is paid to the impact of finite storage capacity and long-term battery degradation on the achievable throughput.

Includes members:
  Member "broadcasting with an energy harvesting rechargeable transmitter":
    also connected through other hyperedges:
      - Hyperedge HE-1 (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-2 (induced by source paper "age minimal online policies for energy harvesting sensors with random battery recharges")
  Member "two hop communication with energy harvesting":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "timely updates in energy harvesting two hop networks offline and online policies")
  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 packet scheduling in an energy harvesting communication system":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "timely updates in energy harvesting two hop networks offline and online policies")
  Member "distributed transmit beamforming using feedback control":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "low complexity random rotation based schemes for intelligent reflecting surfaces")

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)