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: "duplication correcting codes"
  Abstract: In this work, we propose constructions that correct duplications of multiple consecutive symbols. These errors are known as tandem duplications, where a sequence of symbols is repeated; respectively as palindromic duplications, where a sequence is repeated in reversed order. We compare the redundancies of these constructions with code size upper bounds that are obtained from sphere packing arguments. Proving that an upper bound on the code cardinality for tandem deletions is also an upper bound for inserting tandem duplications, we derive the bounds based on this special tandem deletion error as this results in tighter bounds. Our upper bounds on the cardinality directly imply lower bounds on the redundancy which we compare with the redundancy of the best known construction correcting arbitrary burst insertions. Our results indicate that the correction of palindromic duplications requires more redundancy than the correction of tandem duplications and both significantly less than arbitrary burst insertions.

Connected through hyperedge HE-1 (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"
    - "bounds and constructions for multi symbol duplication error correcting codes"
    - "asymptotically optimal codes correcting fixed length duplication errors in dna storage systems"
    - "bounds on codes correcting tandem and palindromic duplications"
    - "coding for racetrack memories"
    - "exact reconstruction from insertions in synchronization codes"

Connected through hyperedge HE-2 (induced by source paper "duplication with transposition distance to the root for q ary strings"):
  with members:
    - "zero error capacity of duplication channels"
    - "reconstruction codes for dna sequences with uniform tandem duplication errors"
    - "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-3 (induced by source paper "reconstruction codes for dna sequences with uniform tandem duplication errors"):
  with members:
    - "bounds and constructions for multi symbol duplication error correcting codes"
    - "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"
    - "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 "single error detection and correction for duplication and substitution channels"):
  with members:
    - "asymptotically optimal codes correcting fixed length duplication errors in dna storage systems"
    - "exact reconstruction from insertions in synchronization codes"

Connected through hyperedge HE-5 (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"
    - "bounds and constructions for multi symbol duplication error correcting codes"
    - "codes in the space of multisets coding for permutation channels with impairments"

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)