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 "power splitting for full duplex relay with wireless information and power transfer"):
  Abstract: This paper investigates power splitting for full-duplex relay networks with wireless information and energy transfer. By applying power splitting as a relay transceiver architecture, the full duplex information relaying can be powered by energy harvested from the source-emitted radio frequency signal. In order to minimize outage probability, power splitting ratios have been dynamically optimized according to full channel state information (CSI) and partial CSI, respectively. Under strong loop interference, the proposed full CSI-based and partial CSI-based power splitting schemes achieve the better outage performance than the fixed power splitting scheme, whereas the partial CSI-based power splitting scheme can ensure competitive outage performance without requiring CSI of the second-hop link. It is also observed that the worst outage performance is achieved when the relay is located midway between the source and destination, whereas the outage performance of partial CSI-based power splitting scheme approaches that of full CSI-based scheme when the relay is placed close to the destination.

Includes members:
  Member "distributed power splitting for swipt in relay interference channels using game theory":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "rf based energy harvesting in decode and forward relaying systems ergodic and outage capacities")
  Member "dynamic power splitting policies for af relay networks with wireless energy harvesting":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "interference alignment with power splitting relays in multi user multi relay networks")
  Member "joint power splitting and antenna selection in energy harvesting relay channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "throughput maximization in two hop df multiple relay network with simultaneous wireless information and power transfer")
  Member "simultaneous wireless information and power transfer in modern communication systems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "wirelessly powered sensor networks power allocation for channel estimation and energy beamforming")
  Member "power allocation strategies in energy harvesting wireless cooperative networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on maximizing information reliability in wireless powered cooperative networks")
  Member "wireless information and power transfer with full duplex relaying":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on maximizing information reliability in wireless powered cooperative networks")
  Member "energy efficient resource allocation in multiuser ofdm systems with wireless information and power transfer":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "artificial noise aided secrecy information and power transfer in ofdma systems")
  Member "throughput maximization for the gaussian relay channel with energy harvesting constraints":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "timely updates in energy harvesting two hop networks offline and online policies")

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)