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 "energy management for energy harvesting wireless sensors with adaptive retransmission"):
  Abstract: This paper analyzes the communication between two energy harvesting wireless sensor nodes. The nodes use automatic repeat request and forward error correction mechanism for the error control. The random nature of available energy and arrivals of harvested energy may induce interruption to the signal sampling and decoding operations. We propose a selective sampling scheme where the length of the transmitted packet to be sampled depends on the available energy at the receiver. The receiver performs the decoding when complete samples of the packet are available. The selective sampling information bits are piggybacked on the automatic repeat request messages for the transmitter use. This way, the receiver node manages more efficiently its energy use. Besides, we present the partially observable Markov decision process formulation, which minimizes the long-term average pairwise error probability and optimizes the transmit power. Optimal and suboptimal power assignment strategies are introduced for retransmissions, which are adapted to the selective sampling and channel state information. With finite battery size and fixed power assignment policy, an analytical expression for the average packet drop probability is derived. Numerical simulations show the performance gain of the proposed scheme with power assignment strategy over the conventional scheme.

Includes members:
  Member "outage minimization for a fading wireless link with energy harvesting transmitter and receiver":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "swipt using hybrid arq over time varying channels")
  Member "long term throughput and approximate capacity of transmitter receiver energy harvesting channel with fading":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on distributed power control for uncoordinated dual energy harvesting links performance bounds and near optimal policies")
  Member "throughput optimal policies for energy harvesting wireless transmitters with non ideal circuit power":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a maximin optimal online power control policy for energy harvesting communications")
  Member "transmission with energy harvesting nodes in fading wireless channels optimal policies":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "closed form analysis of non linear age of information in status updates with an energy harvesting transmitter")
  Member "towards a communication theoretic understanding of system level power consumption":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "energy efficient beam coordination strategies with rate dependent processing power")
  Member "energy optimal transmission scheduling in wireless sensor networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "online energy efficient packet scheduling for a common deadline with and without energy harvesting")
  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")

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)