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: "deterministic document exchange protocols and almost optimal binary codes for edit errors"
  Abstract: We study two basic problems regarding edit error, i.e. document exchange and error correcting codes for edit errors (insdel codes). For message length $n$ and edit error upper bound $k$, it is known that in both problems the optimal sketch size or the optimal number of redundant bits is $\Theta(k \log \frac{n}{k})$. However, known constructions are far from achieving these bounds. #R##N#We significantly improve previous results on both problems. For document exchange, we give an efficient deterministic protocol with sketch size $O(k\log^2 \frac{n}{k})$. This significantly improves the previous best known deterministic protocol, which has sketch size $O(k^2 + k \log^2 n)$ (Belazzougui15). For binary insdel codes, we obtain the following results: #R##N#1. An explicit binary insdel code which encodes an $n$-bit message $x$ against $k$ errors with redundancy $O(k \log^2 \frac{n}{k})$. In particular this implies an explicit family of binary insdel codes that can correct $\varepsilon$ fraction of insertions and deletions with rate $1-O(\varepsilon \log^2 (\frac{1}{\varepsilon}))=1-\widetilde{O}(\varepsilon)$. #R##N#2. An explicit binary insdel code which encodes an $n$-bit message $x$ against $k$ errors with redundancy $O(k \log n)$. This is the first explicit construction of binary insdel codes that has optimal redundancy for a wide range of error parameters $k$, and this brings our understanding of binary insdel codes much closer to that of standard binary error correcting codes. #R##N#In obtaining our results we introduce the notion of \emph{$\varepsilon$-self matching hash functions} and \emph{$\varepsilon$-synchronization hash functions}. We believe our techniques can have further applications in the literature.

Connected through hyperedge HE-1 (induced by source paper "locally decodable codes with randomized encoding"):
  with members:
    - "optimal document exchange and new codes for small number of insertions and deletions"
    - "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 "an overview of capacity results for synchronization channels"):
  with members:
    - "coding for deletion channels with multiple traces"
    - "coded trace reconstruction"
    - "coded trace reconstruction in a constant number of traces"
    - "optimally resilient codes for list decoding from insertions and deletions"
    - "zero error capacity of duplication channels"
    - "approximating edit distance within constant factor in truly sub quadratic time"
    - "maximum likelihood upper bounds on the capacities of discrete information stable channels"
    - "sharp analytical capacity upper bounds for sticky and related channels"

Connected through hyperedge HE-3 (induced by source paper "approximate similarity search under edit distance using locality sensitive hashing"):
  with members:
    - "constant factor approximation of near linear edit distance in near linear time"
    - "race sub linear memory sketches for approximate near neighbor search on streaming data"
    - "near linear time insertion deletion codes and 1 e approximating edit distance via indexing"
    - "constant factor approximations to edit distance on far input pairs in nearly linear time"
    - "approximate nearest neighbor search in high dimensions"
    - "set similarity search for skewed data"
    - "hardness of approximate nearest neighbor search"
    - "fast entropy bounded string dictionary look up with mismatches"

Connected through hyperedge HE-4 (induced by source paper "coded trace reconstruction"):
  with members:
    - "capacity results for the noisy shuffling channel"
    - "anchor based correction of substitutions in indexed sets"
    - "clustering correcting codes"
    - "coding for deletion channels with multiple traces"
    - "reconstructing trees from traces"
    - "beyond trace reconstruction population recovery from the deletion channel"
    - "trace reconstruction generalized and parameterized"
    - "sequence subset distance and coding for error control in dna based data storage"

Connected through hyperedge HE-5 (induced by source paper "optimally resilient codes for list decoding from insertions and deletions"):
  with members:
    - "list decoding of insertion and deletion codes"
    - "explicit constructions of two dimensional reed solomon codes in high insertion and deletion noise regime"
    - "near linear time insertion deletion codes and 1 e approximating edit distance via indexing"
    - "on the list decodability of insertions and deletions"
    - "general strong polarization"
    - "synchronization strings list decoding for insertions and deletions"
    - "optimal document exchange and new codes for insertions and deletions"
    - "block edit errors with transpositions deterministic document exchange protocols and almost optimal binary codes"

Connected through hyperedge HE-6 (induced by source paper "optimal k deletion correcting codes"):
  with members:
    - "optimal document exchange and new codes for small number of insertions and deletions"
    - "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-7 (induced by source paper "block edit errors with transpositions deterministic document exchange protocols and almost optimal binary codes"):
  with members:
    - "optimal document exchange and new codes for small number of insertions and deletions"
    - "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-8 (induced by source paper "optimal document exchange and new codes for insertions and deletions"):
  with members:
    - "optimal document exchange and new codes for small number of insertions and deletions"
    - "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"

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)