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 "energy recycling full duplex radios for next generation networks"):
  Abstract: In this work, a novel energy-recycling single-antenna full-duplex (FD) radio is designed, in which a new three-port element including a power divider and an energy harvester is added between the circulator and the receiver (RX) chain. The presence of this new element brings advantages over the state of the art in terms of both spectral efficiency and energy consumption. In particular, it provides the means of performing both an arbitrary attenuation of the incoming signal, which in turn increases the effectiveness of the state-of-the-art self-interference cancellation strategies subsequently adopted in the RX chain, and the recycling of a non-negligible portion of the energy leaked through the nonideal circulator. The performance of this architecture is analyzed in a practically relevant four-node scenario in which two nodes operate in FD and two nodes in half-duplex (HD). Analytical approximations are derived for both the achievable rates of the transmissions performed by the FD and HD radios and the energy recycled by the FD radios. The accuracy of these derivations is confirmed by numerical simulations. Quantitatively, achievable rate gains up to 40% over the state-of-the-art alternatives, in the considered scenario, are highlighted. Furthermore, up to 50% of the leaked energy at the circulator, i.e., 5% of the energy of the transmitted signal, can be recycled.

Includes members:
  Member "all digital self interference cancellation technique for full duplex systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "state space adaptive nonlinear self interference cancellation for full duplex communication")
  Member "multipair full duplex relaying with massive arrays and linear processing":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "angle aware user cooperation for secure massive mimo in rician fading channel")
  Member "reference receiver based digital self interference cancellation in mimo full duplex transceivers":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "full duplex transmission optimization for bi directional mimo links with qos guarantees")
  Member "low complexity end to end performance optimization in mimo full duplex relay systems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "robust transceiver design for full duplex decode and forward relay assisted mimo systems")
  Member "full duplex wireless powered relay with self energy recycling":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "charge then forward wireless powered communication for multiuser relay networks")
  Member "widely linear digital self interference cancellation in direct conversion full duplex transceiver":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "full duplex hybrid a d beamforming with reduced complexity multi tap analog cancellation")
  Member "in band full duplex wireless challenges and opportunities":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "resource allocation for irs assisted full duplex cognitive radio systems")
  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)