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 "swipt using hybrid arq over time varying channels"):
  Abstract: We consider a class of wireless powered devices employing hybrid automatic repeat request to ensure reliable end-to-end communications over a two-state time-varying channel. A receiver, with no power source, relies on the energy transferred by a simultaneous wireless information and power transfer enabled transmitter to  receive  and  decode  information. Under the two-state channel model, information is received at two different rates while it is only possible to harvest energy in one of the states. The receiver aims to decode its messages with minimum expected number of re-transmissions. Dynamic and continuous nature of the problem motivated us to use a novel Markovian framework to bypass the complexities plaguing the conventional approaches such as Markov decision process. Using the theory of absorbing Markov chains, we show that there exists an optimal policy utilizing the incoming RF signal solely to harvest energy or to accumulate mutual information. Hence, we convert the original problem with continuous action and state space into an equivalent one with discrete state and action space. For independent and identically distributed channels, we prove the optimality of a simple-to-implement  harvest-first-store-later  type policy. However, for time-correlated channels, we demonstrate that statistical knowledge of the channel may significantly improve the performance over such policies.

Includes members:
  Member "channel sensing and communication over a time correlated channel with an energy harvesting transmitter":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "communication over a time correlated channel with an energy harvesting transmitter")
  Member "energy management for energy harvesting wireless sensors with adaptive retransmission":
    also connected through other hyperedges:
      (none)
  Member "on distributed power control for uncoordinated dual energy harvesting links performance bounds and near optimal policies":
    also connected through other hyperedges:
      (none)
  Member "on optimal policies in full duplex wireless powered communication networks":
    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 "arq with adaptive feedback for energy harvesting receivers":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "rate control for wireless powered communication network with reliability and delay constraints")
  Member "communications and signals design for wireless power transmission":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "wirelessly powered sensor networks power allocation for channel estimation and energy beamforming")
  Member "optimal policies for wireless networks with energy harvesting transmitters and receivers effects of decoding costs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "joint energy and sinr coverage in spatially clustered rf powered iot network")
  Member "wireless powered relays in cooperative communications time switching relaying protocols and throughput analysis":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on maximizing information reliability in wireless powered cooperative networks")

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.NI(Networking and Internet Architecture)