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: "fundamental limits of dna storage systems"
  Abstract: Due to its longevity and enormous information density, DNA is an attractive medium for archival storage. In this work, we study the fundamental limits and tradeoffs of DNA-based storage systems under a simple model, motivated by current technological constraints on DNA synthesis and sequencing. Our model captures two key distinctive aspects of DNA storage systems: (1) the data is written onto many short DNA molecules that are stored in an unordered way and (2) the data is read by randomly sampling from this DNA pool. Under this model, we characterize the storage capacity, and show that a simple index-based coding scheme is optimal.

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"
    - "exact reconstruction from insertions in synchronization codes"
    - "codes for dna sequence profiles"
    - "information theory of dna shotgun sequencing"

Connected through hyperedge HE-2 (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-3 (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"
    - "exact reconstruction from insertions in synchronization codes"
    - "a rewritable random access dna based storage system"
    - "codes for dna sequence profiles"

Connected through hyperedge HE-4 (induced by source paper "the capacity of associated subsequence retrieval"):
  with members:
    - "capacity results for the noisy shuffling channel"
    - "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"
    - "information theory of dna shotgun sequencing"

Connected through hyperedge HE-5 (induced by source paper "error exponent bounds for the bee identification problem"):
  with members:
    - "capacity results for the noisy shuffling channel"
    - "the strongly asynchronous massive access channel"
    - "on identifying a massive number of distributions"
    - "codes in the space of multisets coding for permutation channels with impairments"
    - "error exponents of typical random codes"

Connected through hyperedge HE-6 (induced by source paper "on the bee identification error exponent with absentee bees"):
  with members:
    - "capacity results for the noisy shuffling channel"
    - "on identifying a massive number of distributions"
    - "codes in the space of multisets coding for permutation channels with impairments"
    - "universal decoding for arbitrary channels relative to a given class of decoding metrics"
    - "distance distribution of binary codes and the error probability of decoding"

Connected through hyperedge HE-7 (induced by source paper "coding over sets for dna storage"):
  with members:
    - "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"
    - "on coding over sliced information"
    - "a rewritable random access dna based storage system"
    - "codes for dna sequence profiles"
    - "generalized sphere packing bound"

Connected through hyperedge HE-8 (induced by source paper "codes in the space of multisets coding for permutation channels with impairments"):
  with members:
    - "duplication correcting codes for data storage in the dna of living organisms"
    - "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"

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)