human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "bounds and constructions for multi symbol duplication error correcting codes"
  Abstract: In this paper, we study codes correcting $t$ duplications of $\ell$ consecutive symbols. These errors are known as tandem duplication errors, where a sequence of symbols is repeated and inserted directly after its original occurrence. Using sphere packing arguments, we derive non-asymptotic upper bounds on the cardinality of codes that correct such errors for any choice of parameters. Based on the fact that a code correcting insertions of $t$ zero-blocks can be used to correct $t$ tandem duplications, we construct codes for tandem duplication errors. We compare the cardinalities of these codes with their sphere packing upper bounds. Finally, we discuss the asymptotic behavior of the derived codes and bounds, which yields insights about the tandem duplication channel.

Connected through hyperedge HE-1 (induced by source paper "optimal constant weight codes under l_1 metric"):
  with members:
    - "single error detection and correction for duplication and substitution channels"
    - "reconstruction codes for dna sequences with uniform tandem duplication errors"
    - "asymptotically optimal codes correcting fixed length duplication errors in dna storage systems"
    - "codes in the space of multisets coding for permutation channels with impairments"
    - "constructions of optimal and near optimal multiply constant weight codes"
    - "systematic error correcting codes for rank modulation"
    - "error correction in flash memories via codes in the ulam metric"
    - "codes in permutations and error correction for rank modulation"

Connected through hyperedge HE-2 (induced by source paper "uncertainty of reconstruction with list decoding from uniform tandem duplication noise"):
  with members:
    - "codes correcting all patterns of tandem duplication errors of maximum length 3"
    - "reconstruction codes for dna sequences with uniform tandem duplication errors"
    - "asymptotically optimal codes correcting fixed length duplication errors in dna storage systems"
    - "duplication correcting codes"
    - "bounds on codes correcting tandem and palindromic duplications"
    - "coding for racetrack memories"
    - "exact reconstruction from insertions in synchronization codes"

Connected through hyperedge HE-3 (induced by source paper "reconstruction codes for dna sequences with uniform tandem duplication errors"):
  with members:
    - "asymptotically optimal codes correcting fixed length duplication errors in dna storage systems"
    - "codes in the space of multisets coding for permutation channels with impairments"
    - "rank modulation codes for dna storage"
    - "duplication correcting codes"
    - "bounds on codes correcting tandem and palindromic duplications"
    - "coding for racetrack memories"
    - "codes in the damerau distance for dna storage"
    - "asymmetric lee distance codes for dna based storage"

Connected through hyperedge HE-4 (induced by source paper "zero error capacity of duplication channels"):
  with members:
    - "runlength limited sequences and shift correcting codes asymptotic analysis"
    - "asymptotically optimal codes correcting fixed length duplication errors in dna storage systems"
    - "the capacity of some p olya string models"
    - "sharp analytical capacity upper bounds for sticky and related channels"
    - "on the capacity of channels with timing synchronization errors"

Connected through hyperedge HE-5 (induced by source paper "codes correcting all patterns of tandem duplication errors of maximum length 3"):
  with members:
    - "zero error capacity of duplication channels"
    - "asymptotically optimal codes correcting fixed length duplication errors in dna storage systems"
    - "efficient encoding decoding of irreducible words for codes correcting tandem duplications"

Connected through hyperedge HE-6 (induced by source paper "asymptotically optimal codes correcting fixed length duplication errors in dna storage systems"):
  with members:
    - "runlength limited sequences and shift correcting codes asymptotic analysis"
    - "reconstruction codes for dna sequences with uniform tandem duplication errors"
    - "codes in the space of multisets coding for permutation channels with impairments"
    - "duplication correcting codes"

Question: Please tell me which class the center node 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)