human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "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.

Includes members:
  Member "anchor based correction of substitutions in indexed sets":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "coded trace reconstruction")
  Member "asymptotically optimal codes correcting fixed length duplication errors in dna storage systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "optimal constant weight codes under l_1 metric")
  Member "sequence subset distance and coding for error control in dna based data storage":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "coded trace reconstruction")
  Member "codes in the space of multisets coding for permutation channels with impairments":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "optimal constant weight codes under l_1 metric")
  Member "a characterization of the dna data storage channel":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "dna based storage models and fundamental limits")
  Member "fundamental limits of dna storage systems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "dna based storage models and fundamental limits")
  Member "exact reconstruction from insertions in synchronization codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "uncertainty of reconstruction with list decoding from uniform tandem duplication noise")
  Member "a rewritable random access dna based storage system":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "mass error correction codes for polymer based data storage")

Question: Please tell me which class the source paper 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)