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 "synchronization from deletions through interactive communication"):
  Abstract: In this paper, we consider a synchronization problem between nodes $A$ and $B$ that are connected through a two--way communication channel. {Node $A$} contains a binary file $X$ of length $n$ and node $B$ contains a binary file $Y$ that is generated by randomly deleting bits from $X$, by a small deletion rate $\beta$. The location of deleted bits is not known to either node $A$ or node $B$. We offer a deterministic synchronization scheme between nodes $A$ and $B$ that needs $O(n\beta\log \frac{1}{\beta})$ transmissions and reconstructs $X$ at node $B$ with probability of error that is exponentially low in the size of $X$. The rate of our scheme matches the optimal rate for this channel. Our scheme can be extended to other editing models, e.g., insertions, repetitions or replacements, as long as the rate of editing is small.

Includes members:
  Member "achievable rates for channels with deletions and insertions":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "an overview of capacity results for synchronization channels")
  Member "efficient file synchronization a distributed source coding approach":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "guess check codes for deletions insertions and synchronization")
  Member "on the deletion channel with small deletion probability":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "an overview of capacity results for synchronization channels")

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)