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 "an adaptive transmission protocol for wireless powered cooperative communications"):
  Abstract: In this paper, we consider a wireless-powered cooperative communication network, which consists of one hybrid access point (AP), one source and one relay to assist information transmission. Unlike conventional cooperative networks, the source and relay are assumed to have no embedded energy supplies in the considered system. Hence, they need to first harvest energy from the radio-frequency (RF) signals radiated by the AP in the downlink (DL) before information transmission in the uplink (UL). Inspired by the recently proposed harvest-then-transmit (HTT) and harvest-then-cooperate (HTC) protocols, we develop a new adaptive transmission (AT) protocol. In the proposed protocol, at the beginning of each transmission block, the AP charges the source. AP and source then perform channel estimation to acquire the channel state information (CSI) between them. Based on the CSI estimate, the AP adaptively chooses the source to perform UL information transmission either directly or cooperatively with the relay. We derive an approximate closed-form expression for the average throughput of the proposed AT protocol over Nakagami-m fading channels. The analysis is then verified by Monte Carlo simulations. Results show that the proposed AT protocol considerably outperforms both the HTT and HTC protocols.

Includes members:
  Member "harvest then cooperate wireless powered cooperative communications":
    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 cooperative communications via a hybrid relay":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "charge then forward wireless powered communication for multiuser relay networks")
  Member "user cooperation in wireless powered communication networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "learning and fairness in energy harvesting a maximin multi armed bandits approach")
  Member "throughput maximization in wireless powered communication networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on maximizing information reliability in wireless powered cooperative networks")
  Member "relaying protocols for wireless energy harvesting and information processing":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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.IT(Information Theory)