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 "on conflict free dna codes"):
  Abstract: DNA storage has emerged as an important area of research. The reliability of DNA storage system depends on designing the DNA strings (called DNA codes) that are sufficiently dissimilar. In this work, we introduce DNA codes that satisfy a special constraint. Each codeword of the DNA code has a specific property that any two consecutive sub-strings of the DNA codeword will not be the same (a generalization of homo-polymers constraint). This is in addition to the usual constraints such as Hamming, reverse, reverse-complement and $GC$-content. We believe that the new constraint will help further in reducing the errors during reading and writing data into the synthetic DNA strings. We also present a construction (based on a variant of stochastic local search algorithm) to calculate the size of the DNA codes with all the above constraints, which improves the lower bounds from the existing literature, for some specific cases. Moreover, a recursive isometric map between binary vectors and DNA strings is proposed. Using the map and the well known binary codes we obtain few classes of DNA codes with all the constraints including the property that the constructed DNA codewords are free from the hairpin-like secondary structures.

Includes members:
  Member "asymptotically optimal codes correcting fixed length duplication errors in dna storage systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "optimal constant weight codes under l_1 metric")
  Member "properties and constructions of constrained codes for dna based data storage":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "efficient and explicit balanced primer codes")
  Member "the art of dna strings sixteen years of dna coding theory":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "efficient and explicit balanced primer codes")
  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 "codes for dna sequence profiles":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "mass error correction codes for polymer based data storage")
  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 "bacsoft a tool to archive data on bacteria")
  Member "dna codes that avoid secondary structures":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "modular non repeating codes for dna storage")

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)