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 search for high rate quasi orthogonal space time block code"
  Abstract: A Quasi-Orthogonal Space-Time Block Code (QO-STBC) is attractive because it achieves higher code rate than Orthogonal STBC and lower decoding complexity than nonorthogonal STBC. In this paper, we first derive the algebraic structure of QO-STBC, then we apply it in a novel graph-based search algorithm to find high-rate QO-STBCs with code rates greater than 1. From the four-antenna codes found using this approach, it is found that the maximum code rate is limited to 5/4 with symbolwise diversity level of four, and 4 with symbolwise diversity level of two. The maximum likelihood decoding of these high-rate QO-STBCs can be performed on two separate sub-groups of symbols. The rate-5/4 codes are the first known QO-STBCs with code rate greater 1 that has full symbolwise diversity level.

Connected through hyperedge HE-1 (induced by source paper "bounds on fast decodability of space time block codes skew hermitian matrices and azumaya algebras"):
  with members:
    - "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"
    - "minimizing the complexity of fast sphere decoding of stbcs"
    - "four group decodable space time block codes"
    - "on fast decodable space time block codes"

Connected through hyperedge HE-2 (induced by source paper "a novel construction of multi group decodable space time block codes"):
  with members:
    - "maximum rate of 3 and 4 real symbol ml decodable unitary weight stbcs"
    - "a new low complexity decodable rate 5 4 stbc for four transmit antennas with nonvanishing determinants"
    - "group decodable space time block codes with code rate 1"
    - "four group decodable space time block codes"
    - "on fast decodable space time block codes"
    - "quasi orthogonal stbc with minimum decoding complexity"

Connected through hyperedge HE-3 (induced by source paper "generalized distributive law for ml decoding of space time block codes"):
  with members:
    - "a family of fast decodable mido codes from crossed product algebras over q"
    - "four group decodable space time block codes"
    - "fast maximum likelihood decoding of the golden code"
    - "on fast decodable space time block codes"
    - "quasi orthogonal stbc with minimum decoding complexity"

Connected through hyperedge HE-4 (induced by source paper "block orthogonal space time code structure and its impact on qrdm decoding complexity reduction"):
  with members:
    - "group decodable space time block codes with code rate 1"
    - "four group decodable space time block codes"
    - "on fast decodable space time block codes"
    - "quasi orthogonal stbc with minimum decoding complexity"

Connected through hyperedge HE-5 (induced by source paper "on the sphere decoding complexity of stbcs for asymmetric mimo systems"):
  with members:
    - "asymptotically optimal fast decodable full diversity stbcs"
    - "four group decodable space time block codes"

Connected through hyperedge HE-6 (induced by source paper "group decodable space time block codes with code rate 1"):
  with members:
    - "four group decodable space time block codes"
    - "on fast decodable space time block codes"

Connected through hyperedge HE-7 (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"
    - "quadratic forms and space time block codes from generalized quaternion and biquaternion algebras"
    - "group decodable space time block codes with code rate 1"
    - "four group decodable space time block codes"

Connected through hyperedge HE-8 (induced by source paper "low ml decoding complexity stbcs via codes over gf 4"):
  with members:
    - "asymptotically optimal fast decodable full diversity stbcs"
    - "four group decodable space time block codes"
    - "fast maximum likelihood decoding of the golden code"
    - "on fast decodable space time block codes"
    - "algebraic distributed differential space time codes with low decoding complexity"
    - "quasi orthogonal stbc with minimum decoding complexity"

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)