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: "low complexity interactive algorithms for synchronization from deletions insertions and substitutions"
  Abstract: Consider two remote nodes having binary sequences    $X$    and    $Y$   , respectively.    $Y$    is an edited version of    ${X}$   , where the editing involves random deletions, insertions, and substitutions, possibly in bursts. The goal is for the node with    $Y$    to reconstruct    $X$    with minimal exchange of information over a noiseless link. The communication is measured in terms of both the total number of bits exchanged and the number of interactive rounds of communication. This paper focuses on the setting where the number of edits is    $o({n}/{\log~n})$   , where    $n$    is the length of    $X$   . We first consider the case where the edits are a mixture of insertions and deletions (indels), and propose an interactive synchronization algorithm with near-optimal communication rate and average computational complexity of    $O(n)$    arithmetic operations. The algorithm uses interaction to efficiently split the source sequence into substrings containing exactly one deletion or insertion. Each of these substrings is then synchronized using an optimal one-way algorithm based on the single-deletion correcting channel codes of Varshamov and Tenengolts. We then build on this synchronization algorithm in three different ways. First, it is modified to work with a single round of interaction. The reduction in the number of rounds comes at the expense of higher communication, which is quantified. Next, we present an extension to the practically important case where the insertions and deletions may occur in (potentially large) bursts. Finally, we show how to synchronize the sources to within a target Hamming distance. This feature can be used to differentiate between substitution and indel edits. In addition to theoretical performance bounds, we provide several validating simulation results for the proposed algorithms.

Connected through hyperedge HE-1 (induced by source paper "list decoding of deletions using guess check codes"):
  with members:
    - "list decoding of insertions and deletions"
    - "codes correcting two deletions"
    - "multilayer codes for synchronization from deletions"
    - "guess check codes for deletions insertions and synchronization"
    - "coding against deletions in oblivious and online models"
    - "efficient low redundancy codes for correcting multiple deletions"
    - "deletion codes in the high noise and high rate regimes"
    - "an improvement to levenshtein s upper bound on the cardinality of deletion correcting codes"

Connected through hyperedge HE-2 (induced by source paper "guess check codes for deletions insertions and synchronization"):
  with members:
    - "guess check codes for deletions and synchronization"
    - "codes in the damerau distance for dna storage"
    - "efficiently decodable insertion deletion codes for high noise and high rate regimes"
    - "coding against deletions in oblivious and online models"
    - "efficient low redundancy codes for correcting multiple deletions"
    - "achievable rates for channels with deletions and insertions"
    - "an improvement to levenshtein s upper bound on the cardinality of deletion correcting codes"
    - "a deterministic polynomial time protocol for synchronizing from deletions"

Connected through hyperedge HE-3 (induced by source paper "multilayer codes for synchronization from deletions and insertions"):
  with members:
    - "list decoding of deletions using guess check codes"
    - "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"
    - "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"
    - "synchronization from deletions through interactive communication"

Connected through hyperedge HE-4 (induced by source paper "guess check codes for deletions and synchronization"):
  with members:
    - "codes in the damerau distance for dna storage"
    - "efficient low redundancy codes for correcting multiple deletions"
    - "deletion codes in the high noise and high rate regimes"
    - "achievable rates for channels with deletions and insertions"
    - "an improvement to levenshtein s upper bound on the cardinality of deletion correcting codes"
    - "a deterministic polynomial time protocol for synchronizing from deletions"

Connected through hyperedge HE-5 (induced by source paper "efficient systematic encoding of vt codes"):
  with members:
    - "new multiple insertion deletion correcting codes for non binary alphabets"
    - "efficient low redundancy codes for correcting multiple deletions"
    - "deletion codes in the high noise and high rate regimes"
    - "synchronization from deletions through interactive communication"

Connected through hyperedge HE-6 (induced by source paper "exact reconstruction from insertions in synchronization codes"):
  with members:
    - "codes in the damerau distance for dna storage"
    - "duplication correcting codes for data storage in the dna of living organisms"
    - "asymmetric lee distance codes for dna based storage"
    - "a rewritable random access dna based storage system"
    - "codes for dna sequence profiles"
    - "string reconstruction from substring compositions"
    - "codes for dna storage channels"
    - "a characterization of the number of subsequences obtained via the deletion channel"

Connected through hyperedge HE-7 (induced by source paper "examining the unique decodability of insertion correcting codes beyond the guarantee"):
  with members:
    - "list decoding of insertions and deletions"
    - "exact reconstruction from insertions in synchronization codes"
    - "codes correcting a burst of deletions or insertions"
    - "an improvement to levenshtein s upper bound on the cardinality of deletion correcting codes"

Connected through hyperedge HE-8 (induced by source paper "coding for interactive communication correcting insertions and deletions"):
  with members:
    - "an improved bound on the fraction of correctable deletions"
    - "efficient low redundancy codes for correcting multiple deletions"
    - "maximal noise in interactive communication over erasure channels and channels with feedback"
    - "interactive channel capacity revisited"
    - "deletion codes in the high noise and high rate regimes"
    - "adaptive protocols for interactive communication"
    - "optimal error rates for interactive coding i adaptivity and other settings"
    - "optimal error rates for interactive coding ii efficiency and list decoding"

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)