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 for data storage in the dna of living organisms"
  Abstract: The ability to store data in the DNA of a living organism has applications in a variety of areas including synthetic biology and watermarking of patented genetically-modified organisms. Data stored in this medium is subject to errors arising from various mutations, such as point mutations, indels, and tandem duplication, which need to be corrected to maintain data integrity. In this paper, we provide error-correcting codes for errors caused by tandem duplications, which create a copy of a block of the sequence and insert it in a tandem manner, i.e., next to the original. In particular, we present a family of codes for correcting errors due to tandem-duplications of a fixed length and any number of errors. We also study codes for correcting tandem duplications of length up to a given constant k, where we are primarily focused on the cases of k = 2, 3.

Connected through hyperedge HE-1 (induced by source paper "optimal codes correcting a burst of deletions of variable length"):
  with members:
    - "zero error capacity of duplication channels"
    - "optimal k deletion correcting codes"
    - "optimal document exchange and new codes for insertions and deletions"
    - "an improvement of non binary code correcting single b burst of insertions or deletions"
    - "polynomial time decodable codes for the binary deletion channel"
    - "synchronization strings codes for insertions and deletions approaching the singleton bound"
    - "codes correcting a burst of deletions or insertions"
    - "efficient low redundancy codes for correcting multiple deletions"

Connected through hyperedge HE-2 (induced by source paper "codes in the space of multisets coding for permutation channels with impairments"):
  with members:
    - "fundamental limits of dna storage systems"
    - "perfect codes in the discrete simplex"
    - "compressing sets and multisets of sequences"
    - "multiset codes for permutation channels"
    - "subset codes for packet networks"
    - "codes in permutations and error correction for rank modulation"

Connected through hyperedge HE-3 (induced by source paper "bounds and constructions for multi symbol duplication error correcting codes"):
  with members:
    - "bounds on codes correcting tandem and palindromic duplications"
    - "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-4 (induced by source paper "list decoding of insertions and deletions"):
  with members:
    - "bounds on codes correcting tandem and palindromic duplications"
    - "exact reconstruction from insertions in synchronization codes"
    - "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-5 (induced by source paper "duplication correcting codes"):
  with members:
    - "bounds on codes correcting tandem and palindromic duplications"
    - "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"

Connected through hyperedge HE-6 (induced by source paper "bounds on codes correcting tandem and palindromic duplications"):
  with members:
    - "codes correcting a burst of deletions or insertions"
    - "generalized sphere packing bound"
    - "constant weight and constant charge binary run length limited codes"

Connected through hyperedge HE-7 (induced by source paper "exact reconstruction from insertions in synchronization codes"):
  with members:
    - "codes in the damerau distance for dna storage"
    - "asymmetric lee distance codes for dna based storage"
    - "a rewritable random access dna based storage system"
    - "codes for dna sequence profiles"
    - "low complexity interactive algorithms for synchronization from deletions insertions and substitutions"
    - "string reconstruction from substring compositions"
    - "codes for dna storage channels"
    - "a characterization of the number of subsequences obtained via the deletion channel"

Connected through hyperedge HE-8 (induced by source paper "modular non repeating codes for dna storage"):
  with members:
    - "codes in the damerau distance for dna storage"
    - "asymmetric lee distance codes for dna based storage"
    - "a rewritable random access dna based storage system"
    - "on optimal family of codes for dna storage"
    - "codes for dna storage channels"
    - "loopy belief propagation for approximate inference an empirical study"
    - "a generic top down dynamic programming approach to prefix free coding"
    - "dna codes that avoid secondary structures"

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)