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 "performance analysis for energy harvesting communication protocols with fixed rate transmission"):
  Abstract: Energy harvesting (EH) has emerged as a promising technique for Green Communications and it is a novel technique to prolong the lifetime of the wireless networks with replenishable nodes. In this study, the authors consider the energy shortage analysis of fixed rate transmission in communication systems with EH nodes. First, the authors study the finite-horizon transmission and provide the general formula for the energy shortage probability (ESP). The authors also give some examples as benchmarks. Then, the authors continue to derive a closed-form expression for infinite-horizon transmission, which is a lower bound for the ESP of any finite-horizon transmission. These results are proposed for both Additive White Gaussian Noise (AWGN) and fading channels. Moreover, the authors show that even under random energy arrival, one can transmit at a fixed rate equal to capacity in the AWGN channels with negligible aggregate shortage time. The authors achieve this result using our practical transmission schemes, proposed for finite-horizon. Also, comprehensive numerical simulations are performed in AWGN and fading channels with no Channel State Information (CSI) available at the transmitter, which corroborate our theoretical findings. Furthermore, the authors improve the performance of our transmission schemes in the fading channel with no CSI at the transmitter by optimising the transmission initiation threshold.

Includes members:
  Member "adaptive mode selection for bidirectional relay networks fixed rate transmission":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a delay constrained protocol with adaptive mode selection for bidirectional relay networks")
  Member "optimal save then transmit protocol for energy harvesting wireless transmitters":
    also connected through other hyperedges:
      - Hyperedge HE-2 (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-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 "two hop communication with energy harvesting":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "timely updates in energy harvesting two hop networks offline and online policies")
  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 "mimo broadcasting for simultaneous wireless information and power transfer":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "energy efficient hybrid precoding design for integrated multicast unicast millimeter wave communications with swipt")
  Member "information capacity of energy harvesting sensor nodes":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "resilient cyberphysical systems and their application drivers a technology roadmap")

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)