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 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.

Connected through hyperedge HE-1 (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"
    - "low complexity interactive algorithms for synchronization from deletions insertions and substitutions"

Connected through hyperedge HE-2 (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"
    - "low complexity interactive algorithms for synchronization from deletions insertions and substitutions"
    - "deletion codes in the high noise and high rate regimes"

Connected through hyperedge HE-3 (induced by source paper "multilayer codes for synchronization from deletions"):
  with members:
    - "efficient low redundancy codes for correcting multiple deletions"
    - "efficient file synchronization a distributed source coding approach"

Connected through hyperedge HE-4 (induced by source paper "file updates under random arbitrary insertions and deletions"):
  with members:
    - "low complexity interactive algorithms for synchronization from deletions insertions and substitutions"
    - "synchronizing rankings via interactive communication"
    - "synchronizing edits in distributed storage networks"
    - "bounds on the capacity of random insertion and deletion additive noise channels"
    - "a compression algorithm using mis aligned side information"
    - "efficient file synchronization a distributed source coding approach"
    - "on the deletion channel with small deletion probability"

Connected through hyperedge HE-5 (induced by source paper "low complexity interactive algorithms for synchronization from deletions insertions and substitutions"):
  with members:
    - "synchronizing rankings via interactive communication"
    - "a compression algorithm using mis aligned side information"
    - "a deterministic polynomial time protocol for synchronizing from deletions"

Connected through hyperedge HE-6 (induced by source paper "synchronizing edits in distributed storage networks"):
  with members:
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "explicit maximally recoverable codes with locality"
    - "update efficiency and local repairability limits for capacity approaching codes"
    - "a characterization of the number of subsequences obtained via the deletion channel"
    - "a deterministic polynomial time protocol for synchronizing from deletions"
    - "on the locality of codeword symbols"
    - "efficient file synchronization a distributed source coding approach"
    - "explicit construction of optimal exact regenerating codes for distributed storage"

Connected through hyperedge HE-7 (induced by source paper "synchronizing rankings via interactive communication"):
  with members:
    - "error correction in flash memories via codes in the ulam metric"

Connected through hyperedge HE-8 (induced by source paper "a deterministic polynomial time protocol for synchronizing from deletions"):
  with members:
    - "efficient file synchronization a distributed source coding approach"
    - "on the deletion channel with small deletion probability"

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)