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: "optimal signaling of miso full duplex two way wireless channel"
  Abstract: We model the self-interference in a multiple input single output (MISO) full-duplex two-way channel and evaluate the achievable rate region. We formulate the boundary of the achievable rate region termed as the Pareto boundary by a family of coupled, non-convex optimization problems. Our main contribution is decoupling and reformulating the original non-convex optimization problems to a family of convex semidefinite programming problems. 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.

Connected through hyperedge HE-1 (induced by source paper "achievable sum rates of half and full duplex bidirectional ofdm communication links"):
  with members:
    - "design and characterization of a full duplex multiantenna system for wifi networks"
    - "rate gain region and design tradeoffs for full duplex wireless communications"
    - "in band full duplex wireless challenges and opportunities"
    - "understanding the impact of phase noise on active cancellation in wireless full duplex"
    - "experiment driven characterization of full duplex wireless systems"
    - "full duplex bidirectional mimo achievable rates under limited dynamic range"

Connected through hyperedge HE-2 (induced by source paper "signaling design of two way mimo full duplex channel optimality under imperfect transmit front end chain"):
  with members:
    - "energy efficient power control a look at 5g wireless technologies"
    - "hardware impairments aware transceiver for full duplex massive mimo relaying"
    - "coalitional games for transmitter cooperation in mimo multiple access channels"
    - "massive mimo systems with non ideal hardware energy efficiency estimation and capacity limits"
    - "understanding the impact of phase noise on active cancellation in wireless full duplex"
    - "experiment driven characterization of full duplex wireless systems"
    - "the capacity of mimo channels with per antenna power constraint"
    - "optimal beamforming in interference networks with perfect local channel information"

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)