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: "johnson type bounds on constant dimension codes"
  Abstract: Very recently, an operator channel was defined by Koetter and Kschischang when they studied random network coding. They also introduced constant dimension codes and demonstrated that these codes can be employed to correct errors and/or erasures over the operator channel. Constant dimension codes are equivalent to the so-called linear authentication codes introduced by Wang, Xing and Safavi-Naini when constructing distributed authentication systems in 2003. In this paper, we study constant dimension codes. It is shown that Steiner structures are optimal constant dimension codes achieving the Wang-Xing-Safavi-Naini bound. Furthermore, we show that constant dimension codes achieve the Wang-Xing-Safavi-Naini bound if and only if they are certain Steiner structures. Then, we derive two Johnson type upper bounds, say I and II, on constant dimension codes. The Johnson type bound II slightly improves on the Wang-Xing-Safavi-Naini bound. Finally, we point out that a family of known Steiner structures is actually a family of optimal constant dimension codes achieving both the Johnson type bounds I and II.

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"
    - "cyclic orbit codes"
    - "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"

Connected through hyperedge HE-2 (induced by source paper "construction of const dimension codes from serval parallel lift mrd code"):
  with members:
    - "construction of subspace codes through linkage"
    - "rank distribution of delsarte codes"
    - "subspace codes based on graph matchings ferrers diagrams and pending blocks"
    - "error correcting codes in projective spaces via rank metric codes and ferrers diagrams"
    - "coding for errors and erasures in random network coding"

Connected through hyperedge HE-3 (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"
    - "cyclic orbit codes"
    - "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"

Connected through hyperedge HE-4 (induced by source paper "subspace codes based on graph matchings ferrers diagrams and pending blocks"):
  with members:
    - "partial spreads in random network coding"
    - "new improvements on the echelon ferrers construction"
    - "large constant dimension codes and lexicodes"
    - "recursive code construction for random networks"
    - "enumerative coding for grassmannian space"
    - "projective space codes for the injection metric"
    - "error correcting codes in projective spaces via rank metric codes and ferrers diagrams"
    - "spread codes and spread decoding in network coding"

Connected through hyperedge HE-5 (induced by source paper "efficient interpolation based decoding of interleaved subspace and gabidulin codes"):
  with members:
    - "list and unique error erasure decoding of interleaved gabidulin codes with interpolation techniques"
    - "bounds for projective codes from semidefinite programming"
    - "bounds on list decoding of rank metric codes"
    - "list decoding of lifted gabidulin codes via the plucker embedding"
    - "list decoding of subspace codes and rank metric codes up to singleton bound"
    - "general linearized polynomial interpolation and its applications"
    - "recursive code construction for random networks"
    - "error correcting codes in projective spaces via rank metric codes and ferrers diagrams"

Connected through hyperedge HE-6 (induced by source paper "list and unique error erasure decoding of interleaved gabidulin codes with interpolation techniques"):
  with members:
    - "bounds for projective codes from semidefinite programming"
    - "bounds on list decoding of rank metric codes"
    - "list decoding of subspace codes and rank metric codes up to singleton bound"
    - "general linearized polynomial interpolation and its applications"
    - "linear algebraic list decoding of folded reed solomon codes"
    - "recursive code construction for random networks"
    - "fast encoding and decoding of gabidulin codes"
    - "error correcting codes in projective spaces via rank metric codes and ferrers diagrams"

Connected through hyperedge HE-7 (induced by source paper "cyclic orbit codes and stabilizer subfields"):
  with members:
    - "a complete characterization of irreducible cyclic orbit codes and their plucker embedding"
    - "cyclic orbit codes"
    - "isometry and automorphisms of constant dimension codes"
    - "construction of codes for network coding"
    - "on metrics for error correction in network coding"
    - "error correcting codes in projective spaces via rank metric codes and ferrers diagrams"
    - "a rank metric approach to error control in random network coding"
    - "construction of large constant dimension codes with a prescribed minimum distance"

Connected through hyperedge HE-8 (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"

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)