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: "algebraic structures of mrd codes"
  Abstract: Based on results in finite geometry we prove the existence of MRD codes in (F_q)_(n,n) with minimum distance n which are essentially different from Gabidulin codes. The construction results from algebraic structures which are closely related to those of finite fields. Some of the results may be known to experts, but to our knowledge have never been pointed out explicitly in the literature.

Connected through hyperedge HE-1 (induced by source paper "partitions of matrix spaces with an application to q rook polynomials"):
  with members:
    - "a polymatroid approach to generalized weights of rank metric codes"
    - "rank metric codes and q polymatroids"
    - "maximal ferrers diagram codes constructions and genericity considerations"
    - "codes endowed with the rank metric"
    - "adversarial network coding"
    - "relative generalized matrix weights of matrix codes for universal security on wire tap networks"
    - "duality of codes supported on regular lattices with an application to enumerative combinatorics"
    - "on the similarities between generalized rank and hamming weights and their applications to network coding"

Connected through hyperedge HE-2 (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"
    - "construction of subspace codes through linkage"
    - "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"

Connected through hyperedge HE-3 (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"
    - "rank distribution of delsarte codes"
    - "rank metric codes and their duality theory"

Connected through hyperedge HE-4 (induced by source paper "on the genericity of maximum rank distance and gabidulin codes"):
  with members:
    - "new criteria for mrd and gabidulin codes and some rank metric code constructions"
    - "equivalence for rank metric and matrix codes and automorphism groups of gabidulin codes"

Connected through hyperedge HE-5 (induced by source paper "fuzzy authentication using rank distance"):
  with members:
    - "on the genericity of maximum rank distance and gabidulin codes"
    - "new criteria for mrd and gabidulin codes and some rank metric code constructions"
    - "on burst error correction and storage security of noisy data"
    - "subspace fuzzy vault"
    - "on fuzzy syndrome hashing with ldpc coding"
    - "fast encoding and decoding of gabidulin codes"
    - "coding solutions for the secure biometric storage problem"

Connected through hyperedge HE-6 (induced by source paper "new criteria for mrd and gabidulin codes and some rank metric code constructions"):
  with members:
    - "extension of overbeck s attack for gabidulin based cryptosystems"
    - "equivalence for rank metric and matrix codes and automorphism groups of gabidulin codes"

Connected through hyperedge HE-7 (induced by source paper "on dually almost mrd codes"):
  with members:
    - "relative generalized rank weight of linear codes and its applications to network coding"
    - "on self dual mrd codes"
    - "rank weight hierarchy of some classes of cyclic codes"
    - "generalized weights an anticode approach"
    - "rank metric codes and their duality theory"
    - "generalized rank weights a duality statement"
    - "universal secure network coding via rank metric codes"
    - "on metrics for error correction in network coding"

Connected through hyperedge HE-8 (induced by source paper "construction of subspace codes through linkage"):
  with members:
    - "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"
    - "an algebraic approach for decoding spread 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)