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: "correcting bursty and localized deletions using guess check codes"
  Abstract: We consider the problem of constructing binary codes for correcting deletions that are localized within certain parts of the codeword that are unknown a priori. The model that we study is when $\delta \leq w$ deletions occur in a window of size at most $w$ bits. These $\delta$ deletions are not necessarily consecutive, but are restricted to the window of size $w$. The localized deletions model is a generalization of the bursty model, in which all the deleted bits are consecutive. In this paper, we propose new explicit codes, based on the family of Guess & Check codes [1,2], that can correct, with high probability, $\delta \leq w$ deletions that are localized within a single window of size at most $w=\mathcal{O}(\log k)$, where $k$ is the length of the information message. These codes have efficient deterministic encoding and decoding algorithms; and logarithmic redundancy in $k$. We also generalize these codes to deletions that are localized within multiple windows in the codeword.

Connected through hyperedge HE-1 (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"
    - "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"
    - "a deterministic polynomial time protocol for synchronizing from deletions"
    - "efficient file synchronization a distributed source coding approach"

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)