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: "peterson gorenstein zierler algorithm for skew rs codes"
  Abstract: We design a non-commutative version of the Peterson-Gorenstein-Zierler decoding algorithm for a class of codes that we call skew RS codes. These codes are left ideals of a quotient of a skew polynomial ring, which endow them of a sort of non-commutative cyclic structure. Since we work over an arbitrary field, our techniques may be applied both to linear block codes and convolutional codes. In particular, our decoding algorithm applies for block codes beyond the classical cyclic case.

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"
    - "on the roots and minimum rank distance of skew cyclic codes"
    - "some properties of skew codes over finite fields"
    - "a circulant approach to skew constacyclic codes"

Connected through hyperedge HE-2 (induced by source paper "peterson gorenstein zierler algorithm for differential convolutional codes"):
  with members:
    - "a sugiyama like decoding algorithm for convolutional codes"
    - "ideal codes over separable ring extensions"

Connected through hyperedge HE-3 (induced by source paper "dual skew codes from annihilators transpose hamming ring extensions"):
  with members:
    - "generalized gabidulin codes over fields of any characteristic"
    - "a sugiyama like decoding algorithm for convolutional codes"
    - "on skew polynomial codes and lattices from quotients of cyclic division algebras"
    - "a circulant approach to skew constacyclic codes"
    - "ideal codes over separable ring extensions"
    - "skew constacyclic codes over finite chain rings"

Connected through hyperedge HE-4 (induced by source paper "minimum distance computation of linear codes via genetic algorithms with permutation encoding"):
  with members:
    - "a sugiyama like decoding algorithm for convolutional codes"
    - "on the computing of the minimum distance of linear block codes by heuristic methods"

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)