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: "quadratic forms and space time block codes from generalized quaternion and biquaternion algebras"
  Abstract: In the context of space-time block codes (STBCs), the theory of generalized quaternion and biquaternion algebras (i.e., tensor products of two quaternion algebras) over arbitrary base fields is presented, as well as quadratic form theoretic criteria to check if such algebras are division algebras. For base fields relevant to STBCs, these criteria are exploited, via Springer's theorem, to construct several explicit infinite families of (bi-)quaternion division algebras. These are used to obtain new 2 × 2 and 4 × 4 STBCs.

Connected through hyperedge HE-1 (induced by source paper "revisited design criteria for stbcs with reduced complexity ml decoding"):
  with members:
    - "achieving low complexity maximum likelihood detection for the 3d mimo code"
    - "construction of block orthogonal stbcs and reducing their sphere decoding complexity"
    - "fast decodable asymmetric space time codes from division algebras"
    - "iterated space time code constructions from cyclic algebras"
    - "a family of fast decodable mido codes from crossed product algebras over q"
    - "block orthogonal space time code structure and its impact on qrdm decoding complexity reduction"
    - "optimization of fast decodable full rate stbc with non vanishing determinants"
    - "group decodable space time block codes with code rate 1"

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"
    - "minimizing the complexity of fast sphere decoding of stbcs"
    - "compute and forward harnessing interference through structured codes"

Connected through hyperedge HE-3 (induced by source paper "iterated space time code constructions from cyclic algebras"):
  with members:
    - "fast decodable asymmetric space time codes from division algebras"
    - "asymptotically optimal fast decodable full diversity stbcs"
    - "minimizing the complexity of fast sphere decoding of stbcs"
    - "fast group decodable stbcs via codes over gf 4"
    - "on fast decodable space time block codes"

Connected through hyperedge HE-4 (induced by source paper "algebraic fast decodable relay codes for distributed communications"):
  with members:
    - "fast group decodable stbcs via codes over gf 4"
    - "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-5 (induced by source paper "space time block codes from nonassociative division algebras"):
  with members:
    - "perfect space time codes with minimum and non minimum delay for any number of antennas"

Connected through hyperedge HE-6 (induced by source paper "minimizing the complexity of fast sphere decoding of stbcs"):
  with members:
    - "construction of block orthogonal stbcs and reducing their sphere decoding complexity"
    - "fast decodable asymmetric space time codes from division algebras"
    - "iterated space time code constructions from cyclic algebras"
    - "block orthogonal space time code structure and its impact on qrdm decoding complexity reduction"
    - "optimization of fast decodable full rate stbc with non vanishing determinants"
    - "group decodable space time block codes with code rate 1"
    - "four group decodable space time block codes"
    - "fast maximum likelihood decoding of the golden code"

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)