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: "rank distribution of delsarte codes"
  Abstract: In analogy with the Singleton defect for classical codes, we propose a definition of rank defect for Delsarte rank-metric codes. We characterize codes whose rank defect and dual rank defect are both zero, and prove that the rank distribution of such codes is determined by their parameters. This extends a result by Delsarte on the rank distribution of MRD codes. In the general case of codes of positive defect, we show that the rank distribution is determined by the parameters of the code, together the number of codewords of small rank. Moreover, we prove that if the rank defect of a code and its dual are both one, and the dimension satisfies a divisibility condition, then the number of minimum-rank codewords and dual minimum-rank codewords is the same. Finally, we discuss how our results specialize to Gabidulin 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"
    - "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-2 (induced by source paper "construction of const dimension codes from serval parallel lift mrd code"):
  with members:
    - "construction of subspace codes through linkage"
    - "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-3 (induced by source paper "construction of const dimension code from two parallel versions of linkage construction"):
  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-4 (induced by source paper "partition balanced families of codes and asymptotic enumeration in coding theory"):
  with members:
    - "maximal ferrers diagram codes constructions and genericity considerations"
    - "codes endowed with the rank metric"
    - "on the genericity of maximum rank distance and gabidulin codes"
    - "repairing the faure loidreau public key cryptosystem"
    - "automorphism groups of gabidulin like codes"
    - "polynomial time key recovery attack on the faure loidreau scheme based on gabidulin codes"
    - "algebraic structures of mrd codes"
    - "rank metric codes and their duality theory"

Connected through hyperedge HE-5 (induced by source paper "codes endowed with the rank metric"):
  with members:
    - "duality of codes supported on regular lattices with an application to enumerative combinatorics"
    - "rank metric codes and their duality theory"
    - "subspace codes from ferrers diagrams"
    - "on metrics for error correction in network coding"
    - "a rank metric approach to error control in random network coding"
    - "coding for errors and erasures in random network coding"
    - "macwilliams identity for codes with the rank metric"

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)