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: "construction of large constant dimension codes with a prescribed minimum distance"
  Abstract: In this paper we construct constant dimension codes with prescribed minimum distance. There is an increased interest in subspace codes in general since a paper [13] by Kotter and Kschischang where they gave an application in network coding. There is also a connection to the theory of designs over finite fields. We will modify a method of Braun, Kerber and Laue [7] which they used for the construction of designs over finite fields to construct constant dimension codes. Using this approach we found many new constant dimension codes with a larger number of codewords than previously known codes. We finally give a table of the best constant dimension codes we found.

Connected through hyperedge HE-1 (induced by source paper "on some automorphisms of rational functions and their applications in rank metric codes"):
  with members:
    - "low rank parity check codes new decoding algorithms and applications to cryptography"
    - "reliable and secure multishot network coding using linearized reed solomon codes"
    - "maximal ferrers diagram codes constructions and genericity considerations"
    - "on the genericity of maximum rank distance and gabidulin codes"
    - "skew and linearized reed solomon codes and maximum sum rank distance codes over any division ring"
    - "new criteria for mrd and gabidulin codes and some rank metric code constructions"
    - "a singleton bound for generalized ferrers diagram rank metric codes"
    - "convolutional codes with maximum column sum rank for network streaming"

Connected through hyperedge HE-2 (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"
    - "coding for errors and erasures in random network coding"
    - "johnson type bounds on constant dimension codes"

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

Connected through hyperedge HE-4 (induced by source paper "subspace packings"):
  with members:
    - "grassmannian codes with new distance measures for network coding"
    - "construction of subspace codes through linkage"
    - "vector network coding based on subspace codes outperforms scalar linear network coding"

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"
    - "cyclic orbit codes"
    - "bounds on list decoding of rank metric codes"
    - "a rank metric approach to error control in random network coding"
    - "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 "optimal binary 5 3 projective space codes from maximal partial spreads"):
  with members:
    - "a rank metric approach to error control in random network coding"
    - "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"
    - "cyclic orbit codes"
    - "a rank metric approach to error control in random network coding"
    - "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"
    - "cyclic orbit codes"
    - "partial spreads in random network coding"
    - "new improvements on the echelon ferrers construction"

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)