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: "synchronization strings explicit constructions local decoding and applications"
  Abstract: This paper gives new results for synchronization strings, a powerful combinatorial object that allows to efficiently deal with insertions and deletions in various communication settings: #R##N#$\bullet$ We give a deterministic, linear time synchronization string construction, improving over an $O(n^5)$ time randomized construction. Independently of this work, a deterministic $O(n\log^2\log n)$ time construction was just put on arXiv by Cheng, Li, and Wu. We also give a deterministic linear time construction of an infinite synchronization string, which was not known to be computable before. Both constructions are highly explicit, i.e., the $i^{th}$ symbol can be computed in $O(\log i)$ time. #R##N#$\bullet$ This paper also introduces a generalized notion we call long-distance synchronization strings that allow for local and very fast decoding. In particular, only $O(\log^3 n)$ time and access to logarithmically many symbols is required to decode any index. #R##N#We give several applications for these results: #R##N#$\bullet$ For any $\delta 0$ we provide an insdel correcting code with rate $1-\delta-\epsilon$ which can correct any $O(\delta)$ fraction of insdel errors in $O(n\log^3n)$ time. This near linear computational efficiency is surprising given that we do not even know how to compute the (edit) distance between the decoding input and output in sub-quadratic time. We show that such codes can not only efficiently recover from $\delta$ fraction of insdel errors but, similar to [Schulman, Zuckerman; TransInf'99], also from any $O(\delta/\log n)$ fraction of block transpositions and replications. #R##N#$\bullet$ We show that highly explicitness and local decoding allow for infinite channel simulations with exponentially smaller memory and decoding time requirements. These simulations can be used to give the first near linear time interactive coding scheme for insdel errors.

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"
    - "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 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 "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"
    - "deterministic document exchange protocols and almost optimal binary codes for edit errors"
    - "optimal document exchange and new codes for insertions and deletions"

Connected through hyperedge HE-3 (induced by source paper "near linear time insertion deletion codes and 1 e approximating edit distance via indexing"):
  with members:
    - "approximating edit distance within constant factor in truly sub quadratic time"
    - "multivariate fine grained complexity of longest common subsequence"
    - "approximating edit distance in truly subquadratic time quantum and mapreduce"
    - "synchronization strings list decoding for insertions and deletions"
    - "synchronization strings channel simulations and interactive coding for insertions and deletions"
    - "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"

Connected through hyperedge HE-4 (induced by source paper "coded trace reconstruction in a constant number of traces"):
  with members:
    - "coding for deletion channels with multiple traces"
    - "coded trace reconstruction"
    - "beyond trace reconstruction population recovery from the deletion channel"
    - "trace reconstruction generalized and parameterized"
    - "unique reconstruction of coded strings from multiset substring spectra"
    - "capacity upper bounds for deletion type channels"
    - "average case reconstruction for the deletion channel subpolynomially many traces suffice"
    - "polynomial time decodable codes for the binary deletion channel"

Connected through hyperedge HE-5 (induced by source paper "bit flipping moment balancing schemes for insertion deletion and substitution error correction"):
  with members:
    - "synchronization strings list decoding for insertions and deletions"
    - "synchronization strings channel simulations and interactive coding for insertions and deletions"
    - "polynomial time decodable codes for the binary deletion channel"
    - "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"
    - "coding against deletions in oblivious and online models"
    - "codes correcting a burst of deletions or insertions"

Connected through hyperedge HE-6 (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"
    - "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 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-7 (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"
    - "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 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-8 (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 small number of insertions and deletions"
    - "optimal document exchange and new codes for insertions and deletions"
    - "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"

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)