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: "equivalence for rank metric and matrix codes and automorphism groups of gabidulin codes"
  Abstract: For a growing number of applications such as cellular, peer-to-peer, and sensor networks, efficient error-free transmission of data through a network is essential. Toward this end, K\"{o}tter and Kschischang propose the use of subspace codes to provide error correction in the network coding context. The primary construction for subspace codes is the lifting of rank-metric or matrix codes, a process that preserves the structural and distance properties of the underlying code. Thus, to characterize the structure and error-correcting capability of these subspace codes, it is valuable to perform such a characterization of the underlying rank-metric and matrix codes. This paper lays a foundation for this analysis through a framework for classifying rank-metric and matrix codes based on their structure and distance properties. #R##N#To enable this classification, we extend work by Berger on equivalence for rank-metric codes to define a notion of equivalence for matrix codes, and we characterize the group structure of the collection of maps that preserve such equivalence. We then compare the notions of equivalence for these two related types of codes and show that matrix equivalence is strictly more general than rank-metric equivalence. Finally, we characterize the set of equivalence maps that fix the prominent class of rank-metric codes known as Gabidulin codes. In particular, we give a complete characterization of the rank-metric automorphism group of Gabidulin codes, correcting work by Berger, and give a partial characterization of the matrix-automorphism group of the expanded matrix codes that arise from Gabidulin codes.

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"
    - "on the genericity of maximum rank distance and gabidulin codes"
    - "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"

Connected through hyperedge HE-2 (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"
    - "on the genericity of maximum rank distance and gabidulin codes"
    - "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"

Connected through hyperedge HE-3 (induced by source paper "a geometric approach to rank metric codes and a classification of constant weight codes"):
  with members:
    - "on defining generalized rank weights"
    - "relative generalized rank weight of linear codes and its applications to network coding"
    - "on the similarities between generalized rank and hamming weights and their applications to network coding"
    - "generalized weights an anticode approach"
    - "generalized rank weights a duality statement"

Connected through hyperedge HE-4 (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"
    - "on the genericity of maximum rank distance and gabidulin codes"
    - "automorphism groups of gabidulin like codes"
    - "fast operations on linearized polynomials and their applications in coding theory"
    - "bounds on list decoding of rank metric codes"

Connected through hyperedge HE-5 (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"
    - "on the genericity of maximum rank distance and gabidulin codes"
    - "new criteria for mrd and gabidulin codes and some rank metric code constructions"

Connected through hyperedge HE-6 (induced by source paper "systematic encoders for generalized gabidulin codes and the q analogue of cauchy matrices"):
  with members:
    - "systematic maximum sum rank codes"
    - "equivalence and characterizations of linear rank metric codes based on invariants"
    - "random construction of partial mds codes"
    - "partition balanced families of codes and asymptotic enumeration in coding theory"
    - "on the genericity of maximum rank distance and gabidulin codes"
    - "generalized gabidulin codes over fields of any characteristic"
    - "fuzzy authentication using rank distance"
    - "new criteria for mrd and gabidulin codes and some rank metric code constructions"

Connected through hyperedge HE-7 (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"
    - "algebraic structures of mrd codes"

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

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)