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: "recursive code construction for random networks"
  Abstract: A modification of Ko?tter-Kschischang codes for random networks is presented (these codes were also studied by Wang in the context of authentication problems). The new codes have higher information rate, while maintaining the same error-correcting capabilities. An efficient error-correcting algorithm is proposed for these codes.

Connected through hyperedge HE-1 (induced by source paper "new constructions of subspace codes using subsets of mrd codes in several blocks"):
  with members:
    - "construction of subspace codes through linkage"
    - "rank distribution of delsarte codes"
    - "optimal ferrers diagram rank metric codes"
    - "a complete characterization of irreducible cyclic orbit codes and their plucker embedding"
    - "error correcting codes in projective spaces via rank metric codes and ferrers diagrams"
    - "a rank metric approach to error control in random network coding"
    - "coding for errors and erasures in random network coding"

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

Connected through hyperedge HE-3 (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-4 (induced by source paper "on the geometry of balls in the grassmannian and list decoding of lifted gabidulin codes"):
  with members:
    - "explicit rank metric codes list decodable with optimal redundancy"
    - "cyclic orbit codes"
    - "bounds on list decoding of rank metric codes"
    - "list decoding of lifted gabidulin codes via the plucker embedding"
    - "bounds on list decoding gabidulin codes"
    - "list decoding subspace codes from insertions and deletions"
    - "decoding of subspace codes a problem of schubert calculus over finite fields"
    - "list decoding of subspace codes and rank metric codes up to singleton bound"

Connected through hyperedge HE-5 (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"
    - "on conjugacy classes of subgroups of the general linear group and cyclic orbit codes"
    - "new improvements on the echelon ferrers construction"
    - "an algebraic approach for decoding spread codes"
    - "spread decoding in extension fields"

Connected through hyperedge HE-6 (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"
    - "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"
    - "a rank metric approach to error control in random network coding"

Connected through hyperedge HE-7 (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"
    - "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-8 (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 lower bounds for constant dimension codes"
    - "new improvements on the echelon ferrers construction"
    - "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"

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)