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 "relaying strategies for wireless powered mimo relay networks"):
  Abstract: This paper investigates relaying schemes in an amplify-and-forward multiple-input multiple-output relay network, where an energy-constrained relay harvests wireless power from the source information flow and can be further aided by an energy flow (EF) in the form of a wireless power transfer at the destination. However, the joint optimization of the relay matrix and the source precoder for the energy-flow-assisted (EFA) and the non-EFA (NEFA) schemes is intractable. The original rate maximization problem is transformed into an equivalent weighted mean square error minimization problem and optimized iteratively, where the global optimum of the nonconvex source precoder subproblem is achieved by semidefinite relaxation and rank reduction. The iterative algorithm finally converges. Then, the simplified EFA and NEFA schemes are proposed based on channel diagonalization, such that the matrices optimizations can be simplified to power optimizations. Closed-form solutions can be achieved. Simulation results reveal that the EFA schemes can outperform the NEFA schemes. Additionally, deploying more antennas at the relay increases the dimension of the signal space at the relay. Exploiting the additional dimension, the EF leakage in the information detecting block can be nearly separated from the information signal, such that the EF leakage can be amplified with a small coefficient.

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 "joint wireless information and power transfer for an autonomous multiple antenna relay system":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "wireless powered dual hop multi antenna relaying systems impact of csi and antenna correlation")
  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 "joint wireless information and power transfer in a three node autonomous mimo relay network":
    also connected through other hyperedges:
      (none)
  Member "joint resource optimization for multicell networks with wireless energy harvesting relays":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "optimization of a power splitting protocol for two way multiple energy harvesting relay system")
  Member "user cooperation in wireless powered communication networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "learning and fairness in energy harvesting a maximin multi armed bandits approach")
  Member "power allocation strategies in energy harvesting wireless cooperative networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on maximizing information reliability in wireless powered cooperative networks")
  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")

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)