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 "guess check codes for deletions insertions and synchronization"):
  Abstract: We consider the problem of constructing codes that can correct $\delta$ deletions occurring in an arbitrary binary string of length $n$ bits. Varshamov-Tenengolts (VT) codes, dating back to 1965, are zero-error single deletion $(\delta=1)$ correcting codes, and have an asymptotically optimal redundancy. Finding similar codes for $\delta \geq 2$ deletions remains an open problem. In this work, we relax the standard zero-error (i.e., worst-case) decoding requirement by assuming that the positions of the $\delta$ deletions (or insertions) are independent of the codeword. Our contribution is a new family of explicit codes, that we call Guess & Check (GC) codes, that can correct with high probability up to a constant number of $\delta$ deletions (or insertions). GC codes are systematic; and have deterministic polynomial time encoding and decoding algorithms. We also describe the application of GC codes to file synchronization.

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 in the damerau distance for dna storage":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "reconstruction codes for dna sequences with uniform tandem duplication errors")
  Member "efficiently decodable insertion deletion codes for high noise and high rate regimes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "locally decodable codes with randomized encoding")
  Member "coding against deletions in oblivious and online models":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "an overview of capacity results for synchronization channels")
  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 "low complexity interactive algorithms for synchronization from deletions insertions and substitutions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "list decoding of deletions using guess check codes")
  Member "achievable rates for channels with deletions and insertions":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "an overview of capacity results for synchronization channels")
  Member "an improvement to levenshtein s upper bound on the cardinality of deletion correcting codes":
    also connected through other hyperedges:
      - Hyperedge HE-8 (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)