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: "on the genericity of maximum rank distance and gabidulin codes"
  Abstract: We consider linear rank-metric codes in #N#                  #N#                    #N#                  #N#                  $${\mathbb {F}}_{q^m}^n$$#N#                  #N#                    #N#                  #N#                . We show that the properties of being maximum rank distance (MRD) and non-Gabidulin are generic over the algebraic closure of the underlying field, which implies that over a large extension field a randomly chosen generator matrix generates an MRD and a non-Gabidulin code with high probability. Moreover, we give upper bounds on the respective probabilities in dependence on the extension degree m.

Connected through hyperedge HE-1 (induced by source paper "equivalence and characterizations of linear rank metric codes based on invariants"):
  with members:
    - "on the security of a loidreau s rank metric code based encryption scheme"
    - "invariants and inequivalence of linear rank metric codes"
    - "random construction of partial mds codes"
    - "systematic encoders for generalized gabidulin codes and the q analogue of cauchy matrices"
    - "generalized gabidulin codes over fields of any characteristic"
    - "new criteria for mrd and gabidulin codes and some rank metric code constructions"
    - "further generalisations of twisted gabidulin codes"
    - "space time codes based on rank metric codes and their decoding"

Connected through hyperedge HE-2 (induced by source paper "on some automorphisms of rational functions and their applications in rank metric codes"):
  with members:
    - "low rank parity check codes new decoding algorithms and applications to cryptography"
    - "reliable and secure multishot network coding using linearized reed solomon codes"
    - "maximal ferrers diagram codes constructions and genericity considerations"
    - "skew and linearized reed solomon codes and maximum sum rank distance codes over any division ring"
    - "new criteria for mrd and gabidulin codes and some rank metric code constructions"
    - "a singleton bound for generalized ferrers diagram rank metric codes"
    - "convolutional codes with maximum column sum rank for network streaming"
    - "subspace codes from ferrers diagrams"

Connected through hyperedge HE-3 (induced by source paper "an explicit construction of optimal streaming codes for channels with burst and arbitrary erasures"):
  with members:
    - "low field size rate optimal streaming codes for channels with burst and random erasures"
    - "optimal multiplexed erasure codes for streaming messages with different decoding delays"
    - "an explicit rate optimal streaming code for channels with burst and arbitrary erasures"
    - "optimal streaming codes for channels with burst and arbitrary erasures"
    - "systematic encoders for generalized gabidulin codes and the q analogue of cauchy matrices"
    - "rate optimal streaming codes for channels with burst and isolated erasures"
    - "new criteria for mrd and gabidulin codes and some rank metric code constructions"
    - "layered constructions for low delay streaming codes"

Connected through hyperedge HE-4 (induced by source paper "interleaving loidreau s rank metric cryptosystem"):
  with members:
    - "low rank parity check codes new decoding algorithms and applications to cryptography"
    - "on the security of a loidreau s rank metric code based encryption scheme"
    - "decoding high order interleaved rank metric codes"
    - "on decoding and applications of interleaved goppa codes"
    - "a public key cryptosystem from interleaved goppa codes"
    - "repairing the faure loidreau public key cryptosystem"
    - "further generalisations of twisted gabidulin codes"
    - "new algorithms for decoding in the rank metric and an attack on the lrpc cryptosystem"

Connected through hyperedge HE-5 (induced by source paper "mathbb f _ q n linear rank distance codes and their distinguishers"):
  with members:
    - "partition balanced families of codes and asymptotic enumeration in coding theory"
    - "new criteria for mrd and gabidulin codes and some rank metric code constructions"
    - "automorphism groups of gabidulin like codes"
    - "fast operations on linearized polynomials and their applications in coding theory"
    - "rank metric codes and their duality theory"
    - "equivalence for rank metric and matrix codes and automorphism groups of gabidulin codes"

Connected through hyperedge HE-6 (induced by source paper "on the list decodability of rank metric codes"):
  with members:
    - "partition balanced families of codes and asymptotic enumeration in coding theory"
    - "automorphism groups of gabidulin like codes"
    - "fast operations on linearized polynomials and their applications in coding theory"
    - "equivalence for rank metric and matrix codes and automorphism groups of gabidulin codes"
    - "bounds on list decoding of rank metric codes"

Connected through hyperedge HE-7 (induced by source paper "on the sparseness of certain mrd codes"):
  with members:
    - "maximal ferrers diagram codes constructions and genericity considerations"
    - "partition balanced families of codes and asymptotic enumeration in coding theory"
    - "on metrics for error correction in network coding"
    - "a rank metric approach to error control in random network coding"

Connected through hyperedge HE-8 (induced by source paper "invariants and inequivalence of linear rank metric codes"):
  with members:
    - "on the security of a loidreau s rank metric code based encryption scheme"
    - "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"

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)