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: "coded trace reconstruction"
  Abstract: Motivated by average-case trace reconstruction and coding for portable DNA-based storage systems, we initiate the study of \emph{coded trace reconstruction}, the design and analysis of high-rate efficiently encodable codes that can be efficiently decoded with high probability from few reads (also called \emph{traces}) corrupted by edit errors. Codes used in current portable DNA-based storage systems with nanopore sequencers are largely based on heuristics, and have no provable robustness or performance guarantees even for an error model with i.i.d.\ deletions and constant deletion probability. Our work is a first step towards the design of efficient codes with provable guarantees for such systems. We consider a constant rate of i.i.d.\ deletions, and perform an analysis of marker-based code-constructions. This gives rise to codes with redundancy $O(n/\log n)$ (resp.\ $O(n/\log\log n)$) that can be efficiently reconstructed from $\exp(O(\log^{2/3}n))$ (resp.\ $\exp(O(\log\log n)^{2/3})$) traces, where $n$ is the message length. Then, we give a construction of a code with $O(\log n)$ bits of redundancy that can be efficiently reconstructed from $\textrm{poly}(n)$ traces if the deletion probability is small enough. Finally, we show how to combine both approaches, giving rise to an efficient code with $O(n/\log n)$ bits of redundancy which can be reconstructed from $\textrm{poly}(\log n)$ traces for a small constant deletion probability.

Connected through hyperedge HE-1 (induced by source paper "mass error correction codes for polymer based data storage"):
  with members:
    - "reconstruction and error correction codes for polymer based data storage"
    - "unique reconstruction of coded strings from multiset substring spectra"
    - "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:
    - "reconstruction and error correction codes for polymer based data storage"
    - "unique reconstruction of coded strings from multiset substring spectra"
    - "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 "coding for sequence reconstruction for single edits"):
  with members:
    - "reconstruction codes for dna sequences with uniform tandem duplication errors"
    - "coding for racetrack memories"
    - "exact reconstruction from insertions in synchronization codes"

Connected through hyperedge HE-4 (induced by source paper "an overview of capacity results for synchronization channels"):
  with members:
    - "coding for deletion channels with multiple traces"
    - "coded trace reconstruction in a constant number of traces"
    - "optimally resilient codes for list decoding from insertions and deletions"
    - "zero error capacity of duplication channels"
    - "approximating edit distance within constant factor in truly sub quadratic time"
    - "maximum likelihood upper bounds on the capacities of discrete information stable channels"
    - "sharp analytical capacity upper bounds for sticky and related channels"
    - "on the list decodability of insertions and deletions"

Connected through hyperedge HE-5 (induced by source paper "coded trace reconstruction in a constant number of traces"):
  with members:
    - "coding for deletion channels with multiple traces"
    - "beyond trace reconstruction population recovery from the deletion channel"
    - "trace reconstruction generalized and parameterized"
    - "unique reconstruction of coded strings from multiset substring spectra"
    - "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-6 (induced by source paper "trace reconstruction generalized and parameterized"):
  with members:
    - "reconstructing trees from traces"
    - "beyond trace reconstruction population recovery from the deletion channel"
    - "mixture models robustness and sum of squares proofs"
    - "tight bounds for learning a mixture of two gaussians"
    - "learning mixtures of structured distributions over discrete domains"
    - "settling the polynomial learnability of mixtures of gaussians"
    - "polynomial learning of distribution families"

Connected through hyperedge HE-7 (induced by source paper "coding for deletion channels with multiple traces"):
  with members:
    - "unique reconstruction of coded strings from multiset substring spectra"
    - "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"

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)