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 "distributed power splitting for swipt in relay interference channels using game theory"):
  Abstract: In this paper, we consider simultaneous wireless information and power transfer (SWIPT) in relay interference channels, where multiple source-destination pairs communicate through their dedicated energy harvesting relays. Each relay needs to split its received signal from sources into two streams: one for information forwarding and the other for energy harvesting. We develop a distributed power splitting framework using game theory to derive a profile of power splitting ratios for all relays that can achieve a good network-wide performance. Specifically, non-cooperative games are respectively formulated for pure amplify-and-forward (AF) and decode-and-forward (DF) networks, in which each link is modeled as a strategic player who aims to maximize its own achievable rate. The existence and uniqueness for the Nash equilibriums (NEs) of the formulated games are analyzed and a distributed algorithm with provable convergence to achieve the NEs is also developed. Subsequently, the developed framework is extended to the more general network setting with mixed AF and DF relays. All the theoretical analyses are validated by extensive numerical results. Simulation results show that the proposed game-theoretical approach can achieve a near-optimal network-wide performance on average, especially for the scenarios with relatively low and moderate interference.

Includes members:
  Member "power allocation strategies in energy harvesting wireless cooperative networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (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-2 (induced by source paper "relay selection scheduling and power control in wireless powered cooperative communication networks")
  Member "beamforming for miso interference channels with qos and rf energy transfer":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "specific absorption rate aware beamforming in miso downlink swipt systems")
  Member "cooperative energy harvesting networks with spatially random users":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a unified framework for non orthogonal multiple access")
  Member "simultaneous information and power transfer for broadband wireless systems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "transmission delay minimization in wireless powered communication systems")
  Member "wireless information and power transfer energy efficiency optimization in ofdma systems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the performance gain of noma over oma in uplink communication systems")
  Member "relaying protocols for wireless energy harvesting and information processing":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on maximizing information reliability in wireless powered cooperative networks")
  Member "wireless information and power transfer a dynamic power splitting approach":
    also connected through other hyperedges:
      - Hyperedge HE-8 (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)