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: "the nonassociative algebras used to build fast decodable space time block codes"
  Abstract: Let $K/F$ and $K/L$ be two  cyclic Galois field extensions  and $D=(K/F,\sigma,c)$ a cyclic algebra. Given an#R##N#invertible element $d\in D$,#R##N#we present three families of unital nonassociative algebras over $L\cap F$ defined#R##N#on the direct sum of $n$ copies of#R##N# $D$.#R##N#Two of these families appear either explicitly or implicitly in the designs of fast-decodable space-time block codes#R##N#in  papers#R##N#by Srinath, Rajan, Markin, Oggier, and the authors.#R##N#We present conditions for the algebras to be division and propose a construction for fully diverse#R##N# fast decodable space-time block codes of rate-$m$ for $nm$ transmit and $m$ receive antennas.#R##N#We present a  DMT-optimal rate-3 code for 6 transmit and 3 receive antennas which is fast-decodable,#R##N#with ML-decoding complexity#R##N#at most $\mathcal{O}(M^{15})$.

Connected through hyperedge HE-1 (induced by source paper "how to obtain lattices from f sigma delta codes via a generalization of construction a"):
  with members:
    - "on skew polynomial codes and lattices from quotients of cyclic division algebras"
    - "information bit error rate and false positives in an mds code"
    - "finite nonassociative algebras obtained from twisted polynomials over chain rings"
    - "a note on linear codes and nonassociative algebras obtained from skew polynomial rings"
    - "on self dual mrd codes"
    - "a circulant approach to skew constacyclic codes"
    - "quotients of orders in cyclic algebras and space time codes"
    - "iterated space time code constructions from cyclic algebras"

Connected through hyperedge HE-2 (induced by source paper "finite nonassociative algebras obtained from twisted polynomials over chain rings"):
  with members:
    - "how to obtain lattices from f sigma delta codes via a generalization of construction a"
    - "on skew polynomial codes and lattices from quotients of cyclic division algebras"
    - "a note on linear codes and nonassociative algebras obtained from skew polynomial rings"
    - "a circulant approach to skew constacyclic codes"
    - "quotients of orders in cyclic algebras and space time codes"
    - "skew constacyclic codes over finite chain rings"

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)