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 "charge then forward wireless powered communication for multiuser relay networks"):
  Abstract: This paper studies a relay-assisted wireless powered communication network (R-WPCN) consisting of multiple source-destination pairs and a hybrid relay node (HRN). We consider a "charge-then-forward" protocol at the HRN, in which the HRN with constant energy supply first acts as an energy transmitter to charge the sources, and then forwards the information from the sources to their destinations through time division multiple access (TDMA) or frequency division multiple access (FDMA). Processing costs at the wireless-powered sources are taken into account. Our goal is to maximize the sum-rate of all transmission pairs by jointly optimizing the time, frequency and power resources. The formulated optimization problems for both TDMA and FDMA are non-convex. For the TDMA scheme, by appropriate transformation, the problem is reformulated as a convex problem and be optimally solved. For the FDMA case, we find the asymptotically optimal solution in the dual domain. Furthermore, suboptimal algorithms are proposed for both schemes to tradeoff the complexity and performance. Finally, the simulation results validate the effectiveness of the proposed schemes.

Includes members:
  Member "joint power allocation and beamforming for energy efficient two way multi relay communications":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "energy efficiency fairness for multi pair wireless powered relaying systems")
  Member "power allocation for secure swipt systems with wireless powered cooperative jamming":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "energy efficiency of distributed antenna systems with wireless power transfer")
  Member "capacity of the two hop relay channel with wireless energy transfer from relay to source and energy transmission cost":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "capacity of a full duplex wirelessly powered communication system with self interference and processing cost")
  Member "multipair two way relay network with harvest then transmit users resolving pairwise uplink downlink coupling":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "angle aware user cooperation for secure massive mimo in rician fading channel")
  Member "artificial noise aided secrecy information and power transfer in ofdma systems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "energy efficiency of distributed antenna systems with wireless power transfer")
  Member "wireless powered communication opportunities and challenges":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "wirelessly powered sensor networks power allocation for channel estimation and energy beamforming")
  Member "wireless powered relays in cooperative communications time switching relaying protocols and throughput analysis":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on maximizing information reliability in wireless powered cooperative networks")
  Member "harvest then cooperate wireless powered cooperative communications":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "relay selection scheduling and power control in wireless powered cooperative communication 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)