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: "on optimal family of codes for dna storage"
  Abstract: Advancement in the technology has generated immense data which has become a burning issue for data storage experts. To accommodate the data and cope up with demand, computer scientist are striving to produce the improved, dense and reliable data storage medium. The main challenge for the development of optimum data storage medium is enhancement in storage capacity, reliability and security. Various applications of DNA in computing technologies and its dense, stable, reliable nature enticed the researcher to use DNA as storage medium. The idea of using DNA as storage medium has many success stories but the main challenges to deal with are error correction and cost associated with the DNA sequencing and synthesis. In this work, we have developed an efficient technique to encode the data into DNA by using non-linear family of ternary codes. This gives us significant reduction in file size for storing data on DNA from previous developed methods. Using our method one can store 1.15 ExaBytes (EB) of information in one gram of DNA.

Connected through hyperedge HE-1 (induced by source paper "modular non repeating codes for dna storage"):
  with members:
    - "codes in the damerau distance for dna storage"
    - "duplication correcting codes for data storage in the dna of living organisms"
    - "asymmetric lee distance codes for dna based storage"
    - "a rewritable random access dna based storage system"
    - "codes for dna storage channels"
    - "loopy belief propagation for approximate inference an empirical study"
    - "a generic top down dynamic programming approach to prefix free coding"
    - "dna codes that avoid secondary structures"

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)