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 "resource allocation in wireless powered relay networks a bargaining game approach"):
  Abstract: Simultaneously information and power transfer in mobile relay networks have recently emerged, where the relay can harvest the radio frequency (RF) energy and then use this energy for data forwarding and system operation. Most of the previous works do not consider that the relay may have its own objectives, such as using the harvested energy for its own transmission instead of maximizing transmission of the network. Therefore, in this paper, we propose a Nash bargaining approach to balance the information transmission efficiency of source-destination pairs and the harvested energy of the relay in a wireless powered relay network with multiple source-destination pairs and one relay. We analyze and prove that the Nash bargaining problem has several desirable properties such as the discreteness and quasi-concavity, when it is decomposed into three sub-problems: the energy transmission power optimization, the power control for data transmission and the time division between energy transmission and data transmission. Based on the theoretical analysis, we propose an alternating power control and time division algorithm to find a suboptimal solution. Simulation results clearly show and demonstrate the properties of the problem and the convergence of our algorithm.

Includes members:
  Member "joint power splitting and antenna selection in energy harvesting relay channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "throughput maximization in two hop df multiple relay network with simultaneous wireless information and power transfer")
  Member "noncoherent relaying in energy harvesting communication systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "performance analysis of swipt relaying systems in the presence of impulsive noise")
  Member "joint resource optimization for multicell networks with wireless energy harvesting relays":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimization of a power splitting protocol for two way multiple energy harvesting relay system")
  Member "wireless charger networking for mobile devices fundamentals standards and applications":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "earning maximization with quality of charging service guarantee for iot devices")
  Member "wireless networks with rf energy harvesting a contemporary survey":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "wirelessly powered sensor networks power allocation for channel estimation and energy beamforming")
  Member "full duplex wireless powered relay with self energy recycling":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "charge then forward wireless powered communication for multiuser relay networks")
  Member "power allocation strategies in energy harvesting wireless cooperative networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on maximizing information reliability in wireless powered cooperative networks")
  Member "simultaneous information and energy transfer in large scale networks with without relaying":
    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)