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 construction of skew quasi cyclic codes"
  Abstract: In this paper we study a special type of quasi-cyclic (QC) codes called skew QC codes. This set of codes is constructed using a non-commutative ring called the skew polynomial rings $F[x;\theta ]$. After a brief description of the skew polynomial ring $F[x;\theta ]$ it is shown that skew QC codes are left submodules of the ring $R_{s}^{l}=(F[x;\theta ]/(x^{s}-1))^{l}.$ The notions of generator and parity-check polynomials are given. We also introduce the notion of similar polynomials in the ring $F[x;\theta ]$ and show that parity-check polynomials for skew QC codes are unique up to similarity. Our search results lead to the construction of several new codes with Hamming distances exceeding the Hamming distances of the previously best known linear codes with comparable parameters.

Connected through hyperedge HE-1 (induced by source paper "a note on the duals of skew constacyclic codes"):
  with members:
    - "some properties of skew codes over finite fields"
    - "a circulant approach to skew constacyclic codes"
    - "dual codes of product semi linear codes"
    - "skew constacyclic codes over finite chain rings"

Connected through hyperedge HE-2 (induced by source paper "on the codes over the z_3 vz_3 v 2z_3"):
  with members:
    - "skew generalized quasi cyclic codes over finite fields"
    - "skew constacyclic codes over finite chain rings"

Connected through hyperedge HE-3 (induced by source paper "on skew cyclic codes over fq vfq v 2 fq"):
  with members:
    - "skew constacyclic codes over finite chain rings"

Connected through hyperedge HE-4 (induced by source paper "a circulant approach to skew constacyclic codes"):
  with members:
    - "new classes of quadratic bent functions in polynomial forms"
    - "skew generalized quasi cyclic codes over finite fields"

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)