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: "some gabidulin codes cannot be list decoded efficiently at any radius"
  Abstract: Gabidulin codes can be seen as the rank-metric equivalent of Reed-Solomon codes. It was recently proven, using subspace polynomials, that Gabidulin codes cannot be list decoded beyond the so-called Johnson radius. In another result, cyclic subspace codes were constructed by inspecting the connection between subspaces and their subspace polynomials. In this paper, these subspace codes are used to prove two bounds on the list size in decoding certain Gabidulin codes. The first bound is an existential one, showing that exponentially-sized lists exist for codes with specific parameters. The second bound presents exponentially-sized lists explicitly, for a different set of parameters. Both bounds rule out the possibility of efficiently list decoding several families of Gabidulin codes for any radius beyond half the minimum distance. Such a result was known so far only for non-linear rank-metric codes, and not for Gabidulin codes. Using a standard operation called lifting, identical results also follow for an important class of constant dimension subspace codes.

Connected through hyperedge HE-1 (induced by source paper "randomized decoding of gabidulin codes beyond the unique decoding radius"):
  with members:
    - "on the list decodability of rank metric codes"
    - "ramesses a rank metric encryption scheme with short keys"
    - "an algebraic attack on rank metric code based cryptosystems"
    - "polynomial time key recovery attack on the faure loidreau scheme based on gabidulin codes"
    - "bounds on list decoding of rank metric codes"
    - "on the complexity of the rank syndrome decoding problem"
    - "a basis for all solutions of the key equation for gabidulin codes"
    - "a rank metric approach to error control in random network coding"

Connected through hyperedge HE-2 (induced by source paper "repairing the faure loidreau public key cryptosystem"):
  with members:
    - "polynomial time key recovery attack on the faure loidreau scheme based on gabidulin codes"
    - "list and unique error erasure decoding of interleaved gabidulin codes with interpolation techniques"
    - "bounds on list decoding of rank metric codes"
    - "on the complexity of the rank syndrome decoding problem"
    - "key reduction of mceliece s cryptosystem using list decoding"

Connected through hyperedge HE-3 (induced by source paper "on the list decodability of random linear rank metric codes"):
  with members:
    - "average radius list recovery of random linear codes it really ties the room together"
    - "every list decodable code for high noise has abundant near optimal rate puncturings"
    - "on the list decodability of random linear codes with large error rates"
    - "bounds on list decoding gabidulin codes"
    - "on identity testing of tensors low rank recovery and compressed sensing"
    - "restricted isometry of fourier matrices and list decodability of random linear codes"
    - "on the list decodability of random linear codes"
    - "a rank metric approach to error control in random network coding"

Connected through hyperedge HE-4 (induced by source paper "list decoding of insertions and deletions"):
  with members:
    - "bounds on codes correcting tandem and palindromic duplications"
    - "exact reconstruction from insertions in synchronization codes"
    - "duplication correcting codes for data storage in the dna of living organisms"
    - "examining the unique decodability of insertion correcting codes beyond the guarantee"
    - "codes correcting a burst of deletions or insertions"
    - "efficient low redundancy codes for correcting multiple deletions"
    - "bounds on list decoding of rank metric codes"

Connected through hyperedge HE-5 (induced by source paper "an alternative decoding method for gabidulin codes in characteristic zero"):
  with members:
    - "fast operations on linearized polynomials and their applications in coding theory"
    - "solving shift register problems over skew polynomial rings using module minimisation"
    - "recovering low rank matrices from few coefficients in any basis"
    - "exact matrix completion via convex optimization"
    - "coding for errors and erasures in random network coding"

Connected through hyperedge HE-6 (induced by source paper "a new class of rank metric codes and their list decoding beyond the unique decoding radius"):
  with members:
    - "list and unique error erasure decoding of interleaved gabidulin codes with interpolation techniques"
    - "bounds on list decoding of rank metric codes"
    - "list decoding subspace codes from insertions and deletions"
    - "list decoding of subspace codes and rank metric codes up to singleton bound"
    - "folded codes from function field towers and improved optimal rate list decoding"
    - "on identity testing of tensors low rank recovery and compressed sensing"
    - "subspace evasive sets"
    - "error correcting codes in projective spaces via rank metric codes and ferrers diagrams"

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)