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 sequence profiles"
  Abstract: We consider the problem of storing and retrieving information from synthetic DNA media. The mathematical basis of the problem is the construction and design of sequences that may be discriminated based on their collection of substrings observed through a noisy channel. This problem of reconstructing sequences from traces was first investigated in the noiseless setting under the name of "Markov type" analysis. Here, we explain the connection between the 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 "mass error correction codes for polymer based data storage"):
  with members:
    - "coded trace reconstruction"
    - "reconstruction and error correction codes for polymer based data storage"
    - "unique reconstruction of coded strings from multiset substring spectra"
    - "a rewritable random access dna based storage system"
    - "string reconstruction from substring compositions"

Connected through hyperedge HE-2 (induced by source paper "coding for polymer based data storage"):
  with members:
    - "coded trace reconstruction"
    - "reconstruction and error correction codes for polymer based data storage"
    - "unique reconstruction of coded strings from multiset substring spectra"
    - "a rewritable random access dna based storage system"
    - "string reconstruction from substring compositions"

Connected through hyperedge HE-3 (induced by source paper "dna based storage models and fundamental limits"):
  with members:
    - "capacity results for the noisy shuffling channel"
    - "a characterization of the dna data storage channel"
    - "fundamental limits of dna storage systems"
    - "exact reconstruction from insertions in synchronization codes"
    - "information theory of dna shotgun sequencing"

Connected through hyperedge HE-4 (induced by source paper "coded trace reconstruction"):
  with members:
    - "capacity results for the noisy shuffling channel"
    - "anchor based correction of substitutions in indexed sets"
    - "clustering correcting codes"
    - "coding for deletion channels with multiple traces"
    - "reconstructing trees from traces"
    - "beyond trace reconstruction population recovery from the deletion channel"
    - "trace reconstruction generalized and parameterized"
    - "sequence subset distance and coding for error control in dna based data storage"

Connected through hyperedge HE-5 (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"
    - "codes in the damerau distance for dna storage"

Connected through hyperedge HE-6 (induced by source paper "capacity results for the noisy shuffling channel"):
  with members:
    - "anchor based correction of substitutions in indexed sets"
    - "asymptotically optimal codes correcting fixed length duplication errors in dna storage systems"
    - "sequence subset distance and coding for error control in dna based data storage"
    - "codes in the space of multisets coding for permutation channels with impairments"
    - "a characterization of the dna data storage channel"
    - "fundamental limits of dna storage systems"
    - "exact reconstruction from insertions in synchronization codes"
    - "a rewritable random access dna based storage system"

Connected through hyperedge HE-7 (induced by source paper "the capacity of associated subsequence retrieval"):
  with members:
    - "capacity results for the noisy shuffling channel"
    - "fundamental limits of dna storage systems"
    - "rates of dna sequence profiles for practical values of read lengths"
    - "partial dna assembly a rate distortion perspective"
    - "asymmetric lee distance codes for dna based storage"
    - "do read errors matter for genome assembly"
    - "optimal dna shotgun sequencing noisy reads are as good as noiseless reads"
    - "information theory of dna shotgun sequencing"

Connected through hyperedge HE-8 (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"
    - "bounds on codes correcting tandem and palindromic duplications"
    - "rates of dna sequence profiles for practical values of read lengths"
    - "string reconstruction from substring compositions"

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)