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: "diversity multiplexing tradeoff for the mimo static half duplex relay"
  Abstract: In this work, we investigate the diversity-multiplexing tradeoff (DMT) of the multiple-antenna (MIMO) static half-duplex relay channel. A general expression is derived for the DMT upper bound, which can be achieved by a compress-and-forward protocol at the relay, under certain assumptions. The DMT expression is given as the solution of a minimization problem in general, and an explicit expression is found when the relay channel is symmetric in terms of number of antennas, i.e. the source and the destination have n antennas each, and the relay has m antennas. It is observed that the static half-duplex DMT matches the full-duplex DMT when the relay has a single antenna, and is strictly below the full-duplex DMT when the relay has multiple antennas. Besides, the derivation of the upper bound involves a new asymptotic study of spherical integrals (that is, integrals with respect to the Haar measure on the unitary group U(n)), which is a topic of mathematical interest in itself.

Connected through hyperedge HE-1 (induced by source paper "diversity of linear transceivers in mimo af half duplex relaying channels"):
  with members:
    - "diversity of mmse mimo receivers"
    - "asymptotic performance of linear receivers in mimo fading channels"
    - "towards the optimal amplify and forward cooperative diversity scheme"
    - "diversity multiplexing tradeoff of double scattering mimo channels"
    - "optimal space time codes for the mimo amplify and forward cooperative channel"

Connected through hyperedge HE-2 (induced by source paper "achievable diversity rate tradeoff of mimo af relaying systems with mmse transceivers"):
  with members:
    - "diversity of mmse mimo receivers"
    - "asymptotic performance of linear receivers in mimo fading channels"

Connected through hyperedge HE-3 (induced by source paper "the diversity multiplexing tradeoff of the mimo half duplex relay channel"):
  with members:
    - "wireless network information flow a deterministic approach"
    - "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"
    - "the diversity multiplexing tradeoff of the mimo z interference channel"
    - "noisy network coding"
    - "the diversity multiplexing tradeoff of the symmetric mimo half duplex relay channel"
    - "diversity multiplexing tradeoff of the half duplex relay channel"

Connected through hyperedge HE-4 (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 mimo half duplex relay channel"
    - "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 of the half duplex relay channel"
    - "capacity and character expansions moment generating function and other exact results for mimo correlated channels"

Connected through hyperedge HE-5 (induced by source paper "the diversity multiplexing tradeoff of the symmetric mimo half duplex relay channel"):
  with members:
    - "the diversity multiplexing tradeoff of the dynamic decode and forward protocol on a mimo half duplex relay channel"
    - "diversity multiplexing tradeoff of the half duplex relay channel"
    - "on the achievable diversity multiplexing tradeoffs in half duplex cooperative 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)