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: "list decoding of subspace codes and rank metric codes up to singleton bound"
  Abstract: Subspace codes and rank-metric codes can be used to correct errors and erasures in network, with linear network coding. Subspace codes were introduced by Koetter and Kschischang to correct errors and erasures in networks where topology is unknown (the noncoherent case). In a previous work, we have developed a family of subspace codes, based upon the Koetter-Kschichang construction, which are efficiently list decodable. Using these codes, we achieved a better decoding radius than Koetter-Kschischiang codes at low rates. Herein, we introduce a new family of subspace codes based upon a different approach which leads to a linear-algebraic list-decoding algorithm. The resulting error correction radius can be expressed as follows: for any integer $s$, our list-decoder using $s+1$-interpolation polynomials guarantees successful recovery of the message subspace provided the normalized dimension of errors is at most $s(1-sR)$. The same list-decoding algorithm can be used to correct erasures as well as errors. The size of output list is at most $Q^{s-1}$, where $Q$ is the size of the field that message symbols are chosen from. Rank-metric codes are suitable for error correction in the case where the network topology and the underlying network code are known (the coherent case). Gabidulin codes are a well-known class of algebraic rank-metric codes that meet the Singleton bound on the minimum rank metric of a code. In this paper, we introduce a folded version of Gabidulin codes analogous to the folded Reed-Solomon codes of Guruswami and Rudra along with a list-decoding algorithm for such codes. Our list-decoding algorithm makes it possible to recover the message provided that the normalized rank of error is at most $1-R-\epsilon$, for any $\epsilon > 0$. Notably this achieves the information theoretic bound on the decoding radius of a rank-metric code.

Connected through hyperedge HE-1 (induced by source paper "list and probabilistic unique decoding of folded subspace codes"):
  with members:
    - "list and unique error erasure decoding of interleaved gabidulin codes with interpolation techniques"
    - "efficient interpolation based decoding of interleaved subspace and gabidulin codes"
    - "explicit rank metric codes list decodable with optimal redundancy"
    - "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"
    - "general linearized polynomial interpolation and its applications"
    - "packing and covering properties of subspace codes for error control in random linear network coding"

Connected through hyperedge HE-2 (induced by source paper "a new class of rank metric codes and their list decoding beyond the unique decoding radius"):
  with members:
    - "some gabidulin codes cannot be list decoded efficiently at any radius"
    - "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"
    - "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"

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"
    - "bounds on list decoding gabidulin codes"
    - "list decoding subspace codes from insertions and deletions"
    - "decoding of subspace codes a problem of schubert calculus over finite fields"
    - "plucker embedding of cyclic orbit codes"

Connected through hyperedge HE-4 (induced by source paper "gabidulin decoding via minimal bases of linearized polynomial modules"):
  with members:
    - "grobner bases for linearized polynomials"
    - "iterative list decoding of gabidulin codes via gr obner based interpolation"
    - "list decoding gabidulin codes via interpolation and the euclidean algorithm"
    - "explicit rank metric codes list decodable with optimal redundancy"
    - "bounds on list decoding of rank metric codes"
    - "error resilience in distributed storage via rank metric codes"
    - "general linearized polynomial interpolation and its applications"
    - "a parametric approach to list decoding of reed solomon codes using interpolation"

Connected through hyperedge HE-5 (induced by source paper "efficient interpolation based decoding of interleaved subspace and gabidulin codes"):
  with members:
    - "list and unique error erasure decoding of interleaved gabidulin codes with interpolation techniques"
    - "bounds for projective codes from semidefinite programming"
    - "bounds on list decoding of rank metric codes"
    - "list decoding of lifted gabidulin codes via the plucker embedding"
    - "general linearized polynomial interpolation and its applications"
    - "recursive code construction for random networks"
    - "error correcting codes in projective spaces via rank metric codes and ferrers diagrams"
    - "a rank metric approach to error control in random network coding"

Connected through hyperedge HE-6 (induced by source paper "list and unique error erasure decoding of interleaved gabidulin codes with interpolation techniques"):
  with members:
    - "bounds for projective codes from semidefinite programming"
    - "bounds on list decoding of rank metric codes"
    - "general linearized polynomial interpolation and its applications"
    - "linear algebraic list decoding of folded reed solomon codes"
    - "recursive code construction for random networks"
    - "fast encoding and decoding of gabidulin codes"
    - "error correcting codes in projective spaces via rank metric codes and ferrers diagrams"
    - "a rank metric approach to error control in random network coding"

Connected through hyperedge HE-7 (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"
    - "bounds on list decoding gabidulin codes"
    - "list decoding subspace codes from insertions and deletions"
    - "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-8 (induced by source paper "problems on q analogs in coding theory"):
  with members:
    - "a complete characterization of irreducible cyclic orbit codes and their plucker embedding"
    - "new lower bounds for constant dimension codes"
    - "bounds for projective codes from semidefinite programming"
    - "cyclic orbit codes"
    - "list decoding of lifted gabidulin codes via the plucker embedding"
    - "isometry and automorphisms of constant dimension codes"
    - "list decoding subspace codes from insertions and deletions"
    - "decoding of subspace codes a problem of schubert calculus over finite fields"

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)