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: "generalized gabidulin codes over fields of any characteristic"
  Abstract: We generalise Gabidulin codes to the case of infinite fields, eventually with characteristic zero. For this purpose, we consider an abstract field extension and any automorphism in the Galois group. We derive some conditions on the automorphism to be able to have a proper notion of rank metric which is in coherence with linearized polynomials. Under these conditions, we generalize Gabidulin codes and provide a decoding algorithm which decode both errors and erasures. Then, we focus on codes over integer rings and how to decode them. We are then faced with the problem of the exponential growth of intermediate values, and to circumvent the problem, it is natural to propose to do computations modulo a prime ideal. For this, we study the reduction of generalized Gabidulin codes over number ideals codes modulo a prime ideal, and show they are classical Gabidulin codes. As a consequence, knowing side information on the size of the errors or the message, we can reduce the decoding problem over the integer ring to a decoding problem over a finite field. We also give examples and timings.

Connected through hyperedge HE-1 (induced by source paper "roos bound for skew cyclic codes in hamming and rank metric"):
  with members:
    - "skew polynomial rings and skew cyclic codes"
    - "random construction of partial mds codes"
    - "a sugiyama like decoding algorithm for convolutional codes"
    - "vector network coding based on subspace codes outperforms scalar linear network coding"
    - "on the roots and minimum rank distance of skew cyclic codes"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "generalization of gabidulin codes over fields of rational functions"
    - "universal secure network coding via rank metric codes"

Connected through hyperedge HE-2 (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"
    - "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-3 (induced by source paper "reed solomon codes over fields of characteristic zero"):
  with members:
    - "low rank matrix recovery using gabidulin codes in characteristic zero"
    - "guruswami sudan list decoding for complex reed solomon codes"
    - "an alternative decoding method for gabidulin codes in characteristic zero"
    - "syndrome decoding of reed solomon codes beyond half the minimum distance based on shift register synthesis"
    - "new list decoding algorithms for reed solomon and bch codes"

Connected through hyperedge HE-4 (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"
    - "fuzzy authentication using rank distance"
    - "new criteria for mrd and gabidulin codes and some rank metric code constructions"
    - "further generalisations of twisted gabidulin codes"

Connected through hyperedge HE-5 (induced by source paper "dual skew codes from annihilators transpose hamming ring extensions"):
  with members:
    - "peterson gorenstein zierler algorithm for skew rs codes"
    - "a sugiyama like decoding algorithm for convolutional codes"
    - "on skew polynomial codes and lattices from quotients of cyclic division algebras"
    - "a circulant approach to skew constacyclic codes"
    - "ideal codes over separable ring extensions"
    - "skew constacyclic codes over finite chain rings"

Connected through hyperedge HE-6 (induced by source paper "skew and linearized reed solomon codes and maximum sum rank distance codes over any division ring"):
  with members:
    - "matroidal structure of skew polynomial rings with application to network coding"
    - "convolutional codes in rank metric with application to random network coding"
    - "on the similarities between generalized rank and hamming weights and their applications to network coding"
    - "convolutional codes with maximum column sum rank for network streaming"
    - "generalization of gabidulin codes over fields of rational functions"
    - "universal secure network coding via rank metric codes"
    - "on partial unit memory codes based on gabidulin codes"
    - "multishot codes for network coding using rank metric 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)