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 "deletion codes in the high noise and high rate regimes"):
  Abstract: The noise model of deletions poses significant challenges in coding theory, with basic questions like the capacity of the binary deletion channel still being open. In this paper, we study the harder model of worst-case deletions, with a focus on constructing efficiently decodable codes for the two extreme regimes of high-noise and high-rate. Specifically, we construct polynomial-time decodable codes with the following trade-offs (for any eps > 0): #R##N#(1) Codes that can correct a fraction 1-eps of deletions with rate poly(eps) over an alphabet of size poly(1/eps); #R##N#(2) Binary codes of rate 1-O~(sqrt(eps)) that can correct a fraction eps of deletions; and #R##N#(3) Binary codes that can be list decoded from a fraction (1/2-eps) of deletions with rate poly(eps) #R##N#Our work is the first to achieve the qualitative goals of correcting a deletion fraction approaching 1 over bounded alphabets, and correcting a constant fraction of bit deletions with rate aproaching 1. The above results bring our understanding of deletion code constructions in these regimes to a similar level as worst-case errors.

Includes members:
  Member "efficiently decodable insertion deletion codes for high noise and high rate regimes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (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-2 (induced by source paper "locally decodable codes with randomized encoding")
  Member "efficient low redundancy codes for correcting multiple deletions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimal codes correcting a burst of deletions of variable length")
  Member "generalized sphere packing bound":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "covering codes for insertions and deletions")
  Member "non asymptotic upper bounds for deletion correcting codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "duplication correcting codes")
  Member "on the zero error capacity threshold for deletion channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "an overview of capacity results for synchronization channels")
  Member "explicit codes achieving list decoding capacity error correction with optimal redundancy":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "beyond the guruswami sudan and parvaresh vardy radii folded reed solomon multiplicity and derivative 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)