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 "unique reconstruction of coded strings from multiset substring spectra"):
  Abstract: The problem of reconstructing strings from their substring spectra has a long history and in its most simple incarnation asks for determining under which conditions the spectrum uniquely determines the string. We study the problem of coded string reconstruction from multiset substring spectra, where the strings are restricted to lie in some codebook. In particular, we consider binary codebooks that allow for unique string reconstruction and propose a new method, termed repeat replacement, to create the codebook. Our contributions include algorithmic solutions for repeat replacement and constructive redundancy bounds for the underlying coding schemes. We also consider extensions of the problem to noisy settings in which substrings are compromised by burst and random errors. The study is motivated by applications in DNA-based data storage systems that use high throughput readout sequencers.

Includes members:
  Member "mutually uncorrelated codes for dna storage":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "reconstruction of strings from their substrings spectrum")
  Member "on coding over sliced information":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "coded trace reconstruction")
  Member "exact reconstruction from insertions in synchronization codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "uncertainty of reconstruction with list decoding from uniform tandem duplication noise")
  Member "codes correcting a burst of deletions or insertions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "optimal codes correcting a burst of deletions of variable length")
  Member "rates of dna sequence profiles for practical values of read lengths":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the capacity of associated subsequence retrieval")
  Member "a rewritable random access dna based storage system":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "mass error correction codes for polymer based data storage")
  Member "codes for dna sequence profiles":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "mass error correction codes for polymer based data storage")
  Member "string reconstruction from substring compositions":
    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)