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 k deletion correcting codes"):
  Abstract: Levenshtein introduced the problem of constructing $k$-deletion correcting codes in 1966, proved that the optimal redundancy of those codes is $O(k\log N)$, and proposed an optimal redundancy single-deletion correcting code (using the so-called VT construction). However, the problem of constructing optimal redundancy $k$-deletion correcting codes remained open. Our key contribution is a solution to this longstanding open problem. We present a $k$-deletion correcting code that has redundancy $8k\log n +o(\log n)$ and encoding/decoding algorithms of complexity $O(n^{2k+1})$ for constant $k$.

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 "two deletion correcting codes from indicator vectors":
    also connected through other hyperedges:
      (none)
  Member "optimal document exchange and new codes for insertions and deletions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimal codes correcting a burst of deletions of variable length")
  Member "codes correcting two deletions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "tutorial on algebraic deletion correction codes")
  Member "guess check codes for deletions insertions and synchronization":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "list decoding of deletions using guess check codes")
  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 "deletion codes in the high noise and high rate regimes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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)