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: "a deterministic polynomial time protocol for synchronizing from deletions"
  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 a total of $O(n\beta\log \frac{1}{\beta})$ transmitted bits and reconstructs $X$ at node $B$ with probability of error that is exponentially low in the size of $X$. Orderwise, the rate of our scheme matches the optimal rate for this channel.

Connected through hyperedge HE-1 (induced by source paper "explicit formulas for the weight enumerators of some classes of deletion correcting codes"):
  with members:
    - "codes correcting a burst of deletions or insertions"
    - "an improved bound on the fraction of correctable deletions"
    - "on an almost universal hash function family with applications to authentication and secrecy codes"
    - "new multiple insertion deletion correcting codes for non binary alphabets"
    - "efficient low redundancy codes for correcting multiple deletions"
    - "an improvement to levenshtein s upper bound on the cardinality of deletion correcting codes"

Connected through hyperedge HE-2 (induced by source paper "polynomial time decodable codes for the binary deletion channel"):
  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"
    - "capacity upper bounds for deletion type channels"
    - "optimal document exchange and new codes 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"
    - "coding against deletions in oblivious and online models"
    - "an improved bound on the fraction of correctable deletions"

Connected through hyperedge HE-3 (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"
    - "low complexity interactive algorithms for synchronization from deletions insertions and substitutions"
    - "achievable rates for channels with deletions and insertions"
    - "an improvement to levenshtein s upper bound on the cardinality of deletion correcting codes"

Connected through hyperedge HE-4 (induced by source paper "codes for correcting localized deletions"):
  with members:
    - "guess check codes for deletions and synchronization"
    - "codes correcting two deletions"
    - "guess check codes for deletions insertions and synchronization"
    - "correcting bursty and localized deletions using guess check codes"
    - "codes correcting a burst of deletions or insertions"
    - "efficient low redundancy codes for correcting multiple deletions"
    - "an improvement to levenshtein s upper bound on the cardinality of deletion correcting codes"
    - "efficient file synchronization a distributed source coding approach"

Connected through hyperedge HE-5 (induced by source paper "correcting bursty and localized deletions using guess check codes"):
  with members:
    - "guess check codes for deletions and synchronization"
    - "codes correcting two deletions"
    - "guess check codes for deletions insertions and synchronization"
    - "polar coding for the binary erasure channel with deletions"
    - "codes correcting a burst of deletions or insertions"
    - "efficient low redundancy codes for correcting multiple deletions"
    - "an improvement to levenshtein s upper bound on the cardinality of deletion correcting codes"
    - "efficient file synchronization a distributed source coding approach"

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

Connected through hyperedge HE-7 (induced by source paper "an information theoretic analysis of deduplication"):
  with members:
    - "file updates under random arbitrary insertions and deletions"
    - "synchronizing edits in distributed storage networks"
    - "efficient file synchronization a distributed source coding approach"

Connected through hyperedge HE-8 (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"
    - "synchronization from deletions through interactive communication"

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)