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: "the diversity multiplexing tradeoff of the mimo half duplex relay channel"
  Abstract: The fundamental diversity-multiplexing tradeoff of the three-node, multi-input, multi-output (MIMO), quasi-static, Rayleigh faded, half-duplex relay channel is characterized for an arbitrary number of antennas at each node and in which opportunistic scheduling (or dynamic operation) of the relay is allowed, i.e., the relay can switch between receive and transmit modes at a channel dependent time. In this most general case, the diversity-multiplexing tradeoff is characterized as a solution to a simple, two-variable optimization problem. This problem is then solved in closed form for special classes of channels defined by certain restrictions on the numbers of antennas at the three nodes. The key mathematical tool developed here that enables the explicit characterization of the diversity-multiplexing tradeoff is the joint eigenvalue distribution of three mutually correlated random Wishart matrices. Previously, without actually characterizing the diversity-multiplexing tradeoff, the optimality in this tradeoff metric of the dynamic compress-and-forward (DCF) protocol based on the classical compress-and-forward scheme of Cover and El Gamal was shown by Yuksel and Erkip. However, this scheme requires global channel state information (CSI) at the relay. In this work, the so-called quantize-map and forward (QMF) coding scheme due to Avestimehr {\em et} {\em al} is adopted as the achievability scheme with the added benefit that it achieves optimal tradeoff with only the knowledge of the (channel dependent) switching time at the relay node. Moreover, in special classes of the MIMO half-duplex relay channel, the optimal tradeoff is shown to be attainable even without this knowledge. Such a result was previously known only for the half-duplex relay channel with a single antenna at each node, also via the QMF scheme.

Connected through hyperedge HE-1 (induced by source paper "when are dynamic relaying strategies necessary in half duplex wireless networks"):
  with members:
    - "the approximate optimality of simple schedules for half duplex multi relay networks"
    - "generalized diversity multiplexing tradeoff of half duplex relay networks"
    - "wireless network information flow a deterministic approach"
    - "cooperative multiplexing in the multiple antenna half duplex relay channel"
    - "diversity multiplexing tradeoff of the half duplex relay channel"

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 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"
    - "mimo two way relay channel diversity multiplexing tradeoff analysis"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-3 (induced by source paper "generalized diversity multiplexing tradeoff of half duplex relay networks"):
  with members:
    - "wireless network information flow a deterministic approach"
    - "approximately achieving gaussian relay network capacity with lattice codes"
    - "cooperative multiplexing in the multiple antenna half duplex relay channel"
    - "information theoretic operating regimes of large wireless networks"
    - "diversity multiplexing tradeoff of the half duplex relay channel"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-4 (induced by source paper "the diversity multiplexing tradeoff of the mimo z interference channel"):
  with members:
    - "the capacity region of the mimo interference channel and its reciprocity to within a constant gap"
    - "the diversity multiplexing tradeoff of the dynamic decode and forward protocol on a mimo half duplex relay channel"
    - "the diversity multiplexing tradeoff of the symmetric mimo 2 user interference channel"
    - "capacity regions and sum rate capacities of vector gaussian interference channels"
    - "diversity multiplexing tradeoff in fading interference channels"
    - "diversity multiplexing tradeoff of the two user interference channel"
    - "the diversity multiplexing tradeoff for interference networks"
    - "capacity bounds for the gaussian interference channel"

Connected through hyperedge HE-5 (induced by source paper "the diversity multiplexing tradeoff of the dynamic decode and forward protocol on a mimo half duplex relay channel"):
  with members:
    - "the diversity multiplexing tradeoff of the symmetric mimo 2 user interference channel"
    - "the diversity multiplexing tradeoff of the mimo z interference channel"
    - "the diversity multiplexing tradeoff of the symmetric mimo half duplex relay channel"
    - "diversity multiplexing tradeoff for the mimo static half duplex relay"
    - "diversity multiplexing tradeoff of the half duplex relay channel"
    - "capacity and character expansions moment generating function and other exact results for mimo correlated channels"

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)