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: "asymptotically optimal fast decodable full diversity stbcs"
  Abstract: For a family/sequence of STBCs $\mathcal{C}_1,\mathcal{C}_2,\dots$, with increasing number of transmit antennas $N_i$, with rates $R_i$ complex symbols per channel use (cspcu), the asymptotic normalized rate is defined as $\lim_{i \to \infty}{\frac{R_i}{N_i}}$. A family of STBCs is said to be asymptotically-good if the asymptotic normalized rate is non-zero, i.e., when the rate scales as a non-zero fraction of the number of transmit antennas, and the family of STBCs is said to be asymptotically-optimal if the asymptotic normalized rate is 1, which is the maximum possible value. In this paper, we construct a new class of full-diversity STBCs that have the least ML decoding complexity among all known codes for any number of transmit antennas $N>1$ and rates $R>1$ cspcu. For a large set of $\left(R,N\right)$ pairs, the new codes have lower ML decoding complexity than the codes already available in the literature. Among the new codes, the class of full-rate codes ($R=N$) are asymptotically-optimal and fast-decodable, and for $N>5$ have lower ML decoding complexity than all other families of asymptotically-optimal, fast-decodable, full-diversity STBCs available in the literature. The construction of the new STBCs is facilitated by the following further contributions of this paper:(i) For $g > 1$, we construct $g$-group ML-decodable codes with rates greater than one cspcu. These codes are asymptotically-good too. For $g>2$, these are the first instances of $g$-group ML-decodable codes with rates greater than $1$ cspcu presented in the literature. (ii) We construct a new class of fast-group-decodable codes for all even number of transmit antennas and rates $1 < R \leq 5/4$.(iii) Given a design with full-rank linear dispersion matrices, we show that a full-diversity STBC can be constructed from this design by encoding the real symbols independently using only regular PAM constellations.

Connected through hyperedge HE-1 (induced by source paper "an adaptive conditional zero forcing decoder with full diversity least complexity and essentially ml performance for stbcs"):
  with members:
    - "fast decodable asymmetric space time codes from division algebras"
    - "reduced ml decoding complexity full rate stbcs for 4 transmit antenna systems"
    - "on full diversity space time block codes with partial interference cancellation group decoding"
    - "fast maximum likelihood decoding of the golden code"
    - "on fast decodable space time block codes"

Connected through hyperedge HE-2 (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"
    - "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-3 (induced by source paper "generalized silver codes"):
  with members:
    - "four group decodable space time block codes"
    - "fast maximum likelihood decoding of the golden code"
    - "on fast decodable space time block codes"

Connected through hyperedge HE-4 (induced by source paper "on the sphere decoding complexity of stbcs for asymmetric mimo systems"):
  with members:
    - "four group decodable space time block codes"
    - "on the search for high rate quasi orthogonal space time block code"

Connected through hyperedge HE-5 (induced by source paper "low ml decoding complexity stbcs via codes over gf 4"):
  with members:
    - "four group decodable space time block codes"
    - "fast maximum likelihood decoding of the golden code"
    - "on the search for high rate quasi orthogonal space time block 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)