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 conjugacy classes of subgroups of the general linear group and cyclic orbit codes"
  Abstract: Orbit codes are a family of codes applicable for communications on a random linear network coding channel. The paper focuses on the classification of these codes. We start by classifying the conjugacy classes of cyclic subgroups of the general linear group. As a result, we are able to focus the study of cyclic orbit codes to a restricted family of them.

Connected through hyperedge HE-1 (induced by source paper "message encoding and retrieval for spread and cyclic orbit codes"):
  with members:
    - "subspace polynomials and cyclic subspace codes"
    - "subspace codes based on graph matchings ferrers diagrams and pending blocks"
    - "cyclic orbit codes and stabilizer subfields"
    - "message encoding for spread and orbit codes"
    - "a complete characterization of irreducible cyclic orbit codes and their plucker embedding"
    - "cyclic orbit codes"
    - "partial spreads in random network coding"
    - "canonical forms and automorphisms in the projective space"

Connected through hyperedge HE-2 (induced by source paper "message encoding for spread and orbit codes"):
  with members:
    - "a complete characterization of irreducible cyclic orbit codes and their plucker embedding"
    - "cyclic orbit codes"
    - "canonical forms and automorphisms in the projective space"
    - "isometry and automorphisms of constant dimension codes"
    - "new improvements on the echelon ferrers construction"
    - "an algebraic approach for decoding spread codes"
    - "spread decoding in extension fields"
    - "recursive code construction for random networks"

Connected through hyperedge HE-3 (induced by source paper "problems on q analogs in coding theory"):
  with members:
    - "a complete characterization of irreducible cyclic orbit codes and their plucker embedding"
    - "new lower bounds for constant dimension codes"
    - "bounds for projective codes from semidefinite programming"
    - "cyclic orbit codes"
    - "list decoding of lifted gabidulin codes via the plucker embedding"
    - "isometry and automorphisms of constant dimension codes"
    - "list decoding subspace codes from insertions and deletions"
    - "decoding of subspace codes a problem of schubert calculus over finite fields"

Connected through hyperedge HE-4 (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"
    - "a complete characterization of irreducible 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-5 (induced by source paper "a complete characterization of irreducible cyclic orbit codes and their plucker embedding"):
  with members:
    - "spread decoding in extension fields"
    - "construction of codes for network coding"
    - "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-6 (induced by source paper "a complete characterization of irreducible cyclic orbit codes"):
  with members:
    - "construction of codes for network coding"
    - "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"

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)