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 "multilayer codes for synchronization from deletions and insertions"):
  Abstract: Consider two remote nodes (encoder and decoder), each with a binary sequence. The encoder's sequence $X$ differs from the decoder's sequence $Y$ by a small number of edits (deletions and insertions). The goal is to construct a message $M$, to be sent via a one-way error free link, such that the decoder can reconstruct $X$ using $M$ and $Y$. In this paper, we devise a coding scheme for this one-way synchronization model. The scheme is based on multiple layers of Varshamov-Tenenglots (VT) codes combined with off-the-shelf linear error-correcting codes, and uses a list decoder. We bound the expected list size of the decoder under certain assumptions, and validate its performance via numerical simulations. We also consider an alternative decoder that uses only the constraints from the VT codes (i.e., does not require a linear code), and achieves a smaller synchronization rate at the expense of a slightly larger average list size.

Includes members:
  Member "list decoding of deletions using guess check codes":
    also connected through other hyperedges:
      (none)
  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 "list decoding of insertions and deletions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimally resilient codes for list decoding from insertions and deletions")
  Member "guess check codes for deletions insertions and synchronization":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "optimal k deletion correcting codes")
  Member "edit distance sketching streaming and document exchange":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "streaming with oracle new streaming algorithms for edit distance and lcs")
  Member "efficient low redundancy codes for correcting multiple deletions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "optimal codes correcting a burst of deletions of variable length")
  Member "low complexity interactive algorithms for synchronization from deletions insertions and substitutions":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "list decoding of deletions using guess check 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)