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 "the art of dna strings sixteen years of dna coding theory"):
  Abstract: The idea of computing with DNA was given by Tom Head in 1987, however in 1994 in a seminal paper, the actual successful experiment for DNA computing was performed by Adleman. The heart of the DNA computing is the DNA hybridization, however, it is also the source of errors. Thus the success of the DNA computing depends on the error control techniques. The classical coding theory techniques have provided foundation for the current information and communication technology (ICT). Thus it is natural to expect that coding theory will be the foundational subject for the DNA computing paradigm. For the successful experiments with DNA computing usually we design DNA strings which are sufficiently dissimilar. This leads to the construction of a large set of DNA strings which satisfy certain combinatorial and thermodynamic constraints. Over the last 16 years, many approaches such as combinatorial, algebraic, computational have been used to construct such DNA strings. In this work, we survey this interesting area of DNA coding theory by providing key ideas of the area and current known results.

Includes members:
  Member "on cyclic dna codes over the rings z_ 4 wz_ 4 and z_ 4 wz_ 4 vz_ 4 wvz_ 4":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on dna codes using the ring z4 wz4")
  Member "on cyclic dna codes over mathbb f _2 u mathbb f _2 u 2 mathbb f _2":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on dna codes using the ring z4 wz4")
  Member "dna based storage trends and methods":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "codes in the damerau distance for dna storage")
  Member "new dna cyclic codes over rings":
    also connected through other hyperedges:
      (none)
  Member "a rewritable random access dna based storage system":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "mass error correction codes for polymer based data storage")
  Member "on cyclic dna codes over the ring z_4 u z_4":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on dna codes using the ring z4 wz4")
  Member "cyclic dna codes over f2 uf2 vf2 uvf2":
    also connected through other hyperedges:
      (none)
  Member "natural data storage a review on sending information from now to then via nature":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on conflict free dna codes")

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)