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: "optimal rate list decoding via derivative codes"
  Abstract: The classical family of $[n,k]_q$ Reed-Solomon codes over a field $\F_q$ consist of the evaluations of polynomials $f \in \F_q[X]$ of degree $< k$ at $n$ distinct field elements. In this work, we consider a closely related family of codes, called (order $m$) {\em derivative codes} and defined over fields of large characteristic, which consist of the evaluations of $f$ as well as its first $m-1$ formal derivatives at $n$ distinct field elements. For large enough $m$, we show that these codes can be list-decoded in polynomial time from an error fraction approaching $1-R$, where $R=k/(nm)$ is the rate of the code. This gives an alternate construction to folded Reed-Solomon codes for achieving the optimal trade-off between rate and list error-correction radius. Our decoding algorithm is linear-algebraic, and involves solving a linear system to interpolate a multivariate polynomial, and then solving another structured linear system to retrieve the list of candidate polynomials $f$. The algorithm for derivative codes offers some advantages compared to a similar one for folded Reed-Solomon codes in terms of efficient unique decoding in the presence of side information.

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"
    - "folded algebraic geometric codes from galois extensions"
    - "explicit codes achieving list decoding capacity error correction with optimal redundancy"

Connected through hyperedge HE-2 (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-3 (induced by source paper "explicit constructions of two dimensional reed solomon codes in high insertion and deletion noise regime"):
  with members:
    - "on list decoding of insertion and deletion errors"
    - "on the list decodability of insertions and deletions"
    - "synchronization strings list decoding for insertions and deletions"
    - "synchronization strings codes for insertions and deletions approaching the singleton bound"
    - "efficiently decodable insertion deletion codes for high noise and high rate regimes"
    - "maximum likelihood decoding of reed solomon codes is np hard"

Connected through hyperedge HE-4 (induced by source paper "synchronization strings list decoding for insertions and deletions"):
  with members:
    - "list decoding of insertions and deletions"
    - "synchronization strings channel simulations and interactive coding for insertions and deletions"
    - "synchronization strings explicit constructions local decoding and applications"
    - "local list recovery of high rate tensor codes and applications"
    - "optimal rate list decoding over bounded alphabets using algebraic geometric codes"
    - "synchronization strings codes for insertions and deletions approaching the singleton bound"
    - "efficiently decodable insertion deletion codes for high noise and high rate regimes"
    - "linear time list recovery of high rate expander codes"

Connected through hyperedge HE-5 (induced by source paper "some remarks on multiplicity codes"):
  with members:
    - "local correctability of expander codes"
    - "high rate locally correctable codes via lifting"
    - "new affine invariant codes from lifting"
    - "on lines and joints"
    - "explicit codes achieving list decoding capacity error correction with optimal redundancy"

Connected through hyperedge HE-6 (induced by source paper "list decoding group homomorphisms between supersolvable groups"):
  with members:
    - "group homomorphisms as error correcting codes"
    - "linear algebraic list decoding of folded reed solomon codes"
    - "list decoding tensor products and interleaved codes"
    - "explicit codes achieving list decoding capacity error correction with optimal redundancy"

Connected through hyperedge HE-7 (induced by source paper "group homomorphisms as error correcting codes"):
  with members:
    - "list decoding group homomorphisms between supersolvable groups"
    - "linear algebraic list decoding of folded reed solomon codes"
    - "subspace evasive sets"
    - "explicit codes achieving list decoding capacity error correction with optimal redundancy"

Connected through hyperedge HE-8 (induced by source paper "list decoding subspace codes from insertions and deletions"):
  with members:
    - "linear algebraic list decoding of folded reed solomon codes"
    - "fast encoding and decoding of gabidulin codes"
    - "a rank metric approach to error control in random network coding"
    - "coding for errors and erasures in random network coding"
    - "explicit codes achieving list decoding capacity error correction with optimal redundancy"

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)