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: "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.

Connected through hyperedge HE-1 (induced by source paper "mass error correction codes for polymer based data storage"):
  with members:
    - "coded trace reconstruction"
    - "reconstruction and error correction codes for polymer based data storage"
    - "a rewritable random access dna based storage system"
    - "codes for dna sequence profiles"
    - "string reconstruction from substring compositions"

Connected through hyperedge HE-2 (induced by source paper "coding for polymer based data storage"):
  with members:
    - "coded trace reconstruction"
    - "reconstruction and error correction codes for polymer based data storage"
    - "a rewritable random access dna based storage system"
    - "codes for dna sequence profiles"
    - "string reconstruction from substring compositions"

Connected through hyperedge HE-3 (induced by source paper "coded trace reconstruction in a constant number of traces"):
  with members:
    - "coding for deletion channels with multiple traces"
    - "coded trace reconstruction"
    - "beyond trace reconstruction population recovery from the deletion channel"
    - "trace reconstruction generalized and parameterized"
    - "capacity upper bounds for deletion type channels"
    - "average case reconstruction for the deletion channel subpolynomially many traces suffice"
    - "polynomial time decodable codes for the binary deletion channel"
    - "synchronization strings explicit constructions local decoding and applications"

Connected through hyperedge HE-4 (induced by source paper "reconstruction of strings from their substrings spectrum"):
  with members:
    - "repeat free codes"
    - "mutually uncorrelated codes for dna storage"
    - "partial dna assembly a rate distortion perspective"
    - "do read errors matter for genome assembly"
    - "string reconstruction from substring compositions"
    - "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 "coding for deletion channels with multiple traces"):
  with members:
    - "coded trace reconstruction"
    - "average case reconstruction for the deletion channel subpolynomially many traces suffice"
    - "efficient systematic encoding of non binary vt codes"
    - "exact reconstruction from insertions in synchronization codes"
    - "codes for dna sequence profiles"

Connected through hyperedge HE-6 (induced by source paper "reconstruction and error correction codes for polymer based data storage"):
  with members:
    - "a rewritable random access dna based storage system"
    - "codes for dna sequence profiles"
    - "string reconstruction from substring compositions"

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)