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: "properties and constructions of constrained codes for dna based data storage"
  Abstract: We describe properties and constructions of constraint-based codes for DNA-based data storage which account for the maximum repetition length and AT/GC balance. We present algorithms for computing the number of sequences with maximum repetition length and AT/GC balance constraint. We describe routines for translating binary runlength limited and/or balanced strings into DNA strands, and compute the efficiency of such routines. We show that the implementation of AT/GC-balanced codes is straightforward accomplished with binary balanced codes. We present codes that account for both the maximum repetition length and AT/GC balance. We compute the redundancy difference between the binary and a fully fledged quaternary approach.

Connected through hyperedge HE-1 (induced by source paper "on conflict free dna codes"):
  with members:
    - "asymptotically optimal codes correcting fixed length duplication errors in dna storage systems"
    - "the art of dna strings sixteen years of dna coding theory"
    - "a rewritable random access dna based storage system"
    - "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-2 (induced by source paper "efficient and explicit balanced primer codes"):
  with members:
    - "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"
    - "a rewritable random access dna based storage system"

Connected through hyperedge HE-3 (induced by source paper "loco codes lexicographically ordered constrained codes"):
  with members:
    - "on parity preserving constrained coding"
    - "a channel aware combinatorial approach to design high performance spatially coupled codes for magnetic recording systems"

Connected through hyperedge HE-4 (induced by source paper "optimal codes correcting a single indel edit for dna based data storage"):
  with members:
    - "repeat free codes"
    - "codes correcting a burst of deletions or insertions"

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)