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 "outage minimization for a fading wireless link with energy harvesting transmitter and receiver"):
  Abstract: This paper studies online power control policies for outage minimization in a fading wireless link with energy har- vesting transmitter and receiver. The outage occurs when either the transmitter or the receiver does not have enough energy, or the channel is in outage, where the transmitter only has the channel distribution information. Under infinite battery capac- ity and without retransmission, we prove that threshold-based power control policies are optimal. We thus propose disjoint/joint threshold-based policies with and without battery state sharing between the transmitter and receiver, respectively. We also analyze the impact of practical receiver detection and processing on the outage performance. When retransmission is considered, policy with linear power levels is adopted to adapt the power thresholds per retransmission. With finite battery capacity, a three dimen- sional finite state Markov chain is formulated to calculate the optimal parameters and corresponding performance of proposed policies. The energy arrival correlation between the transmitter and receiver is addressed for both finite and infinite battery cases. Numerical results show the impact of battery capacity, energy arrival correlation and detection cost on the outage performance of the proposed policies, as well as the tradeoff between the outage probability and the average transmission times.

Includes members:
  Member "spatial throughput of mobile ad hoc networks powered by energy harvesting":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "analysis of d2d communication with rf energy harvesting and interference management")
  Member "energy cooperation in energy harvesting communications":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "transmission delay minimization in wireless powered communication systems")
  Member "throughput maximization for the gaussian relay channel with energy harvesting constraints":
    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 "optimal power allocation for energy harvesting and power grid coexisting wireless communication systems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "flexible functional split and power control for energy harvesting cloud radio access networks")
  Member "throughput optimal policies for energy harvesting wireless transmitters with non ideal circuit power":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a maximin optimal online power control policy for energy harvesting communications")
  Member "optimal save then transmit protocol for energy harvesting wireless transmitters":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "mimo underlay cognitive radio optimized power allocation effective number of transmit antennas and harvest transmit tradeoff")
  Member "two hop communication with energy harvesting":
    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 "optimal energy allocation for wireless communications with energy harvesting constraints":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "optimal energy allocation and task offloading policy for wireless powered mobile edge computing systems")

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)