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: "fast group decodable stbcs via codes over gf 4"
  Abstract: In this paper we construct low decoding complexity STBCs by using the Pauli matrices as linear dispersion matrices. In this case the Hurwitz-Radon orthogonality condition is shown to be easily checked by transferring the problem to $\mathbb{F}_4$ domain. The problem of constructing low decoding complexity STBCs is shown to be equivalent to finding certain codes over $\mathbb{F}_4$. It is shown that almost all known low complexity STBCs can be obtained by this approach. New codes are given that have the least known decoding complexity in particular ranges of rate.

Connected through hyperedge HE-1 (induced by source paper "iterated space time code constructions from cyclic algebras"):
  with members:
    - "fast decodable asymmetric space time codes from division algebras"
    - "quadratic forms and space time block codes from generalized quaternion and biquaternion algebras"
    - "asymptotically optimal fast decodable full diversity stbcs"
    - "minimizing the complexity of fast sphere decoding of stbcs"
    - "on fast decodable space time block codes"

Connected through hyperedge HE-2 (induced by source paper "algebraic fast decodable relay codes for distributed communications"):
  with members:
    - "quadratic forms and space time block codes from generalized quaternion and biquaternion algebras"
    - "multi group ml decodable collocated and distributed space time block codes"
    - "on fast decodable space time block codes"
    - "optimal space time codes for the mimo amplify and forward cooperative channel"
    - "on the achievable diversity multiplexing tradeoffs in half duplex cooperative channels"

Connected through hyperedge HE-3 (induced by source paper "a new full diversity criterion and low complexity stbcs with partial interference cancellation decoding"):
  with members:
    - "full diversity space time block codes with low complexity partial interference cancellation group decoding"
    - "two designs of space time block codes achieving full diversity with partial interference cancellation group decoding"
    - "four group decodable space time block codes"
    - "on full diversity space time block codes with partial interference cancellation group decoding"
    - "multi group ml decodable collocated and distributed space time block codes"
    - "on fast decodable space time block codes"
    - "quasi orthogonal stbc with minimum decoding complexity"
    - "multigroup decodable stbcs from clifford algebras"

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)