human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "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.

Includes members:
  Member "synchronizing rankings via interactive communication":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "file updates under random arbitrary insertions and deletions")
  Member "a compression algorithm using mis aligned side information":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "scalable string reconciliation by recursive content dependent shingling")
  Member "a deterministic polynomial time protocol for synchronizing from deletions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "explicit formulas for the weight enumerators of some classes of deletion correcting codes")
  Member "synchronization from deletions through interactive communication":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "multilayer codes for synchronization from deletions and insertions")

Question: Please tell me which class the source paper 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)