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: "signaling design of two way mimo full duplex channel optimality under imperfect transmit front end chain"
  Abstract: We derive the optimal signaling for a multiple input multiple output (MIMO) full-duplex two-way channel under the imperfect transmit front-end chain. We characterize the two-way rates of the channel by using a game-theoretical approach, where we focus on the Pareto boundary of the achievable rate region and Nash equilibia (NE). For a MISO full-duplex two-way channel, we prove that beamforming is an optimal transmission strategy which can achieve any point on the Pareto boundary. Furthermore, we present a closed-form expression for the optimal beamforming weights. In our numerical examples we quantify gains in the achievable rates of the proposed beamforming over the zero-forcing beamforming. For a general MIMO full-duplex channel, we establish the existence of NE and present a condition for the uniqueness of NE. We then propose an iterative water-filling algorithm which is capable of reaching NE. Through simulations the threshold of the self-interference level is found, below which the full-duplex NE outperforms the half-duplex TDMA.

Connected through hyperedge HE-1 (induced by source paper "full duplex transmission optimization for bi directional mimo links with qos guarantees"):
  with members:
    - "hardware impairments aware transceiver design for full duplex amplify and forward mimo relaying"
    - "joint design of multi tap analog cancellation and digital beamforming for reduced complexity full duplex mimo systems"
    - "advanced coordinated beamforming for the downlink of future lte cellular networks"
    - "joint beamforming optimization and power control for full duplex mimo two way relay channel"
    - "reference receiver based digital self interference cancellation in mimo full duplex transceivers"
    - "on the outage probability of the full duplex interference limited relay channel"
    - "full duplex mobile device pushing the limits"
    - "in band full duplex wireless challenges and opportunities"

Connected through hyperedge HE-2 (induced by source paper "hardware impairments aware transceiver design for bidirectional full duplex mimo ofdm systems"):
  with members:
    - "hardware impairments aware transceiver design for full duplex amplify and forward mimo relaying"
    - "optimal joint power and subcarrier allocation for full duplex multicarrier non orthogonal multiple access systems"
    - "hardware impairments aware transceiver for full duplex massive mimo relaying"
    - "design and characterization of a full duplex multiantenna system for wifi networks"
    - "in band full duplex wireless challenges and opportunities"
    - "experiment driven characterization of full duplex wireless systems"
    - "full duplex bidirectional mimo achievable rates under limited dynamic range"

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)