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 wireless energy and information transfer in relay networks"):
  Abstract: This paper investigates the outage probability and the throughput of relay networks with wireless information and energy transfer where the relays harvest energy from the transmitted radio-frequency signal of the source. Considering different power consumption models, we derive the outage probability for both adaptive and non-adaptive power allocations at the relay. With a total energy consumption constraint at the source, we provide closed-form expressions for the optimal time sharing and power allocation between the source energy and information transfer signals as well as the optimal relay positioning such that the outage probability is minimized. Finally, we extend our analysis to multi-relay networks. We show that with perfect channel state information (CSI) available at the relays and $N$ relays the opportunistic relaying scheme achieves diversity order of $\frac{N+1}{2}$. Also, we analyze the opportunistic relaying with partial CSI where either the source-relay or the relay-destination CSI is provided at its corresponding transmit terminal, and prove that the relay selection based on the source-relay CSI outperforms the relay selection based on the relay-destination CSI, in terms of outage probability. The analytical and simulation results demonstrate the efficiency of wireless energy and information transfer systems in different conditions.

Includes members:
  Member "rf based energy harvesting in decode and forward relaying systems ergodic and outage capacities":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "relay selection scheduling and power control in wireless powered cooperative communication networks")
  Member "wireless powered relays in cooperative communications time switching relaying protocols and throughput analysis":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on maximizing information reliability in wireless powered cooperative networks")
  Member "relay selection in wireless powered cooperative networks with energy storage":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "common throughput maximization for uav enabled interference channel with wireless powered communications")
  Member "joint power splitting and antenna selection in energy harvesting relay channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "throughput maximization in two hop df multiple relay network with simultaneous wireless information and power transfer")
  Member "outage minimization for a fading wireless link with energy harvesting transmitter and receiver":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "swipt using hybrid arq over time varying channels")
  Member "harvest then cooperate wireless powered cooperative communications":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "relay selection scheduling and power control in wireless powered cooperative communication networks")
  Member "wireless powered cooperative communications via a hybrid relay":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "charge then forward wireless powered communication for multiuser relay networks")
  Member "wireless networks with rf energy harvesting a contemporary survey":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "wirelessly powered sensor networks power allocation for channel estimation and energy beamforming")

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)