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 "codes correcting all patterns of tandem duplication errors of maximum length 3"):
  Abstract: The set of all $ q $-ary strings that do not contain repeated substrings of length $ \leq\ell $ forms a code correcting all patterns of tandem-duplication errors of length $ \leq\ell $, when $ \ell \in \{1, 2, 3\} $. For $ \ell \in \{1, 2\} $, this code is also known to be optimal in terms of asymptotic rate. The purpose of this paper is to demonstrate asymptotic optimality for the case $ \ell = 3 $ as well, and to give the corresponding characterization of the zero-error capacity of the $ (\leq 3) $-tandem-duplication channel. This settles the zero-error problem for $ (\leq\ell) $-tandem-duplication channels in all cases where duplication roots of strings are unique.

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 "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 "efficient encoding decoding of irreducible words for codes correcting tandem duplications":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "duplication with transposition distance to the root for q ary strings")

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)