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: "improved lower bounds for constant gc content dna codes"
  Abstract: The design of large libraries of oligonucleotides having constant-content and satisfying Hamming distance constraints between oligonucleotides and their Watson-Crick complements is important in reducing hybridization errors in DNA computing, DNA microarray technologies, and molecular bar coding. Various techniques have been studied for the construction of such oligonucleotide libraries, ranging from algorithmic constructions via stochastic local search to theoretical constructions via coding theory. A new stochastic local search method is introduced, which yields improvements for more than one third of the benchmark lower bounds of Gaborit and King (2005) for n-mer oligonucleotide libraries when n les 14. Several optimal libraries are also found by computing maximum cliques on certain graphs.

Connected through hyperedge HE-1 (induced by source paper "dna linear block codes generation error detection and error correction of dna codeword"):
  with members:
    - "a rewritable random access dna based storage system"

Connected through hyperedge HE-2 (induced by source paper "optimal ternary constant composition codes with weight four and distance six"):
  with members:
    - "group divisible codes and their application in the construction of optimal constant composition codes of weight three"
    - "channel coding the road to channel capacity"

Connected through hyperedge HE-3 (induced by source paper "quaternary constant composition codes with weight four and distances five or six"):
  with members:
    - "linear size optimal q ary constant weight codes and constant composition codes"
    - "a construction for constant composition codes"
    - "group divisible codes and their application in the construction of optimal constant composition codes of weight three"
    - "the pbd closure of constant composition codes"
    - "channel coding the road to channel capacity"

Connected through hyperedge HE-4 (induced by source paper "linear size optimal q ary constant weight codes and constant composition codes"):
  with members:
    - "group divisible codes and their application in the construction of optimal constant composition codes of weight three"
    - "the sizes of optimal q ary codes of weight three and distance four a complete solution"
    - "constructions for q ary constant weight codes"
    - "the pbd closure of constant composition codes"
    - "channel coding the road to channel capacity"

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)