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: "maximal orders in the design of dense space time lattice codes"
  Abstract: In this paper, we construct explicit rate-one, full-diversity, geometrically dense matrix lattices with large, nonvanishing determinants (NVDs) for four transmit antenna multiple-input-single-output (MISO) space-time (ST) applications. The constructions are based on the theory of rings of algebraic integers and related subrings of the Hamiltonian quaternions and can be extended to a larger number of Tx antennas. The usage of ideals guarantees an NVD larger than one and an easy way to present the exact proofs for the minimum determinants. The idea of finding denser sublattices within a given division algebra is then generalized to a multiple-input-multiple-output (MIMO) case with an arbitrary number of Tx antennas by using the theory of cyclic division algebras (CDAs) and maximal orders. It is also shown that the explicit constructions in this paper all have a simple decoding method based on sphere decoding. Related to the decoding complexity, the notion of sensitivity is introduced, and experimental evidence indicating a connection between sensitivity, decoding complexity, and performance is provided. Simulations in a quasi-static Rayleigh fading channel show that our dense quaternionic constructions outperform both the earlier rectangular lattices and the rotated quasi-orthogonal ABBA lattice as well as the diagonal algebraic space-time (DAST) lattice. We also show that our quaternionic lattice is better than the DAST lattice in terms of the diversity-multiplexing gain tradeoff (DMT).

Connected through hyperedge HE-1 (induced by source paper "on fast decodable algebraic space time codes"):
  with members:
    - "minimizing the complexity of fast sphere decoding of stbcs"
    - "optimal space time codes for the mimo amplify and forward cooperative channel"

Connected through hyperedge HE-2 (induced by source paper "fast decodable space time codes for the n relay and multiple access mimo channel"):
  with members:
    - "constructions of fast decodable distributed space time codes"
    - "bounds on fast decodability of space time block codes skew hermitian matrices and azumaya algebras"
    - "algebraic codes and a new physical layer transmission protocol for wireless distributed storage systems"
    - "fast decodable asymmetric space time codes from division algebras"
    - "iterated space time code constructions from cyclic algebras"
    - "algebraic fast decodable relay codes for distributed communications"
    - "quadratic forms and space time block codes from generalized quaternion and biquaternion algebras"
    - "minimizing the complexity of fast sphere decoding of stbcs"

Connected through hyperedge HE-3 (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"
    - "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-4 (induced by source paper "a non commutative analogue of the odlyzko bounds and bounds on performance for space time lattice codes"):
  with members:
    - "a new design criterion for spherically shaped division algebra based space time codes"
    - "inverse determinant sums and connections between fading channel information theory and algebra"
    - "fast decodable asymmetric space time codes from division algebras"

Connected through hyperedge HE-5 (induced by source paper "inverse determinant sums and connections between fading channel information theory and algebra"):
  with members:
    - "fast decodable asymmetric space time codes from division algebras"
    - "diversity multiplexing gain tradeoff a tool in algebra"
    - "an algebraic look into mac dmt of lattice space time codes"
    - "an error probability approach to mimo wiretap channels"
    - "lattice code design for the rayleigh fading wiretap channel"
    - "approximately universal codes over slow fading channels"

Connected through hyperedge HE-6 (induced by source paper "fast decodable mido codes with large coding gain"):
  with members:
    - "fast decodable asymmetric space time codes from division algebras"
    - "an enhanced dmt optimality criterion for stbc schemes for asymmetric mimo systems"
    - "iterated space time code constructions from cyclic algebras"
    - "improved perfect space time block codes"
    - "a family of fast decodable mido codes from crossed product algebras over q"
    - "space time block codes from nonassociative division algebras"
    - "on fast decodable space time block codes"

Connected through hyperedge HE-7 (induced by source paper "an enhanced dmt optimality criterion for stbc schemes for asymmetric mimo systems"):
  with members:
    - "fast decodable asymmetric space time codes from division algebras"
    - "four group decodable space time block codes"
    - "approximately universal codes over slow fading channels"

Connected through hyperedge HE-8 (induced by source paper "fast decodable asymmetric space time codes from division algebras"):
  with members:
    - "multi group ml decodable collocated and distributed space time block codes"
    - "on fast decodable space time block codes"

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)