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 "relay control for full duplex relaying with wireless information and energy transfer"):
  Abstract: This study investigates wireless information and energy transfer for dual-hop amplify-and-forward full-duplex relaying systems. By forming energy efficiency (EE) maximization problem into a concave fractional program of transmission power, three relay control schemes are separately designed to enable energy harvesting and full-duplex information relaying. With Rician fading modeled residual self-interference channel, analytical expressions of outage probability and ergodic capacity are presented for the maximum relay, signal-to-interference-plus-noise-ratio (SINR) relay, and target relay. It has shown that EE maximization problem of the maximum relay is concave for time switching factor, so that bisection method has been applied to obtain the optimized value. By incorporating instantaneous channel information, the SINR relay with collateral time switching factor achieves an improved EE over the maximum relay in delay-limited and delay-tolerant transmissions. Without requiring channel information for the second-hop, the target relay ensures a competitive performance for outage probability, ergodic capacity, and EE. Comparing to the direct source-destination transmission, numerical results show that the proposed relaying scheme is beneficial in achieving a comparable EE for low-rate delay-limited transmission.

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 "full duplex mimo relaying powered by wireless energy transfer":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "distributed multi relay selection in accumulate then forward energy harvesting relay networks")
  Member "on the efficiency of far field wireless power transfer":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "cognitive wireless power transfer in the presence of reactive primary communication user")
  Member "joint power splitting and antenna selection in energy harvesting relay channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "throughput maximization in two hop df multiple relay network with simultaneous wireless information and power transfer")
  Member "wireless information and energy transfer for two hop non regenerative mimo ofdm relay networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "transmission delay minimization in wireless powered communication systems")
  Member "outage analysis and optimization for time switching based two way relaying with energy harvesting relay node":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "fog assisted multi user swipt networks local computing or offloading")
  Member "wireless information and energy transfer for decode and forward relying mimo ofdm networks":
    also connected through other hyperedges:
      (none)
  Member "simultaneous wireless information and power transfer in modern communication systems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "wirelessly powered sensor networks power allocation for channel estimation and energy beamforming")

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)