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 "throughput analysis and optimization of wireless powered multiple antenna full duplex relay systems"):
  Abstract: We consider a full-duplex (FD) decode-and-forward system in which the time-switching protocol is employed by the multiantenna relay to receive energy from the source and transmit information to the destination. The instantaneous throughput is maximized by optimizing receive and transmit beamformers at the relay and the time-split parameter. We study both optimum and suboptimum schemes. The reformulated problem in the optimum scheme achieves closed-form solutions in terms of transmit beamformer for some scenarios. In other scenarios, the optimization problem is formulated as a semidefinite relaxation problem and a rank-one optimum solution is always guaranteed. In the suboptimum schemes, the beamformers are obtained using maximum ratio combining, zero-forcing, and maximum ratio transmission. When beamformers have closed-form solutions, the achievable instantaneous and delay-constrained throughput are analytically characterized. Our results reveal that beamforming increases both the energy harvesting and loop interference suppression capabilities at the FD relay. Moreover, simulation results demonstrate that the choice of the linear processing scheme as well as the time-split plays a critical role in determining the FD gains.

Includes members:
  Member "wireless powered relays in cooperative communications time switching relaying protocols and throughput analysis":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on maximizing information reliability in wireless powered cooperative networks")
  Member "wireless information and power transfer in relay systems with multiple antennas and interference":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on maximizing information reliability in wireless powered cooperative networks")
  Member "full duplex radio for uplink downlink wireless access with spatially random nodes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "transmission capacity of full duplex mimo ad hoc network with limited self interference cancellation")
  Member "harvest then cooperate wireless powered cooperative communications":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "relay selection scheduling and power control in wireless powered cooperative communication networks")
  Member "multipair full duplex relaying with massive arrays and linear processing":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "angle aware user cooperation for secure massive mimo in rician fading channel")
  Member "cutting last wires for mobile communication by microwave power transfer":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "wirelessly powered data aggregation for iot via over the air functional computation beamforming and power control")
  Member "optimal resource allocation in full duplex wireless powered communication network":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "transmission delay minimization in wireless powered communication systems")
  Member "low complexity end to end performance optimization in mimo full duplex relay systems":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "robust transceiver design for full duplex decode and forward relay assisted mimo systems")

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)