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 in selective fading multiple access mimo channels"
  Abstract: We establish the optimal diversity-multiplexing (DM) tradeoff of coherent selective-fading multiple-access multiple-input multiple-output (MIMO) channels and provide corresponding code design criteria. As a byproduct, on the conceptual level, we find an interesting relation between the DM tradeoff framework and the notion of dominant error event regions which was first introduced in the AWGN case by Gallager, IEEE Trans. IT, 1985. This relation allows to accurately characterize the error mechanisms in MIMO fading multiple-access channels. In particular, we find that, for a given rate tuple, the maximum achievable diversity order is determined by the error event that dominates the total error probability exponentially in SNR. Finally, we show that the distributed space-time code construction proposed recently by Badr and Belfiore, Int. Zurich Seminar on Commun., 2008, satisfies the code design criteria derived in this paper.

Connected through hyperedge HE-1 (induced by source paper "an error event sensitive tradeoff between rate and coding gain in mimo mac"):
  with members:
    - "sphere decoding complexity exponent for decoding full rate codes over the quasi static mimo channel"
    - "dmt optimality of lr aided linear decoders for a general class of channels lattice designs and system models"
    - "remarks on the criteria of constructing mimo mac dmt optimal codes"
    - "performance of mmse mimo receivers a large n analysis for correlated channels"
    - "on the decay of the determinants of multiuser mimo lattice codes"
    - "distributed space time block codes for the mimo multiple access channel"
    - "maximal orders in the design of dense space time lattice codes"
    - "optimal space time codes for the mimo amplify and forward cooperative channel"

Connected through hyperedge HE-2 (induced by source paper "on the achievable diversity multiplexing tradeoff in interference channels"):
  with members:
    - "diversity multiplexing tradeoff in fading interference channels"
    - "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"
    - "the two user gaussian compound interference channel"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-3 (induced by source paper "diversity multiplexing tradeoff in fading interference channels"):
  with members:
    - "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"
    - "the two user gaussian compound interference channel"

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)