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 on codes correcting tandem and palindromic duplications"
  Abstract: In this work, we derive upper bounds on the cardinality of tandem duplication and palindromic deletion correcting codes by deriving the generalized sphere packing bound for these error types. We first prove that an upper bound for tandem deletions is also an upper bound for inserting the respective type of duplications. Therefore, we derive the bounds based on these special deletions as this results in tighter bounds. We determine the spheres for tandem and palindromic duplications/deletions and the number of words with a specific sphere size. 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 errors. Our results indicate that the correction of palindromic duplications requires more redundancy than the correction of tandem duplications. Further, there is a significant gap between the minimum redundancy of duplication correcting codes and burst insertion correcting codes.

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"
    - "duplication correcting codes"
    - "coding for racetrack memories"
    - "exact reconstruction from insertions in synchronization codes"

Connected through hyperedge HE-2 (induced by source paper "on list decoding of insertion and deletion errors"):
  with members:
    - "near linear time insertion deletion codes and 1 e approximating edit distance via indexing"
    - "on the list decodability of insertions and deletions"
    - "synchronization strings list decoding for insertions and deletions"
    - "list decoding of insertions and deletions"
    - "synchronization strings codes for insertions and deletions approaching the singleton bound"
    - "efficiently decodable insertion deletion codes for high noise and high rate regimes"
    - "codes correcting a burst of deletions or insertions"
    - "efficient low redundancy codes for correcting multiple deletions"

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"
    - "duplication correcting codes"
    - "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 "repeat free codes"):
  with members:
    - "mutually uncorrelated codes for dna storage"
    - "evolution of k mer frequencies and entropy in duplication and substitution mutation systems"
    - "list decoding of insertions and deletions"
    - "rates of dna sequence profiles for practical values of read lengths"
    - "codes for dna sequence profiles"
    - "string reconstruction from substring compositions"

Connected through hyperedge HE-5 (induced by source paper "bounds and constructions for multi symbol duplication error correcting codes"):
  with members:
    - "duplication correcting codes for data storage in the dna of living organisms"
    - "efficient low redundancy codes for correcting multiple deletions"
    - "generalized sphere packing bound"
    - "constant weight and constant charge binary run length limited codes"

Connected through hyperedge HE-6 (induced by source paper "list decoding of insertions and deletions"):
  with members:
    - "exact reconstruction from insertions in synchronization codes"
    - "duplication correcting codes for data storage in the dna of living organisms"
    - "examining the unique decodability of insertion correcting codes beyond the guarantee"
    - "codes correcting a burst of deletions or insertions"
    - "efficient low redundancy codes for correcting multiple deletions"
    - "some gabidulin codes cannot be list decoded efficiently at any radius"
    - "bounds on list decoding of rank metric codes"

Connected through hyperedge HE-7 (induced by source paper "duplication correcting codes"):
  with members:
    - "duplication correcting codes for data storage in the dna of living organisms"
    - "codes correcting a burst of deletions or insertions"
    - "generalized sphere packing bound"
    - "non asymptotic upper bounds for deletion correcting codes"
    - "constant weight and constant charge binary run length limited 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)