human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "full duplex mimo relaying powered by wireless energy transfer"
  Abstract: We consider a full-duplex decode-and-forward system, where the wirelessly powered relay employs the time-switching protocol to receive power from the source and then transmit information to the destination. It is assumed that the relay node is equipped with two sets of antennas to enable full-duplex communications. Three different interference mitigation schemes are studied, namely, 1) optimal 2) zero-forcing and 3) maximum ratio combining/maximum ratio transmission. We develop new outage probability expressions to investigate delay-constrained transmission throughput of these schemes. Our analysis show interesting performance comparisons of the considered precoding schemes for different system and link parameters.

Connected through hyperedge HE-1 (induced by source paper "distributed multi relay selection in accumulate then forward energy harvesting relay networks"):
  with members:
    - "wireless powered communication opportunities and challenges"
    - "wireless powered relays in cooperative communications time switching relaying protocols and throughput analysis"
    - "relay selection in wireless powered cooperative networks with energy storage"
    - "distributed power splitting for swipt in relay interference channels using game theory"
    - "wireless powered communications performance analysis and optimization"
    - "joint power splitting and antenna selection in energy harvesting relay channels"
    - "wireless information and energy transfer for two hop non regenerative mimo ofdm relay networks"
    - "wireless information and power transfer in relay systems with multiple antennas and interference"

Connected through hyperedge HE-2 (induced by source paper "amplify and forward full duplex relay with power splitting based swipt"):
  with members:
    - "distributed power splitting for swipt in relay interference channels using game theory"
    - "dynamic power splitting policies for af relay networks with wireless energy harvesting"
    - "joint power splitting and antenna selection in energy harvesting relay channels"
    - "simultaneous wireless information and power transfer in modern communication systems"
    - "power allocation strategies in energy harvesting wireless cooperative networks"
    - "optimized training design for wireless energy transfer"
    - "wireless information and power transfer with full duplex relaying"
    - "throughput maximization for the gaussian relay channel with energy harvesting constraints"

Connected through hyperedge HE-3 (induced by source paper "relay control for full duplex relaying with wireless information and energy transfer"):
  with members:
    - "distributed power splitting for swipt in relay interference channels using game theory"
    - "on the efficiency of far field wireless power transfer"
    - "joint power splitting and antenna selection in energy harvesting relay channels"
    - "wireless information and energy transfer for two hop non regenerative mimo ofdm relay networks"
    - "outage analysis and optimization for time switching based two way relaying with energy harvesting relay node"
    - "wireless information and energy transfer for decode and forward relying mimo ofdm networks"
    - "simultaneous wireless information and power transfer in modern communication systems"
    - "full duplex wireless powered relay with self energy recycling"

Question: Please tell me which class the center node 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)