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: "mimo two way relay channel diversity multiplexing tradeoff analysis"
  Abstract: A multi-hop two-way relay channel is considered in which all the terminals are equipped with multiple antennas. Assuming independent quasi-static Rayleigh fading channels and channel state information available at the receivers, we characterize the optimal diversity-multiplexing gain tradeoff (DMT) curve for a full-duplex relay terminal. It is shown that the optimal DMT can be achieved by a compress-and-forward type relaying strategy in which the relay quantizes its received signal and transmits the corresponding channel codeword. It is noteworthy that, with this transmission protocol, the two transmissions in opposite directions can achieve their respective single user optimal DMT performances simultaneously, despite the interference they cause to each other. Motivated by the optimality of this scheme in the case of the two-way relay channel, a novel dynamic compress-and-forward (DCF) protocol is proposed for the one-way multi-hop MIMO relay channel for a half-duplex relay terminal, and this scheme is shown to achieve the optimal DMT performance.

Connected through hyperedge HE-1 (induced by source paper "technical report outage performance of full duplex mimo df relaying using zero forcing beamforming"):
  with members:
    - "joint beamforming optimization and power control for full duplex mimo two way relay channel"
    - "low complexity end to end performance optimization in mimo full duplex relay systems"
    - "performance analysis of optimal single stream beamforming in mimo dual hop af systems"

Connected through hyperedge HE-2 (induced by source paper "diversity multiplexing tradeoff for the interference channel with a relay"):
  with members:
    - "capacity theorems for the fading interference channel with a relay and feedback links"
    - "the diversity multiplexing tradeoff of the mimo half duplex relay channel"
    - "the gaussian interference relay channel improved achievable rates and sum rate upperbounds using a potent relay"
    - "generalized degrees of freedom of the symmetric gaussian k user interference channel"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-3 (induced by source paper "capacity region bounds and resource allocation for two way ofdm relay channels"):
  with members:
    - "outer bounds for the capacity region of a gaussian two way relay channel"
    - "optimal power allocation for two way decode and forward ofdm relay networks"
    - "a tutorial on the optimization of amplify and forward mimo relay systems"
    - "optimal real time spectrum sharing between cooperative relay and ad hoc networks"
    - "optimization framework and graph based approach for relay assisted bidirectional ofdma cellular networks"
    - "broadcast capacity region of two phase bidirectional relaying"
    - "on the capacity and diversity multiplexing tradeoff of the two way relay channel"

Connected through hyperedge HE-4 (induced by source paper "optimal transmit power allocation for mimo two way cognitive relay networks with multiple relays"):
  with members:
    - "optimal power allocation for fading channels in cognitive radio networks ergodic capacity and outage capacity"

Connected through hyperedge HE-5 (induced by source paper "network coding with two way relaying achievable rate regions and diversity multiplexing tradeoffs"):
  with members:
    - "on the capacity and diversity multiplexing tradeoff of the two way relay channel"
    - "physical network coding in two way wireless relay channels"
    - "performance bounds for bi directional coded cooperation protocols"
    - "a simple cooperative diversity method based on network path selection"

Connected through hyperedge HE-6 (induced by source paper "diversity multiplexing tradeoff of network coding with bidirectional random relaying"):
  with members:
    - "network coding with two way relaying achievable rate regions and diversity multiplexing tradeoffs"
    - "on the capacity and diversity multiplexing tradeoff of the two way relay channel"
    - "physical network coding in two way wireless relay channels"
    - "a simple cooperative diversity method based on network path selection"

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)