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 skew polynomial codes and lattices from quotients of cyclic division algebras"
  Abstract: We propose a variation of Construction A of lattices from linear codes defined using the quotient $\Lambda/\mathfrak p\Lambda$ of some order $\Lambda$ inside a cyclic division $F$-algebra, for $\mathfrak p$ a prime ideal of a number field $F$. To obtain codes over this quotient, we first give an isomorphism between $\Lambda/\mathfrak p\Lambda$ and a ring of skew polynomials. We then discuss definitions and basic properties of skew polynomial codes, which are needed for Construction A, but also explore further properties of the dual of such codes. We conclude by providing an application to space-time coding, which is the original motivation to consider cyclic division $F$-algebras as a starting point for this variation of Construction A.

Connected through hyperedge HE-1 (induced by source paper "dual skew codes from annihilators transpose hamming ring extensions"):
  with members:
    - "generalized gabidulin codes over fields of any characteristic"
    - "peterson gorenstein zierler algorithm for skew rs codes"
    - "a sugiyama like decoding algorithm for convolutional codes"
    - "a circulant approach to skew constacyclic codes"
    - "ideal codes over separable ring extensions"
    - "skew constacyclic codes over finite chain rings"

Connected through hyperedge HE-2 (induced by source paper "how to obtain lattices from f sigma delta codes via a generalization of construction a"):
  with members:
    - "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"
    - "the nonassociative algebras used to build fast decodable space time block codes"
    - "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-3 (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"
    - "a note on linear codes and nonassociative algebras obtained from skew polynomial rings"
    - "the nonassociative algebras used to build fast decodable space time block codes"
    - "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)