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 codes achieving list decoding capacity error correction with optimal redundancy"
  Abstract: We present error-correcting codes that achieve the information-theoretically best possible trade-off between the rate and error-correction radius. Specifically, for every $0   0$, we present an explicit construction of error-correcting codes of rate $R$ that can be list decoded in polynomial time up to a fraction $(1-R-\eps)$ of {\em worst-case} errors. At least theoretically, this meets one of the central challenges in algorithmic coding theory. #R##N#Our codes are simple to describe: they are {\em folded Reed-Solomon codes}, which are in fact {\em exactly} Reed-Solomon (RS) codes, but viewed as a code over a larger alphabet by careful bundling of codeword symbols. Given the ubiquity of RS codes, this is an appealing feature of our result, and in fact our methods directly yield better decoding algorithms for RS codes when errors occur in {\em phased bursts}. #R##N#The alphabet size of these folded RS codes is polynomial in the block length. We are able to reduce this to a constant (depending on $\eps$) using ideas concerning ``list recovery'' and expander-based codes from \cite{GI-focs01,GI-ieeejl}. Concatenating the folded RS codes with suitable inner codes also gives us polynomial time constructible binary codes that can be efficiently list decoded up to the Zyablov bound, i.e., up to twice the radius achieved by the standard GMD decoding of concatenated codes.

Connected through hyperedge HE-1 (induced by source paper "beyond the guruswami sudan and parvaresh vardy radii folded reed solomon multiplicity and derivative codes"):
  with members:
    - "some remarks on multiplicity codes"
    - "linear algebraic list decoding of folded reed solomon codes"
    - "subspace evasive sets"
    - "optimal rate list decoding via derivative codes"
    - "folded algebraic geometric codes from galois extensions"

Connected through hyperedge HE-2 (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-3 (induced by source paper "on list decoding of insertion and deletion errors"):
  with members:
    - "near linear time insertion deletion codes and 1 e approximating edit distance via indexing"
    - "on the list decodability of insertions and deletions"
    - "synchronization strings list decoding for insertions and deletions"
    - "list decoding of insertions and deletions"
    - "bounds on codes correcting tandem and palindromic duplications"
    - "synchronization strings codes for insertions and deletions approaching the singleton bound"
    - "efficiently decodable insertion deletion codes for high noise and high rate regimes"
    - "codes correcting a burst of deletions or insertions"

Connected through hyperedge HE-4 (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"
    - "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"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "folded codes from function field towers and improved optimal rate list decoding"

Connected through hyperedge HE-5 (induced by source paper "combinatorial list decoding of reed solomon codes beyond the johnson radius"):
  with members:
    - "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"
    - "restricted isometry of fourier matrices and list decodability of random linear codes"
    - "on the list decodability of random linear codes"

Connected through hyperedge HE-6 (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"
    - "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"
    - "error resilience in distributed storage via rank metric codes"

Connected through hyperedge HE-7 (induced by source paper "improved decoding of folded reed solomon and multiplicity codes"):
  with members:
    - "average radius list recovery of random linear codes it really ties the room together"
    - "linear time list recovery of high rate expander codes"
    - "high rate locally correctable and locally testable codes with sub polynomial query complexity"
    - "list decoding algorithms for lifted codes"
    - "folded codes from function field towers and improved optimal rate list decoding"
    - "subspace evasive sets"

Connected through hyperedge HE-8 (induced by source paper "synchronization strings codes for insertions and deletions approaching the singleton bound"):
  with members:
    - "synchronization strings channel simulations and interactive coding for insertions and deletions"
    - "synchronization strings explicit constructions local decoding and applications"
    - "efficiently decodable insertion deletion codes for high noise and high rate regimes"
    - "coding for interactive communication correcting insertions and deletions"
    - "edit distance cannot be computed in strongly subquadratic time unless seth is false"
    - "interactive channel capacity revisited"
    - "deletion codes in the high noise and high rate regimes"
    - "an entropy sumset inequality and polynomially fast convergence to shannon capacity over all alphabets"

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)