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: "new lower bounds for constant dimension codes"
  Abstract: This paper provides new constructive lower bounds for constant dimension codes, using Ferrers diagram rank metric codes and pending blocks. Constructions for two families of parameters of constant dimension codes are presented. The examples of codes obtained by these constructions are the largest known constant dimension codes for the given parameters.

Connected through hyperedge HE-1 (induced by source paper "subspace codes from ferrers diagrams"):
  with members:
    - "generalized weights an anticode approach"
    - "subspace codes based on graph matchings ferrers diagrams and pending blocks"
    - "rank metric codes and their duality theory"
    - "optimal ferrers diagram rank metric codes"
    - "partial spreads in random network coding"
    - "new improvements on the echelon ferrers construction"
    - "an algebraic approach for decoding spread codes"
    - "large constant dimension codes and lexicodes"

Connected through hyperedge HE-2 (induced by source paper "optimal ferrers diagram rank metric codes"):
  with members:
    - "subspace codes based on graph matchings ferrers diagrams and pending blocks"
    - "subspace codes from ferrers diagrams"
    - "new improvements on the echelon ferrers construction"
    - "recursive code construction for random networks"
    - "on metrics for error correction in network coding"
    - "projective space codes for the injection metric"
    - "error correcting codes in projective spaces via rank metric codes and ferrers diagrams"
    - "a rank metric approach to error control in random network coding"

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"
    - "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"
    - "algebraic list decoding of subspace 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)