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 "covering codes for insertions and deletions"):
  Abstract: A covering code is a set of codewords with the property that the union of balls, suitably defined, around these codewords covers an entire space. Generally, the goal is to find the covering code with the minimum size codebook. While most prior work on covering codes has focused on the Hamming metric, we consider the problem of designing covering codes defined in terms of insertions and deletions. First, we provide new sphere-covering lower bounds on the minimum possible size of such codes. Then, we provide new existential upper bounds on the size of optimal covering codes for a single insertion or a single deletion that are tight up to a constant factor. Finally, we derive improved upper bounds for covering codes using $R\geq 2$ insertions or deletions. We prove that codes exist with density that is only a factor $O(R \log R)$ larger than the lower bounds for all fixed $R$. In particular, our upper bounds have an optimal dependence on the word length, and we achieve asymptotic density matching the best known bounds for Hamming distance covering codes.

Includes members:
  Member "an overview of capacity results for synchronization channels":
    also connected through other hyperedges:
      (none)
  Member "near linear time insertion deletion codes and 1 e approximating edit distance via indexing":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "approximate similarity search under edit distance using locality sensitive hashing")
  Member "optimally resilient codes for list decoding from insertions and deletions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "an overview of capacity results for synchronization channels")
  Member "polynomial time decodable codes for the binary deletion channel":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimal codes correcting a burst of deletions of variable length")
  Member "an improved bound on the fraction of correctable deletions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "locally decodable codes with randomized encoding")
  Member "locality sensitive hashing without false negatives":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "similarity problems in high dimensions")
  Member "coding for interactive communication correcting insertions and deletions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "efficient multiparty interactive coding for insertions deletions and substitutions")
  Member "generalized sphere packing bound":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "generalized sphere packing bound for subblock constrained 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)