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: "on the densest mimo lattices from cyclic division algebras"
  Abstract: It is shown why the discriminant of a maximal order within a cyclic division algebra must be minimized in order to get the densest possible matrix lattices with a prescribed nonvanishing minimum determinant. Using results from class field theory a lower bound to the minimum discriminant of a maximal order with a given center and index (= the number of Tx/Rx antennas) is derived. Also numerous examples of division algebras achieving our bound are given. E.g. we construct a matrix lattice with QAM coefficients that has 2.5 times as many codewords as the celebrated Golden code of the same minimum determinant. We describe a general algorithm due to Ivanyos and Ronyai for finding maximal orders within a cyclic division algebra and discuss our enhancements to this algorithm. We also consider general methods for finding cyclic division algebras of a prescribed index achieving our lower bound.

Connected through hyperedge HE-1 (induced by source paper "a new design criterion for spherically shaped division algebra based space time codes"):
  with members:
    - "inverse determinant sums and connections between fading channel information theory and algebra"

Connected through hyperedge HE-2 (induced by source paper "algebraic hybrid satellite terrestrial space time codes for digital broadcasting in sfn"):
  with members:
    - "fast decodable asymmetric space time codes from division algebras"
    - "maximal orders in the design of dense space time lattice codes"
    - "approximately universal codes over slow fading channels"

Connected through hyperedge HE-3 (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 fast decodable space time block codes"
    - "lll reduction achieves the receive diversity in mimo decoding"
    - "diversity multiplexing tradeoff in selective fading mimo channels"
    - "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-4 (induced by source paper "codes over matrix rings for space time coded modulations"):
  with members:
    - "golden space time trellis coded modulation"

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)