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 "reconstruction of strings from their substrings spectrum"):
  Abstract: This paper studies reconstruction of strings based upon their substrings spectrum. Under this paradigm, it is assumed that all substrings of some fixed length are received and the goal is to reconstruct the string. While many existing works assumed that substrings are received error free, we follow in this paper the noisy setup of this problem that was first studied by Gabrys and Milenkovic. The goal of this study is twofold. First we study the setup in which not all substrings in the multispectrum are received, and then we focus on the case where the read substrings are not error free. In each case we provide specific code constructions of strings that their reconstruction is guaranteed even in the presence of failure in either model. We present efficient encoding and decoding maps and analyze the cardinality of the code constructions.

Includes members:
  Member "repeat free codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "optimal codes correcting a single indel edit for dna based data storage")
  Member "unique reconstruction of coded strings from multiset substring spectra":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "mass error correction codes for polymer based data storage")
  Member "mutually uncorrelated codes for dna storage":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "repeat free codes")
  Member "partial dna assembly a rate distortion perspective":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the capacity of associated subsequence retrieval")
  Member "do read errors matter for genome assembly":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the capacity of associated subsequence retrieval")
  Member "string reconstruction from substring compositions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "mass error correction codes for polymer based data storage")
  Member "optimal dna shotgun sequencing noisy reads are as good as noiseless reads":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the capacity of associated subsequence retrieval")
  Member "information theory of dna shotgun sequencing":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "dna based storage models and fundamental limits")

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)