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 "on distributed power control for uncoordinated dual energy harvesting links performance bounds and near optimal policies"):
  Abstract: In this paper, we consider a point-to-point link between an energy harvesting transmitter and receiver, where neither node has the information about the battery state or energy availability at the other node. We consider a model where data is successfully delivered only in slots where both nodes are active. Energy loss occurs whenever one node turns on while the other node is in sleep mode. In each slot, based on their own energy availability, the transmitter and receiver need to independently decide whether or not to turn on, with the aim of maximizing the long-term time-average throughput. We present an upper bound on the throughput achievable by analyzing a genie-aided system that has noncausal knowledge of the energy arrivals at both the nodes. Next, we propose an online policy requiring an occasional one-bit feedback whose throughput is within one bit of the upper bound, asymptotically in the battery size. In order to further reduce the feedback required, we propose a time-dilated version of the online policy. As the time dilation gets large, this policy does not require any feedback and achieves the upper bound asymptotically in the battery size. Inspired by this, we also propose a near-optimal fully uncoordinated policy. We use Monte Carlo simulations to validate our theoretical results and illustrate the performance of the proposed policies.

Includes members:
  Member "optimal offline and competitive online strategies for transmitter receiver energy harvesting":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "online energy harvesting problem over an arbitrary directed acyclic graph network")
  Member "optimal policies for wireless networks with energy harvesting transmitters and receivers effects of decoding costs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "joint energy and sinr coverage in spatially clustered rf powered iot network")
  Member "energy harvesting wireless communications a review of recent advances":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "analysis of d2d communication with rf energy harvesting and interference management")
  Member "outage minimization for a fading wireless link with energy harvesting transmitter and receiver":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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-5 (induced by source paper "energy management for energy harvesting wireless sensors with adaptive retransmission")
  Member "near optimal energy control and approximate capacity of energy harvesting communication":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a maximin optimal online power control policy for energy harvesting communications")
  Member "throughput optimal policies for energy harvesting wireless transmitters with non ideal circuit power":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a maximin optimal online power control policy for energy harvesting communications")
  Member "basic performance limits and tradeoffs in energy harvesting sensor nodes with finite data and energy storage":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "on the energy and data storage management in energy harvesting wireless communications")

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)