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 "zero error capacity of duplication channels"):
  Abstract: This paper is motivated by the problem of error-free communication through the i.i.d. duplication channel which acts on the transmitted sequence by inserting a random number of duplicates of each symbol next to the original symbol. A construction of optimal codes correcting all patterns of errors of this type is described, and the zero-error capacity of the duplication channel is determined. A generalization of these results to channel models in which blocks of $ \ell $ consecutive symbols are being duplicated, and which are inspired by DNA-based data storage systems where the stored molecules are subject to tandem-duplication mutations, is also given.

Includes members:
  Member "runlength limited sequences and shift correcting codes asymptotic analysis":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "asymptotically optimal codes correcting fixed length duplication errors in dna storage systems")
  Member "bounds and constructions for multi symbol duplication error correcting codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "optimal constant weight codes under l_1 metric")
  Member "asymptotically optimal codes correcting fixed length duplication errors in dna storage systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimal constant weight codes under l_1 metric")
  Member "the capacity of some p olya string models":
    also connected through other hyperedges:
      (none)
  Member "sharp analytical capacity upper bounds for sticky and related channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "an overview of capacity results for synchronization channels")
  Member "on the capacity of channels with timing synchronization errors":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "an overview of capacity results for synchronization 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)