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: "some properties of skew codes over finite fields"
  Abstract: After recalling the definition of codes as modules over skew polynomial rings, whose multiplication is defined by using an automorphism and a derivation, and some basic facts about them, in the first part of this paper we study some of their main algebraic and geometric properties. Finally, for module skew codes constructed only with an automorphism, we give some BCH type lower bounds for their minimum distance.

Connected through hyperedge HE-1 (induced by source paper "skew polynomial rings and skew cyclic codes"):
  with members:
    - "skew and linearized reed solomon codes and maximum sum rank distance codes over any division ring"
    - "peterson gorenstein zierler algorithm for skew rs codes"
    - "on the roots and minimum rank distance of skew cyclic codes"
    - "a circulant approach to skew constacyclic codes"

Connected through hyperedge HE-2 (induced by source paper "skew generalized cyclic code over r x_1 sigma_1 delta_1 x_2 sigma_2 delta_2"):
  with members:
    - "dual codes of product semi linear codes"

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

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)