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: "every list decodable code for high noise has abundant near optimal rate puncturings"
  Abstract: We show that any q-ary code with sufficiently good distance can be randomly punctured to obtain, with high probability, a code that is list decodable up to radius $1 - 1/q - \epsilon$ with near-optimal rate and list sizes. Our results imply that "most" Reed-Solomon codes are list decodable beyond the Johnson bound, settling the long-standing open question of whether any Reed Solomon codes meet this criterion. #R##N#More precisely, we show that a Reed-Solomon code with random evaluation points is, with high probability, list decodable up to radius $1 - \epsilon$ with list sizes $O(1/\epsilon)$ and rate $\Omega(\epsilon)$. As a second corollary of our argument, we obtain improved bounds on the list decodability of random linear codes over large fields. #R##N#Our approach exploits techniques from high dimensional probability. Previous work used similar tools to obtain bounds on the list decodability of random linear codes, but the bounds did not scale with the size of the alphabet. In this paper, we use a chaining argument to deal with large alphabet sizes.

Connected through hyperedge HE-1 (induced by source paper "on error decoding of locally repairable and partial mds codes"):
  with members:
    - "on decoding and applications of interleaved goppa codes"
    - "universal and dynamic locally repairable codes with maximal recoverability via sum rank codes"
    - "improved power decoding of interleaved one point hermitian codes"
    - "a public key cryptosystem from interleaved goppa codes"
    - "list decoding of locally repairable codes"
    - "fractional decoding error correction from partial information"
    - "a complete classification of partial mds maximally recoverable codes with one global parity"
    - "decoding of interleaved reed solomon codes using improved power decoding"

Connected through hyperedge HE-2 (induced by source paper "generalized list decoding"):
  with members:
    - "list decodable linear regression"
    - "list decodable learning via sum of squares"
    - "list decodable robust mean estimation and learning mixtures of spherical gaussians"
    - "list decodable zero rate codes"
    - "an improved bound on the fraction of correctable deletions"
    - "upper bound on list decoding radius of binary codes"
    - "a characterization of the capacity of online causal binary channels"
    - "it ll probably work out improved list decoding through random operations"

Connected through hyperedge HE-3 (induced by source paper "ldpc codes achieve list decoding capacity"):
  with members:
    - "improved list decodability of random linear binary codes"
    - "improved decoding of folded reed solomon and multiplicity codes"
    - "linear time list recovery of high rate expander codes"
    - "analysis of boolean functions"
    - "on the list decodability of random linear codes with large error rates"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "folded codes from function field towers and improved optimal rate list decoding"
    - "restricted isometry of fourier matrices and list decodability of random linear codes"

Connected through hyperedge HE-4 (induced by source paper "reconstruction under outliers for fourier sparse functions"):
  with members:
    - "compressed sensing with adversarial sparse noise via l1 regression"
    - "a universal sampling method for reconstructing signals with simple fourier transforms"
    - "efficient algorithms for outlier robust regression"
    - "robust polynomial regression up to the information theoretic limit"
    - "fourier sparse interpolation without a frequency gap"
    - "nearly optimal deterministic algorithm for sparse walsh hadamard transform"
    - "corrupted sensing novel guarantees for separating structured signals"
    - "analysis of boolean functions"

Connected through hyperedge HE-5 (induced by source paper "list decoding random euclidean codes and infinite constellations"):
  with members:
    - "good distance lattices from high dimensional expanders"
    - "improved list decodability of random linear binary codes"
    - "quadratically constrained myopic adversarial channels"
    - "on the weight distribution of random binary linear codes"
    - "list decoding with double samplers"
    - "sufficiently myopic adversaries are blind"
    - "it ll probably work out improved list decoding through random operations"
    - "on the list decodability of random linear codes with large error rates"

Connected through hyperedge HE-6 (induced by source paper "combinatorial list decoding of reed solomon codes beyond the johnson radius"):
  with members:
    - "on the list decodability of random linear codes with large error rates"
    - "restricted isometry of fourier matrices and list decodability of random linear codes"
    - "on the list decodability of random linear codes"
    - "explicit codes achieving list decoding capacity error correction with optimal redundancy"

Connected through hyperedge HE-7 (induced by source paper "deep fri sampling outside the box improves soundness"):
  with members:
    - "on probabilistic checking in perfect zero knowledge"

Connected through hyperedge HE-8 (induced by source paper "improved list decodability of random linear binary codes"):
  with members:
    - "on the list decodability of random linear rank metric codes"
    - "linear time list recovery of high rate expander codes"
    - "it ll probably work out improved list decoding through random operations"
    - "optimal locally repairable codes via rank metric codes"
    - "bounds on list decoding of rank metric codes"
    - "on the list decodability of random linear codes with large error rates"
    - "error resilience in distributed storage via rank metric codes"
    - "folded codes from function field towers and improved optimal rate list decoding"

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)