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 "explicit and efficient constructions of coding schemes for the binary deletion channel and the poisson repeat channel"):
  Abstract: This work gives an explicit construction of a family of error correcting codes for the binary deletion channel and for the Poisson repeat channel. In the binary deletion channel with parameter $p$ (BDC$_p$) every bit is deleted independently with probability $p$. A lower bound of $(1-p)/9$ is known on the capacity of the BDC$_p$ \cite{mitzenmacher2006simple}, yet no explicit construction is known to achieve this rate. We give an explicit family of codes of rate $(1-p)/16$, for every $p$. This improves upon the work of Guruswami and Li \cite{guruswami2017efficiently} that gave a construction of rate $(1-p)/120$. The codes in our family have polynomial time encoding and decoding algorithms. #R##N#Another channel considered in this work is the Poisson repeat channel with parameter $\lambda$ (PRC$_{\lambda}$) in which every bit is replaced with a discrete Poisson number of copies of that bit, where the number of copies has mean $\lambda$. We show that our construction works for this channel as well. As far as we know, this is the first explicit construction of an error correcting code for PRC$_{\lambda}$.

Includes members:
  Member "capacity upper bounds for deletion type channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (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-2 (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-3 (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-4 (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-5 (induced by source paper "locally decodable codes with randomized encoding")
  Member "a new bound for the capacity of the deletion channel with high deletion probabilities":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "capacity upper bounds for deletion type channels")

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)