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 document exchange and new codes for small number of insertions and deletions"
  Abstract: This paper gives a communication-optimal document exchange protocol and an efficient near optimal derandomization. This also implies drastically improved error correcting codes for small number of adversarial insertions and deletions. #R##N#For any $n$ and $k < n$ our randomized hashing scheme takes any $n$-bit file $F$ and computes a $O(k \log \frac{n}{k})$-bit summary from which one can reconstruct $F$ given a related file $F'$ with edit distance $ED(F,F') \leq k$. #R##N#The size of our summary is information-theoretically order optimal for all values of $k$, positively answering a question of Orlitsky. It also is the first non-trivial solution when a small constant fraction of symbols have been edited, producing an optimal summary of size $O(H(\delta)n)$ for $k=\delta n$. This concludes a long series of better-and-better protocols which produce larger summaries for sub-linear values of $k$. In particular, the recent break-through of [Belazzougi, Zhang; STOC'16] assumes that $k < n^\epsilon$ and produces a summary of size $O(k\log^2 k + k\log n)$. #R##N#We also give an efficient derandomization with near optimal summary size $O(k \log^2 \frac{n}{k})$ improving, for every $k$, over a deterministic $O(k^2 + k \log^2 n)$ document exchange scheme by Belazzougi. This directly leads to near optimal systematic error correcting codes which efficiently can recover from any $k$ insertions and deletions while having $\Theta(k \log^2 \frac{n}{k})$ bits of redundancy. For the setting of $k=n\epsilon$ this $O(\epsilon \log^2 \frac{1}{\epsilon} \cdot n)$-bit redundancy is near optimal and a quadratic improvement over the binary codes of Guruswami and Li and Haeupler, Shahrasbi and Vitercik which have redundancy $\Theta\left(\sqrt{\epsilon} \log^{O(1)} \frac{1}{\epsilon} \cdot n\right)$.

Connected through hyperedge HE-1 (induced by source paper "locally decodable codes with randomized encoding"):
  with members:
    - "deterministic document exchange protocols and almost optimal binary codes for edit errors"
    - "block edit errors with transpositions deterministic document exchange protocols and almost optimal binary codes"
    - "synchronization strings channel simulations and interactive coding for insertions and deletions"
    - "synchronization strings explicit constructions local decoding and applications"
    - "synchronization strings efficient and fast deterministic constructions over small alphabets"
    - "synchronization strings codes for insertions and deletions approaching the singleton bound"
    - "efficiently decodable insertion deletion codes for high noise and high rate regimes"
    - "an improved bound on the fraction of correctable deletions"

Connected through hyperedge HE-2 (induced by source paper "optimal k deletion correcting codes"):
  with members:
    - "deterministic document exchange protocols and almost optimal binary codes for edit errors"
    - "two deletion correcting codes from indicator vectors"
    - "optimal document exchange and new codes for insertions and deletions"
    - "codes correcting two deletions"
    - "guess check codes for deletions insertions and synchronization"
    - "efficient low redundancy codes for correcting multiple deletions"
    - "deletion codes in the high noise and high rate regimes"

Connected through hyperedge HE-3 (induced by source paper "block edit errors with transpositions deterministic document exchange protocols and almost optimal binary codes"):
  with members:
    - "deterministic document exchange protocols and almost optimal binary codes for edit errors"
    - "optimal document exchange and new codes for insertions and deletions"
    - "synchronization strings channel simulations and interactive coding for insertions and deletions"
    - "synchronization strings explicit constructions local decoding and applications"
    - "synchronization strings efficient and fast deterministic constructions over small alphabets"
    - "synchronization strings codes for insertions and deletions approaching the singleton bound"
    - "efficiently decodable insertion deletion codes for high noise and high rate regimes"
    - "edit distance sketching streaming and document exchange"

Connected through hyperedge HE-4 (induced by source paper "optimal document exchange and new codes for insertions and deletions"):
  with members:
    - "deterministic document exchange protocols and almost optimal binary codes for edit errors"
    - "synchronization strings channel simulations and interactive coding for insertions and deletions"
    - "synchronization strings explicit constructions local decoding and applications"
    - "synchronization strings codes for insertions and deletions approaching the singleton bound"
    - "efficiently decodable insertion deletion codes for high noise and high rate regimes"
    - "edit distance sketching streaming and document exchange"
    - "an improved bound on the fraction of correctable deletions"
    - "efficient deterministic single round document exchange for edit distance"

Connected through hyperedge HE-5 (induced by source paper "deterministic document exchange protocols and almost optimal binary codes for edit errors"):
  with members:
    - "optimal document exchange and new codes for insertions and deletions"
    - "synchronization strings explicit constructions local decoding and applications"
    - "synchronization strings efficient and fast deterministic constructions over small alphabets"
    - "synchronization strings codes for insertions and deletions approaching the singleton bound"
    - "efficiently decodable insertion deletion codes for high noise and high rate regimes"
    - "edit distance sketching streaming and document exchange"
    - "an improved bound on the fraction of correctable deletions"
    - "efficient deterministic single round document exchange for edit distance"

Connected through hyperedge HE-6 (induced by source paper "sharp analytical capacity upper bounds for sticky and related channels"):
  with members:
    - "capacity upper bounds for deletion type channels"
    - "on the capacity of channels with timing synchronization errors"
    - "bounds on the capacity of random insertion and deletion additive noise channels"
    - "achievable rates for channels with deletions and insertions"
    - "achievable rates for noisy channels with synchronization errors"
    - "novel bounds on the capacity of the binary deletion channel"

Connected through hyperedge HE-7 (induced by source paper "polynomial time decodable codes for the binary deletion channel"):
  with members:
    - "deterministic document exchange protocols and almost optimal binary codes for edit errors"
    - "capacity upper bounds for deletion type channels"
    - "optimal document exchange and new codes 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"
    - "coding against deletions in oblivious and online models"
    - "an improved bound on the fraction of correctable deletions"
    - "efficient low redundancy codes for correcting multiple deletions"

Connected through hyperedge HE-8 (induced by source paper "multilayer codes for synchronization from deletions and insertions"):
  with members:
    - "list decoding of deletions using guess check codes"
    - "deterministic document exchange protocols and almost optimal binary codes for edit errors"
    - "list decoding of insertions and deletions"
    - "guess check codes for deletions insertions and synchronization"
    - "edit distance sketching streaming and document exchange"
    - "efficient low redundancy codes for correcting multiple deletions"
    - "low complexity interactive algorithms for synchronization from deletions insertions and substitutions"
    - "synchronization from deletions through interactive communication"

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.DS(Data Structures and Algorithms)