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: "bounds on fast decodability of space time block codes skew hermitian matrices and azumaya algebras"
  Abstract: We study fast lattice decodability of space-time block codes for    $n$    transmit and receive antennas, written very generally as a linear combination    $\sum _{i=1}^{2l} s_{i} A_{i}$   , where the    $s_{i}$    are real information symbols and the    $A_{i}$    are    $n\times n~ \mathbb {R}$   -linearly independent complex-valued matrices. We show that the mutual orthogonality condition    $A_{i}A_{\vphantom {R_{R_{R_{a}}}}j}^{*} + A_{j}A_{i}^{*}=0$    for distinct basis matrices is not only sufficient but also necessary for fast decodability. We build on this to show that for full-rate (   $l = n^{2}$   ) transmission, the decoding complexity can be no better than    $ |S|^{n^{2}+1}$   , where    $ |S|$    is the size of the effective real signal constellation. We also show that for full-rate transmission,    $g$   -group decodability, as defined by Jithamithra and Rajan, is impossible for any    $g\ge 2$   . We then use the theory of Azumaya algebras to derive bounds on the maximum number of groups into which the basis matrices can be partitioned so that the matrices in different groups are mutually orthogonal—a key measure of fast decodability. We show that in general, this maximum number is of the order of only the 2-adic value of    $n$   . In the case where the matrices    $A_{i}$    arise from a division algebra, which is most desirable for diversity, we show that the maximum number of groups is only 4. As a result, the decoding complexity for this case is no better than    $ |S|^{\lceil l/2 \rceil }$    for any rate    $l$   .

Connected through hyperedge HE-1 (induced by source paper "lattice codes for physical layer communications"):
  with members:
    - "well rounded lattices for reliability and security in rayleigh fading siso channels"
    - "the compute and forward protocol implementation and practical aspects"
    - "lattice code design for the rayleigh fading wiretap channel"
    - "compute and forward harnessing interference through structured codes"
    - "on fast decodable space time block codes"

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"
    - "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"
    - "compute and forward harnessing interference through structured 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)