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: "mutually uncorrelated codes for dna storage"
  Abstract: Mutually Uncorrelated (MU) codes are a class of codes in which no proper prefix of one codeword is a suffix of another codeword. These codes were originally studied for synchronization purposes and recently, Yazdi et al. showed their applicability to enable random access in DNA storage. In this work we follow the research of Yazdi et al. and study MU codes along with their extensions to correct errors and balanced codes. We first review a well known construction of MU codes and study the asymptotic behavior of its cardinality. This task is accomplished by studying a special class of run-length limited codes that impose the longest run of zeros to be at most some function of the codewords length. We also present an efficient algorithm for this class of constrained codes and show how to use this analysis for MU codes. Next, we extend the results on the run-length limited codes in order to study $(d_h,d_m)$-MU codes that impose a minimum Hamming distance of $d_h$ between different codewords and $d_m$ between prefixes and suffixes. In particular, we show an efficient construction of these codes with nearly optimal redundancy. We also provide similar results for the edit distance and balanced MU codes. Lastly, we draw connections to the problems of comma-free and prefix synchronized codes.

Connected through hyperedge HE-1 (induced by source paper "reconstruction of strings from their substrings spectrum"):
  with members:
    - "repeat free codes"
    - "unique reconstruction of coded strings from multiset substring spectra"
    - "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-2 (induced by source paper "repeat free codes"):
  with members:
    - "evolution of k mer frequencies and entropy in duplication and substitution mutation systems"
    - "list decoding of insertions and deletions"
    - "bounds on codes correcting tandem and palindromic duplications"
    - "rates of dna sequence profiles for practical values of read lengths"
    - "codes for dna sequence profiles"
    - "string reconstruction from substring compositions"

Connected through hyperedge HE-3 (induced by source paper "clustering correcting codes"):
  with members:
    - "efficient and explicit balanced primer codes"
    - "a characterization of the dna data storage channel"
    - "a rewritable random access dna based storage system"

Connected through hyperedge HE-4 (induced by source paper "robust positioning patterns with low redundancy"):
  with members:
    - "simple and robust binary self location patterns"

Connected through hyperedge HE-5 (induced by source paper "unique reconstruction of coded strings from multiset substring spectra"):
  with members:
    - "on coding over sliced information"
    - "exact reconstruction from insertions in synchronization codes"
    - "codes correcting a burst of deletions or insertions"
    - "rates of dna sequence profiles for practical values of read lengths"
    - "a rewritable random access dna based storage system"
    - "codes for dna sequence profiles"
    - "string reconstruction from substring compositions"

Connected through hyperedge HE-6 (induced by source paper "mutually uncorrelated primers for dna based data storage"):
  with members:
    - "codes in the damerau distance for dna storage"
    - "non overlapping codes"
    - "asymmetric lee distance codes for dna based storage"
    - "a rewritable random access dna based storage system"

Connected through hyperedge HE-7 (induced by source paper "coding for racetrack memories"):
  with members:
    - "exact reconstruction from insertions in synchronization codes"
    - "codes correcting a burst of deletions or insertions"
    - "efficient low redundancy codes for correcting multiple deletions"
    - "maximum distance separable codes for symbol pair read channels"

Connected through hyperedge HE-8 (induced by source paper "rates of dna sequence profiles for practical values of read lengths"):
  with members:
    - "asymmetric lee distance codes for dna based storage"
    - "a rewritable random access dna based storage system"
    - "codes for dna sequence profiles"
    - "sets represented as the length n factors of a word"

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)