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 "on the list decodability of insertions and deletions"):
  Abstract: List decoding of insertions and deletions is studied. A Johnson-type upper bound on the maximum list size is derived. The bound is meaningful only when insertions occur. The result implies that, there are binary codes that are potentially list-decodable from a $0.707$-fraction of insertions in polynomial time. For non-binary code, for any constant $\tau >0$, there are codes over constant-sized alphabets that achieve a constant list size for a list-decoding radius that is $\tau$ times larger than the code length. Efficient encoding and decoding algorithms are also presented for codes with list-decoding radius approaching the above bound. Based on the Johnson-type bound, a Plotkin-type upper bound on the code size in the Levenshtein metric is derived.

Includes members:
  Member "synchronization strings list decoding for insertions and deletions":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "an overview of capacity results for synchronization channels")
  Member "list decoding of insertions and deletions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "optimally resilient codes for list decoding from insertions and deletions")
  Member "synchronization strings explicit constructions local decoding and applications":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "locally decodable codes with randomized encoding")
  Member "synchronization strings efficient and fast deterministic constructions over small alphabets":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "locally decodable codes with randomized encoding")
  Member "synchronization strings codes for insertions and deletions approaching the singleton bound":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "locally decodable codes with randomized encoding")
  Member "efficiently decodable insertion deletion codes for high noise and high rate regimes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "locally decodable codes with randomized encoding")
  Member "an improved bound on the fraction of correctable deletions":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "locally decodable codes with randomized encoding")
  Member "deletion codes in the high noise and high rate regimes":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "locally decodable codes with randomized encoding")

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)