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 "efficient systematic encoding of non binary vt codes"):
  Abstract: Varshamov-Tenengolts (VT) codes are a class of codes which can correct a single deletion or insertion with a linear-time decoder. This paper addresses the problem of efficient encoding of non-binary VT codes, defined over an alphabet of size $q >2$. We propose a simple linear-time encoding method to systematically map binary message sequences onto VT codewords. The method provides a new lower bound on the size of $q$-ary VT codes of length $n$.

Includes members:
  Member "coding for segmented edit channels":
    also connected through other hyperedges:
      (none)
  Member "guess check codes for deletions and synchronization":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "construction and redundancy of codes for correcting deletable errors")
  Member "multilayer codes for synchronization from deletions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "list decoding of deletions using guess check codes")
  Member "new multiple insertion deletion correcting codes for non binary alphabets":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "explicit formulas for the weight enumerators of some classes of deletion correcting 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")

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)