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 for dna storage channels"
  Abstract: We consider the problem of assembling a sequence based on a collection of its substrings observed through a noisy channel. The mathematical basis of the problem is the construction and design of sequences that may be discriminated based on a collection of their substrings observed through a noisy channel. We explain the connection between the sequence reconstruction problem and the problem of DNA synthesis and sequencing, and introduce the notion of a DNA storage channel. We analyze the number of sequence equivalence classes under the channel mapping and propose new asymmetric coding techniques to combat the effects of synthesis and sequencing noise. In our analysis, we make use of restricted de Bruijn graphs and Ehrhart theory for rational polytopes.

Connected through hyperedge HE-1 (induced by source paper "exact reconstruction from insertions in synchronization codes"):
  with members:
    - "codes in the damerau distance for dna storage"
    - "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"
    - "a characterization of the number of subsequences obtained via the deletion channel"

Connected through hyperedge HE-2 (induced by source paper "modular non repeating codes for dna storage"):
  with members:
    - "codes in the damerau distance for dna storage"
    - "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"
    - "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-3 (induced by source paper "codes for dna sequence profiles"):
  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"
    - "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"

Connected through hyperedge HE-4 (induced by source paper "natural data storage a review on sending information from now to then via nature"):
  with members:
    - "a rewritable random access dna based storage system"
    - "capacity of dna data embedding under substitution mutations"
    - "a survey on network codes for distributed storage"
    - "biocompatible writing of data into dna"
    - "dna translocation through α hemolysin nanopores with potential application to macromolecular data storage"

Connected through hyperedge HE-5 (induced by source paper "dna based storage trends and methods"):
  with members:
    - "non overlapping codes"
    - "asymmetric lee distance codes for dna based storage"
    - "a rewritable random access dna based storage system"
    - "codes for dna sequence profiles"

Connected through hyperedge HE-6 (induced by source paper "on optimal family of codes for archival dna storage"):
  with members:
    - "a rewritable random access dna based storage system"

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)