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 subspace codes through linkage"
  Abstract: A construction is presented that allows to produce subspace codes of long length using subspace codes of shorter length in combination with a rank metric code. The subspace distance of the resulting code, called linkage code, is as good as the minimum subspace distance of the constituent codes. As a special application, the construction of the best known partial spreads is reproduced. Finally, for a special case of linkage, a decoding algorithm is presented which amounts to decoding with respect to the smaller constituent codes and which can be parallelized.

Connected through hyperedge HE-1 (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"
    - "subspace polynomials and cyclic subspace codes"
    - "subspace codes based on graph matchings ferrers diagrams and pending blocks"
    - "cyclic orbit codes and stabilizer subfields"
    - "cyclic orbit codes"
    - "coding for errors and erasures in random network coding"

Connected through hyperedge HE-2 (induced by source paper "new constructions of subspace codes using subsets of mrd codes in several blocks"):
  with members:
    - "rank distribution of delsarte codes"
    - "optimal ferrers diagram rank metric codes"
    - "a complete characterization of irreducible cyclic orbit codes and their plucker embedding"
    - "recursive code construction for random networks"
    - "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-3 (induced by source paper "a hierarchical based greedy algorithm for echelon ferrers construction"):
  with members:
    - "subspace codes based on graph matchings ferrers diagrams and pending blocks"
    - "subspace codes from ferrers diagrams"
    - "problems on q analogs in coding theory"
    - "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-4 (induced by source paper "construction of const dimension codes from serval parallel lift mrd code"):
  with members:
    - "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"
    - "johnson type bounds on constant dimension codes"

Connected through hyperedge HE-5 (induced by source paper "subspace packings"):
  with members:
    - "grassmannian codes with new distance measures for network coding"
    - "vector network coding based on subspace codes outperforms scalar linear network coding"
    - "construction of large constant dimension codes with a prescribed minimum distance"

Connected through hyperedge HE-6 (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"
    - "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"
    - "subspace codes from ferrers diagrams"

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)