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 formulas for the weight enumerators of some classes of deletion correcting codes"):
  Abstract: We introduce a general class of codes which includes several well-known classes of deletion/insertion correcting codes as special cases. For example, the Helberg code, the Levenshtein code, the Varshamov–Tenengolts code, and most variants of these codes including most of those which have been recently used in studying DNA-based data storage systems are all special cases of our code. Then, using a number theoretic method, we give an explicit formula for the weight enumerator of our code which in turn gives explicit formulas for the weight enumerators and for the sizes of all the aforementioned codes. We also obtain the size of the shifted Varshamov–Tenengolts code. Another application which automatically follows from our result is an explicit formula for the number of binary solutions of an  arbitrary  linear congruence which, to the best of our knowledge, is the first result of its kind in the literature and might be also of independent interest. Our general result might have more applications/implications in information theory, computer science, and mathematics.

Includes members:
  Member "codes correcting a burst of deletions or insertions":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "optimal codes correcting a burst of deletions of variable length")
  Member "an improved bound on the fraction of correctable deletions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "locally decodable codes with randomized encoding")
  Member "on an almost universal hash function family with applications to authentication and secrecy codes":
    also connected through other hyperedges:
      (none)
  Member "new multiple insertion deletion correcting codes for non binary alphabets":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "efficient systematic encoding of vt codes")
  Member "efficient low redundancy codes for correcting multiple deletions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "optimal codes correcting a burst of deletions of variable length")
  Member "an improvement to levenshtein s upper bound on the cardinality of deletion correcting codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "list decoding of deletions using guess check codes")
  Member "a deterministic polynomial time protocol for synchronizing from deletions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "polynomial time decodable codes for the binary deletion channel")

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)