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: "a rewritable random access dna based storage system"
  Abstract: We describe the first DNA-based storage architecture that enables random access to data blocks and rewriting of information stored at arbitrary locations within the blocks. The newly developed architecture overcomes drawbacks of existing read-only methods that require decoding the whole file in order to read one data fragment. Our system is based on new constrained coding techniques and accompanying DNA editing methods that ensure data reliability, specificity and sensitivity of access, and at the same time provide exceptionally high data storage capacity. As a proof of concept, we encoded parts of the Wikipedia pages of six universities in the USA, and selected and edited parts of the text written in DNA corresponding to three of these schools. The results suggest that DNA is a versatile media suitable for both ultrahigh density archival and rewritable storage applications.

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"
    - "unique reconstruction of coded strings from multiset substring spectra"
    - "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"
    - "unique reconstruction of coded strings from multiset substring spectra"
    - "codes for dna sequence profiles"
    - "string reconstruction from substring compositions"

Connected through hyperedge HE-3 (induced by source paper "dna linear block codes generation error detection and error correction of dna codeword"):
  with members:
    - "improved lower bounds for constant gc content dna codes"

Connected through hyperedge HE-4 (induced by source paper "coded trace reconstruction"):
  with members:
    - "capacity results for the noisy shuffling channel"
    - "anchor based correction of substitutions in indexed sets"
    - "clustering correcting codes"
    - "coding for deletion channels with multiple traces"
    - "reconstructing trees from traces"
    - "beyond trace reconstruction population recovery from the deletion channel"
    - "trace reconstruction generalized and parameterized"
    - "sequence subset distance and coding for error control in dna based data storage"

Connected through hyperedge HE-5 (induced by source paper "capacity results for the noisy shuffling channel"):
  with members:
    - "anchor based correction of substitutions in indexed sets"
    - "asymptotically optimal codes correcting fixed length duplication errors in dna storage systems"
    - "sequence subset distance and coding for error control in dna based data storage"
    - "codes in the space of multisets coding for permutation channels with impairments"
    - "a characterization of the dna data storage channel"
    - "fundamental limits of dna storage systems"
    - "exact reconstruction from insertions in synchronization codes"
    - "codes for dna sequence profiles"

Connected through hyperedge HE-6 (induced by source paper "anchor based correction of substitutions in indexed sets"):
  with members:
    - "efficient and explicit balanced primer codes"
    - "sequence subset distance and coding for error control in dna based data storage"
    - "codes in the space of multisets coding for permutation channels with impairments"
    - "a characterization of the dna data storage channel"
    - "on coding over sliced information"
    - "codes for dna sequence profiles"

Connected through hyperedge HE-7 (induced by source paper "on conflict free dna codes"):
  with members:
    - "asymptotically optimal codes correcting fixed length duplication errors in dna storage systems"
    - "properties and constructions of constrained codes for dna based data storage"
    - "the art of dna strings sixteen years of dna coding theory"
    - "codes for dna sequence profiles"
    - "natural data storage a review on sending information from now to then via nature"
    - "dna codes that avoid secondary structures"

Connected through hyperedge HE-8 (induced by source paper "efficient and explicit balanced primer codes"):
  with members:
    - "properties and constructions of constrained codes for dna based data storage"
    - "the art of dna strings sixteen years of dna coding theory"
    - "codes correcting a burst of deletions or insertions"
    - "lcd cyclic codes over finite fields"

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)