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: "capacity results for the noisy shuffling channel"
  Abstract: Motivated by DNA-based storage, we study the noisy shuffling channel, which can be seen as the concatenation of a standard noisy channel (such as the BSC) and a shuffling channel, which breaks the data block into small pieces and shuffles them. This channel models a DNA storage system, by capturing two of its key aspects: (1) the data is written onto many short DNA molecules that are stored in an unordered way and (2) the molecules are corrupted by noise at synthesis, sequencing, and during storage. For the BSC-shuffling channel we characterize the capacity exactly (for a large set of parameters), 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:
    - "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"
    - "information theory of dna shotgun sequencing"

Connected through hyperedge HE-2 (induced by source paper "coded trace reconstruction"):
  with members:
    - "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"
    - "deterministic document exchange protocols and almost optimal binary codes for edit errors"

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

Connected through hyperedge HE-4 (induced by source paper "error exponent bounds for the bee identification problem"):
  with members:
    - "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"
    - "fundamental limits of dna storage systems"
    - "error exponents of typical random codes"

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

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)