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: "remarks on the criteria of constructing mimo mac dmt optimal codes"
  Abstract: In this paper we investigate the criteria proposed by Coronel et al. for constructing MIMO MAC-DMT optimal codes over several classes of fading channels. We first give a counterexample showing their DMT result is not correct when the channel is frequency-selective. For the case of symmetric MIMO-MAC flat fading channels, their DMT result reduces to exactly the same as that derived by Tse et al., and we therefore focus on their criteria for constructing MAC-DMT optimal codes, especially when the number of receive antennas is sufficiently large. In such case, we show their criterion is equivalent to requiring the codes of any subset of users to satisfy a joint non-vanishing determinant criterion when the system operates in the antenna pooling regime. Finally an upper bound on the product of minimum eigenvalues of the difference matrices is provided, and is used to show any MIMO-MAC codes satisfying their criterion can possibly exist only when the target multiplexing gain is small.

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"
    - "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"
    - "diversity multiplexing tradeoff in selective fading multiple access mimo channels"
    - "optimal space time codes for the mimo amplify and forward cooperative channel"

Connected through hyperedge HE-2 (induced by source paper "space time storage codes for wireless distributed storage systems"):
  with members:
    - "capacity and security of heterogeneous distributed storage systems"
    - "regenerating codes for errors and erasures in distributed storage"
    - "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction"
    - "fractional repetition codes for repair in distributed storage systems"
    - "a survey on network codes for distributed storage"
    - "network coding for distributed storage systems"

Connected through hyperedge HE-3 (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"
    - "diversity multiplexing tradeoff in selective fading mimo 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)