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: "explicit rank metric codes list decodable with optimal redundancy"
  Abstract: We construct an explicit family of linear rank-metric codes over any field ${\mathbb F}_h$ that enables efficient list decoding up to a fraction $\rho$ of errors in the rank metric with a rate of $1-\rho-\epsilon$, for any desired $\rho \in (0,1)$ and $\epsilon > 0$. Previously, a Monte Carlo construction of such codes was known, but this is in fact the first explicit construction of positive rate rank-metric codes for list decoding beyond the unique decoding radius. #R##N#Our codes are subcodes of the well-known Gabidulin codes, which encode linearized polynomials of low degree via their values at a collection of linearly independent points. The subcode is picked by restricting the message polynomials to an ${\mathbb F}_h$-subspace that evades the structured subspaces over an extension field ${\mathbb F}_{h^t}$ that arise in the linear-algebraic list decoder for Gabidulin codes due to Guruswami and Xing (STOC'13). This subspace is obtained by combining subspace designs contructed by Guruswami and Kopparty (FOCS'13) with subspace evasive varieties due to Dvir and Lovett (STOC'12). #R##N#We establish a similar result for subspace codes, which are a collection of subspaces, every pair of which have low-dimensional intersection, and which have received much attention recently in the context of network coding. We also give explicit subcodes of folded Reed-Solomon (RS) codes with small folding order that are list-decodable (in the Hamming metric) with optimal redundancy, motivated by the fact that list decoding RS codes reduces to list decoding such folded RS codes. However, as we only list decode a subcode of these codes, the Johnson radius continues to be the best known error fraction for list decoding RS codes.

Connected through hyperedge HE-1 (induced by source paper "row reduction applied to decoding of rank metric and subspace codes"):
  with members:
    - "low rank matrix recovery using gabidulin codes in characteristic zero"
    - "decoding interleaved gabidulin codes using alekhnovich s algorithm"
    - "an alternative decoding method for gabidulin codes in characteristic zero"
    - "sub quadratic decoding of one point hermitian codes"
    - "fast operations on linearized polynomials and their applications in coding theory"
    - "solving shift register problems over skew polynomial rings using module minimisation"
    - "power decoding reed solomon codes up to the johnson radius"
    - "generalised multi sequence shift register synthesis using module minimisation"

Connected through hyperedge HE-2 (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"
    - "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"
    - "list decoding of subspace codes and rank metric codes up to singleton bound"
    - "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-3 (induced by source paper "on the geometry of balls in the grassmannian and list decoding of lifted gabidulin codes"):
  with members:
    - "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"
    - "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 "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"
    - "bounds on list decoding of rank metric codes"
    - "error resilience in distributed storage via rank metric codes"
    - "list decoding of subspace codes and rank metric codes up to singleton bound"
    - "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 "dimension expanders via rank condensers"):
  with members:
    - "deterministic truncation of linear matroids"
    - "pseudorandomness for multilinear read once algebraic branching programs in any order"
    - "folded codes from function field towers and improved optimal rate list decoding"
    - "on identity testing of tensors low rank recovery and compressed sensing"
    - "quasi polynomial hitting set for set depth delta formulas"
    - "fast matrix rank algorithms and applications"
    - "linear algebraic list decoding of folded reed solomon codes"
    - "subspace evasive sets"

Connected through hyperedge HE-6 (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"
    - "bounds on list decoding gabidulin codes"
    - "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"

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)