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: "bounds on list decoding gabidulin codes"
  Abstract: An open question about Gabidulin codes is whether polynomial-time list decoding beyond half the minimum distance is possible or not. In this contribution, we give a lower and an upper bound on the list size, i.e., the number of codewords in a ball around the received word. The lower bound shows that if the radius of this ball is greater than the Johnson radius, this list size can be exponential and hence, no polynomial-time list decoding is possible. The upper bound on the list size uses subspace properties.

Connected through hyperedge HE-1 (induced by source paper "on the list decodability of self orthogonal rank metric codes"):
  with members:
    - "on the list decodability of random linear rank metric codes"
    - "on the list decodability of random self orthogonal codes"
    - "on self dual mrd codes"
    - "bounds on list decoding of rank metric codes"
    - "a rank metric approach to error control in random network coding"
    - "coding for errors and erasures in random network coding"
    - "packing and covering properties of rank metric codes"

Connected through hyperedge HE-2 (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"
    - "some gabidulin codes cannot be list decoded efficiently at any radius"
    - "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"
    - "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-3 (induced by source paper "on the geometry of balls in the grassmannian and list decoding of lifted gabidulin codes"):
  with members:
    - "explicit rank metric codes list decodable with optimal redundancy"
    - "cyclic orbit codes"
    - "bounds on list decoding of rank metric codes"
    - "list decoding of lifted gabidulin codes via the plucker embedding"
    - "list decoding subspace codes from insertions and deletions"
    - "decoding of subspace codes a problem of schubert calculus over finite fields"
    - "list decoding of subspace codes and rank metric codes up to singleton bound"
    - "plucker embedding of cyclic orbit codes"

Connected through hyperedge HE-4 (induced by source paper "on list decodability of random rank metric codes"):
  with members:
    - "on the geometry of balls in the grassmannian and list decoding of lifted gabidulin codes"
    - "explicit rank metric codes list decodable with optimal redundancy"
    - "list decoding subspace codes from insertions and deletions"
    - "list decoding of subspace codes and rank metric codes up to singleton bound"
    - "on the list decodability of random linear codes"
    - "coding for errors and erasures in random network coding"
    - "packing and covering properties of rank metric codes"

Connected through hyperedge HE-5 (induced by source paper "list decoding of lifted gabidulin codes via the plucker embedding"):
  with members:
    - "cyclic orbit codes"
    - "list decoding subspace codes from insertions and deletions"
    - "decoding of subspace codes a problem of schubert calculus over finite fields"
    - "list decoding of subspace codes and rank metric codes up to singleton bound"
    - "plucker embedding of cyclic orbit codes"
    - "new improvements on the echelon ferrers construction"
    - "codes and designs related to lifted mrd codes"
    - "recursive code construction for random networks"

Connected through hyperedge HE-6 (induced by source paper "bounds on list decoding of rank metric codes"):
  with members:
    - "bounds for projective codes from semidefinite programming"
    - "list decoding of subspace codes and rank metric codes up to singleton bound"
    - "general linearized polynomial interpolation and its applications"
    - "recursive code construction for random networks"
    - "fast encoding and decoding of gabidulin codes"
    - "enumerative coding for grassmannian space"
    - "error correcting codes in projective spaces via rank metric codes and ferrers diagrams"
    - "a rank metric approach to error control in random network coding"

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)