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 "polynomial time decodable codes for the binary deletion channel"):
  Abstract: In the random deletion channel, each bit is deleted independently with probability $p$. For the random deletion channel, the existence of codes of rate $(1-p)/9$, and thus bounded away from $0$ for any $p   0$.

Includes members:
  Member "optimal document exchange and new codes for small number of insertions and deletions":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "locally decodable codes with randomized encoding")
  Member "deterministic document exchange protocols and almost optimal binary codes for edit errors":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "locally decodable codes with randomized encoding")
  Member "capacity upper bounds for deletion type channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "an overview of capacity results for synchronization channels")
  Member "optimal document exchange and new codes for insertions and deletions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "optimal codes correcting a burst of deletions of variable length")
  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 "coding against deletions in oblivious and online models":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "an overview of capacity results for synchronization channels")
  Member "an improved bound on the fraction of correctable deletions":
    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)