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: "cyclic orbit codes"
  Abstract: A constant dimension code consists of a set of k-dimensional subspaces of \BBF qn. Orbit codes are constant dimension codes which are defined as orbits of a subgroup of the general linear group, acting on the set of all subspaces of \BBF qn. If the acting group is cyclic, the corresponding orbit codes are called cyclic orbit codes. In this paper, we show how orbit codes can be seen as an analog of linear codes in the block coding case. We investigate how the structure of cyclic orbit codes can be utilized to compute the minimum distance and cardinality of a given code and propose different decoding procedures for a particular subclass of cyclic orbit codes.

Connected through hyperedge HE-1 (induced by source paper "the lattice structure of linear subspace codes"):
  with members:
    - "equidistant subspace codes"
    - "on the bounds of certain maximal linear codes in a projective space"
    - "linearity and complements in projective space"
    - "large constant dimension codes and lexicodes"
    - "enumerative coding for grassmannian space"
    - "construction of large constant dimension codes with a prescribed minimum distance"
    - "coding for errors and erasures in random network coding"
    - "johnson type bounds on constant dimension codes"

Connected through hyperedge HE-2 (induced by source paper "distance distributions of cyclic orbit codes"):
  with members:
    - "construction of sidon spaces with applications to coding"
    - "constructions of cyclic constant dimension codes"
    - "construction of subspace codes through linkage"
    - "subspace polynomials and cyclic subspace codes"
    - "subspace codes based on graph matchings ferrers diagrams and pending blocks"
    - "cyclic orbit codes and stabilizer subfields"
    - "coding for errors and erasures in random network coding"

Connected through hyperedge HE-3 (induced by source paper "cliques in projective space and construction of cyclic grassmannian codes"):
  with members:
    - "constructions of cyclic constant dimension codes"
    - "subspace polynomials and cyclic subspace codes"
    - "cyclic orbit codes and stabilizer subfields"
    - "construction of large constant dimension codes with a prescribed minimum distance"

Connected through hyperedge HE-4 (induced by source paper "maximal ferrers diagram codes constructions and genericity considerations"):
  with members:
    - "on the sparseness of certain mrd codes"
    - "partition balanced families of codes and asymptotic enumeration in coding theory"
    - "on the genericity of maximum rank distance and gabidulin codes"
    - "algebraic structures of mrd codes"
    - "construction of subspace codes through linkage"
    - "row reduction applied to decoding of rank metric and subspace codes"
    - "subspace polynomials and cyclic subspace codes"
    - "subspace codes based on graph matchings ferrers diagrams and pending blocks"

Connected through hyperedge HE-5 (induced by source paper "constructions of cyclic constant dimension codes"):
  with members:
    - "vector network coding based on subspace codes outperforms scalar linear network coding"
    - "subspace polynomials and cyclic subspace codes"
    - "cyclic orbit codes and stabilizer subfields"
    - "bounds on list decoding of rank metric codes"
    - "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"
    - "johnson type bounds on constant dimension codes"

Connected through hyperedge HE-6 (induced by source paper "construction of sidon spaces with applications to coding"):
  with members:
    - "squares of random linear codes"
    - "cyclic orbit codes and stabilizer subfields"
    - "coding for errors and erasures in random network coding"

Connected through hyperedge HE-7 (induced by source paper "on quasi cyclic subspace codes"):
  with members:
    - "subspace polynomials and cyclic subspace codes"
    - "cyclic orbit codes and stabilizer subfields"
    - "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-8 (induced by source paper "construction of subspace codes through linkage"):
  with members:
    - "algebraic structures of mrd codes"
    - "grassmannian codes as lifts of matrix codes derived as images of linear block codes over finite fields"
    - "subspace codes based on graph matchings ferrers diagrams and pending blocks"
    - "cyclic orbit codes and stabilizer subfields"
    - "a complete characterization of irreducible cyclic orbit codes and their plucker embedding"
    - "partial spreads in random network coding"
    - "new improvements on the echelon ferrers construction"
    - "an algebraic approach for decoding spread 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)