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 "codes for correcting localized deletions"):
  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 are localized in a window of size $w$ bits. These $\delta$ deletions do not necessarily occur in consecutive positions, 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 construct new explicit codes for the localized model, based on the family of Guess & Check codes which was previously introduced by the authors. The codes that we construct can correct, with high probability, $\delta \leq w$ deletions that are localized in a single window of size $w$, where $w$ grows with the block length. Moreover, these codes are systematic; have low redundancy; and have efficient deterministic encoding and decoding algorithms. We also generalize these codes to deletions that are localized within multiple windows in the codeword.

Includes members:
  Member "guess check codes for deletions and synchronization":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "construction and redundancy of codes for correcting deletable errors")
  Member "codes correcting two deletions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "optimal k deletion correcting codes")
  Member "guess check codes for deletions insertions and synchronization":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimal k deletion correcting codes")
  Member "correcting bursty and localized deletions using guess check codes":
    also connected through other hyperedges:
      (none)
  Member "codes correcting a burst of deletions or insertions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "optimal codes correcting a burst of deletions of variable length")
  Member "efficient low redundancy codes for correcting multiple deletions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "optimal codes correcting a burst of deletions of variable length")
  Member "an improvement to levenshtein s upper bound on the cardinality of deletion correcting codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "explicit formulas for the weight enumerators of some classes of deletion correcting codes")
  Member "a deterministic polynomial time protocol for synchronizing from deletions":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "explicit formulas for the weight enumerators of some classes of deletion correcting codes")

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)