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: "a complete characterization of irreducible cyclic orbit codes"
  Abstract: We give a complete list of orbit codes that are generated by an irreducible cyclic group, i.e. an irreducible group having one generator. We derive some of the basic properties of these codes such as the cardinality and the minimum distance.

Connected through hyperedge HE-1 (induced by source paper "cyclic orbit codes"):
  with members:
    - "a complete characterization of irreducible cyclic orbit codes and their plucker embedding"
    - "linearity and complements in projective space"
    - "on conjugacy classes of subgroups of the general linear group and cyclic orbit codes"
    - "an algebraic approach for decoding spread codes"
    - "spread decoding in extension fields"
    - "recursive code construction for random networks"
    - "construction of codes for network coding"
    - "error correcting codes in projective spaces via rank metric codes and ferrers diagrams"

Connected through hyperedge HE-2 (induced by source paper "an algebraic approach for decoding spread codes"):
  with members:
    - "recursive code construction for random networks"
    - "error correcting codes in projective spaces via rank metric codes and ferrers diagrams"
    - "spread codes and spread decoding in network coding"
    - "a rank metric approach to error control in random network coding"
    - "construction of large constant dimension codes with a prescribed minimum distance"
    - "coding for errors and erasures in random network coding"

Connected through hyperedge HE-3 (induced by source paper "on conjugacy classes of subgroups of the general linear group and cyclic orbit codes"):
  with members:
    - "recursive code construction for random networks"
    - "error correcting codes in projective spaces via rank metric codes and ferrers diagrams"
    - "spread codes and spread decoding in network coding"
    - "construction of large constant dimension codes with a prescribed minimum distance"
    - "coding for errors and erasures in random network coding"

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)