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: "codes in the damerau distance for dna storage"
  Abstract: Motivated by applications in DNA-based storage, we introduce the new problem of code design in the Damerau metric. The Damerau metric is a generalization of the Levenshtein distance which, in addition to deletions, insertions and substitution errors also accounts for adjacent transposition edits. We first provide constructions for codes that may correct either a single deletion or a single adjacent transposition and then proceed to extend these results to codes that can simultaneously correct a single deletion and multiple adjacent transpositions. We conclude with constructions for joint block deletion and adjacent block transposition error-correcting codes.

Connected through hyperedge HE-1 (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"
    - "bounds on codes correcting tandem and palindromic duplications"
    - "coding for racetrack memories"
    - "asymmetric lee distance codes for dna based storage"

Connected through hyperedge HE-2 (induced by source paper "guess check codes for deletions insertions and synchronization"):
  with members:
    - "guess check codes for deletions and synchronization"
    - "efficiently decodable insertion deletion codes for high noise and high rate regimes"
    - "coding against deletions in oblivious and online models"
    - "efficient low redundancy codes for correcting multiple deletions"
    - "low complexity interactive algorithms for synchronization from deletions insertions and substitutions"
    - "achievable rates for channels with deletions and insertions"
    - "an improvement to levenshtein s upper bound on the cardinality of deletion correcting codes"
    - "a deterministic polynomial time protocol for synchronizing from deletions"

Connected through hyperedge HE-3 (induced by source paper "guess check codes for deletions and synchronization"):
  with members:
    - "efficient low redundancy codes for correcting multiple deletions"
    - "low complexity interactive algorithms for synchronization from deletions insertions and substitutions"
    - "deletion codes in the high noise and high rate regimes"
    - "achievable rates for channels with deletions and insertions"
    - "an improvement to levenshtein s upper bound on the cardinality of deletion correcting codes"
    - "a deterministic polynomial time protocol for synchronizing from deletions"

Connected through hyperedge HE-4 (induced by source paper "mutually uncorrelated primers for dna based data storage"):
  with members:
    - "mutually uncorrelated codes for dna storage"
    - "non overlapping codes"
    - "asymmetric lee distance codes for dna based storage"
    - "a rewritable random access dna based storage system"

Connected through hyperedge HE-5 (induced by source paper "exact reconstruction from insertions in synchronization codes"):
  with members:
    - "duplication correcting codes for data storage in the dna of living organisms"
    - "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-6 (induced by source paper "modular non repeating codes for dna storage"):
  with members:
    - "duplication correcting codes for data storage in the dna of living organisms"
    - "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"

Connected through hyperedge HE-7 (induced by source paper "codes for dna sequence profiles"):
  with members:
    - "asymmetric lee distance codes for dna based storage"
    - "a rewritable random access dna based storage system"
    - "codes for dna storage channels"
    - "sets represented as the length n factors of a word"
    - "error correction in flash memories via codes in the ulam metric"
    - "codes in permutations and error correction for rank modulation"

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)