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: "optimal 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 multiple-input multiple-output (MIMO) channels and provide a code design criterion for DM tradeoff optimality. Our results are based on the new concept of the "Jensen channel" associated to a given selective-fading MIMO channel. While the original problem seems analytically intractable due to the mutual information between channel input and output 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. We formulate a systematic procedure for designing DM tradeoff optimal codes for general selective-fading MIMO channels by demonstrating that the design problem can be separated into two simpler and independent problems: the design of an inner code, or precoder, adapted to the channel statistics (i.e., the selectivity characteristics) and an outer code independent of the channel statistics. Our results are supported by appealing geometric intuition, first pointed out for the flat-fading case by Zheng and Tse, IEEE Trans. Inf. Theory, 2003.

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

Connected through hyperedge HE-2 (induced by source paper "diversity multiplexing tradeoff in selective fading multiple access mimo channels"):
  with members:
    - "diversity multiplexing tradeoff in selective fading mimo channels"
    - "approximately universal codes over slow fading 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)