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: "information theory of dna shotgun sequencing"
  Abstract: DNA sequencing is the basic workhorse of modern day biology and medicine. Shotgun sequencing is the dominant technique used: many randomly located short fragments called reads are extracted from the DNA sequence, and these reads are assembled to reconstruct the original sequence. A basic question is: given a sequencing technology and the statistics of the DNA sequence, what is the minimum number of reads required for reliable reconstruction? This number provides a fundamental limit to the performance of {\em any} assembly algorithm. For a simple statistical model of the DNA sequence and the read process, we show that the answer admits a critical phenomena in the asymptotic limit of long DNA sequences: if the read length is below a threshold, reconstruction is impossible no matter how many reads are observed, and if the read length is above the threshold, having enough reads to cover the DNA sequence is sufficient to reconstruct. The threshold is computed in terms of the Renyi entropy rate of the DNA sequence. We also study the impact of noise in the read process on the performance.

Connected through hyperedge HE-1 (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"
    - "codes for dna sequence profiles"

Connected through hyperedge HE-2 (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"
    - "codes for dna sequence profiles"
    - "optimal dna shotgun sequencing noisy reads are as good as noiseless reads"

Connected through hyperedge HE-3 (induced by source paper "reconstruction of strings from their substrings spectrum"):
  with members:
    - "repeat free codes"
    - "unique reconstruction of coded strings from multiset substring spectra"
    - "mutually uncorrelated codes for dna storage"
    - "partial dna assembly a rate distortion perspective"
    - "do read errors matter for genome assembly"
    - "string reconstruction from substring compositions"
    - "optimal dna shotgun sequencing noisy reads are as good as noiseless reads"

Connected through hyperedge HE-4 (induced by source paper "private shotgun dna sequencing a structured approach"):
  with members:
    - "fundamental limits of pooled dna sequencing"

Connected through hyperedge HE-5 (induced by source paper "the metagenomic binning problem clustering markov sequences"):
  with members:
    - "exact recovery in the stochastic block model"

Connected through hyperedge HE-6 (induced by source paper "hidden hamiltonian cycle recovery via linear programming"):
  with members:
    - "improved sum of squares lower bounds for hidden clique and hidden submatrix problems"
    - "a semidefinite program for unbalanced multisection in the stochastic block model"
    - "sum of squares lower bounds for planted clique"
    - "exact recovery in the stochastic block model"
    - "distributed user profiling via spectral methods"
    - "belief propagation for weighted b matchings on arbitrary graphs and its relation to linear programs with integer solutions"

Connected through hyperedge HE-7 (induced by source paper "on perfect privacy and maximal correlation"):
  with members:
    - "privacy utility tradeoffs under constrained data release mechanisms"
    - "notes on information theoretic privacy"
    - "smart meter privacy for multiple users in the presence of an alternative energy source"
    - "from the information bottleneck to the privacy funnel"
    - "on maximal correlation hypercontractivity and the data processing inequality studied by erkip and cover"
    - "privacy against statistical inference"

Connected through hyperedge HE-8 (induced by source paper "rank modulation codes for dna storage"):
  with members:
    - "codes for dna sequence profiles"

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)