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 mimo channels"
  Abstract: We establish the optimal diversity-multiplexing (DM) tradeoff of coherent time, frequency and time-frequency selective-fading MIMO channels and provide a code design criterion for DM-tradeoff optimality. Our results are based on the analysis of the "Jensen channel" associated to a given selective-fading MIMO channel. While the original problem seems analytically intractable due to the mutual information being a sum of correlated random variables, the Jensen channel is equivalent to the original channel in the sense of the DM-tradeoff and lends itself nicely to analytical treatment. Finally, as a consequence of our results, we find that the classical rank criterion for space-time code design (in selective-fading MIMO channels) ensures optimality in the sense of the DM-tradeoff.

Connected through hyperedge HE-1 (induced by source paper "the streaming dmt of fading channels"):
  with members:
    - "erasure coding for real time streaming"
    - "streaming codes for channels with burst and isolated erasures"
    - "linear error correcting codes with anytime reliability"
    - "diversity embedded streaming erasure codes de sco constructions and optimality"
    - "on successive refinement of diversity for fading isi channels"
    - "distortion minimization in gaussian layered broadcast coding with successive refinement"
    - "high snr analysis of outage limited communications with bursty and delay limited information"
    - "on the distortion snr exponent of some layered transmission schemes"

Connected through hyperedge HE-2 (induced by source paper "dmt optimality of lr aided linear decoders for a general class of channels lattice designs and system models"):
  with members:
    - "finite lattice size effects in mimo detection"
    - "algebraic reduction for space time codes based on quaternion algebras"
    - "on the densest mimo lattices from cyclic division algebras"
    - "on fast decodable space time block codes"
    - "lll reduction achieves the receive diversity in mimo decoding"
    - "approximately universal space time codes for the parallel multi block and cooperative dynamic decode and forward channels"
    - "on the limitations of the naive lattice decoding"
    - "towards the optimal amplify and forward cooperative diversity scheme"

Connected through hyperedge HE-3 (induced by source paper "finite snr diversity multiplexing tradeoff via asymptotic analysis of large mimo systems"):
  with members:
    - "diversity multiplexing tradeoff and outage probability in mimo relay channels"
    - "transmit diversity v spatial multiplexing in modern mimo systems"
    - "diversity multiplexing tradeoff of double scattering mimo channels"

Connected through hyperedge HE-4 (induced by source paper "how to achieve the optimal dmt of selective fading mimo channels"):
  with members:
    - "noncoherent capacity of underspread fading channels"
    - "optimal diversity multiplexing tradeoff in selective fading mimo channels"
    - "remarks on the criteria of constructing mimo mac dmt optimal codes"

Connected through hyperedge HE-5 (induced by source paper "selective fading multiple access mimo channels diversity multiplexing tradeoff and dominant outage event regions"):
  with members:
    - "approximately universal codes over slow fading channels"

Connected through hyperedge HE-6 (induced by source paper "turbo packet combining strategies for the mimo isi arq channel"):
  with members:
    - "optimal throughput diversity delay tradeoff in mimo arq block fading channels"

Connected through hyperedge HE-7 (induced by source paper "diversity multiplexing tradeoff in selective fading multiple access mimo channels"):
  with members:
    - "optimal diversity multiplexing tradeoff in selective fading mimo channels"
    - "approximately universal codes over slow fading channels"

Connected through hyperedge HE-8 (induced by source paper "transmit diversity v spatial multiplexing in modern mimo systems"):
  with members:
    - "channel coding the road to channel capacity"

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)