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 "optimal codes correcting a burst of deletions of variable length"):
  Abstract: In this paper, we present an efficiently encodable and decodable code construction that is capable of correction a burst of deletions of length at most $k$. The redundancy of this code is $\log n + k(k+1)/2\log \log n+c_k$ for some constant $c_k$ that only depends on $k$ and thus is scaling-optimal. The code can be split into two main components. First, we impose a constraint that allows to locate the burst of deletions up to an interval of size roughly $\log n$. Then, with the knowledge of the approximate location of the burst, we use several {shifted Varshamov-Tenengolts} codes to correct the burst of deletions, which only requires a small amount of redundancy since the location is already known up to an interval of small size. Finally, we show how to efficiently encode and decode the code.

Includes members:
  Member "zero error capacity of duplication channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "variable length coding for zero error channel capacity")
  Member "optimal k deletion correcting codes":
    also connected through other hyperedges:
      (none)
  Member "optimal document exchange and new codes for insertions and deletions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "an overview of capacity results for synchronization channels")
  Member "an improvement of non binary code correcting single b burst of insertions or deletions":
    also connected through other hyperedges:
      (none)
  Member "polynomial time decodable codes for the binary deletion channel":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "coded trace reconstruction in a constant number of traces")
  Member "synchronization strings codes for insertions and deletions approaching the singleton bound":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "locally decodable codes with randomized encoding")
  Member "duplication correcting codes for data storage in the dna of living organisms":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "codes in the space of multisets coding for permutation channels with impairments")
  Member "codes correcting a burst of deletions or insertions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the error probability of maximum likelihood decoding over two deletion 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)