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: "non overlapping codes"
  Abstract: We say that a    $q$   -ary length    $n$    code is non-overlapping if the set of non-trivial prefixes of codewords and the set of non-trivial suffices of codewords are disjoint. These codes were first studied by Levenshtein in 1964, motivated by applications in synchronization. More recently these codes were independently invented (under the name cross-bifix-free codes) by Bajic and Stojanovic. We provide a simple construction for a class of non-overlapping codes which has optimal cardinality whenever    $n$    divides    $q$   . Moreover, for all parameters    $n$    and    $q$   , we show that a code from this class is close to optimal, in the sense that it has cardinality within a constant factor of an upper bound due to Levenshtein from 1970. Previous constructions have cardinality within a constant factor of the upper bound only when    $q$    is fixed. Chee, Kiah, Purkayastha, and Wang showed that a    $q$   -ary length    $n$    non-overlapping code contains at most    $q^{n}/(2n-1)$    codewords; this bound is weaker than the Levenshtein bound. Their proof appealed to the application in synchronization: we provide a direct combinatorial argument to establish the bound of Chee  et al . We also consider codes of short length, finding the leading term of the maximal cardinality of a non-overlapping code when    $n$    is fixed and    $q\rightarrow \infty $   . The largest cardinality of non-overlapping codes of lengths 3 or less is determined exactly.

Connected through hyperedge HE-1 (induced by source paper "mutually uncorrelated codes for dna storage"):
  with members:
    - "codes correcting a burst of deletions or insertions"
    - "a rewritable random access dna based storage system"
    - "time space constrained codes for phase change memories"
    - "cross bifix free codes within a constant factor of optimality"
    - "a new approach to cross bifix free sets"

Connected through hyperedge HE-2 (induced by source paper "mutually uncorrelated primers for dna based data storage"):
  with members:
    - "mutually uncorrelated codes for dna storage"
    - "codes in the damerau distance for dna storage"
    - "asymmetric lee distance codes for dna based storage"
    - "a rewritable random access dna based storage system"

Connected through hyperedge HE-3 (induced by source paper "variable length non overlapping codes"):
  with members:
    - "a gray code for cross bifix free sets"
    - "non overlapping matrices"
    - "dna based storage trends and methods"
    - "a rewritable random access dna based storage system"
    - "cross bifix free codes within a constant factor of optimality"
    - "a new approach to cross bifix free sets"

Connected through hyperedge HE-4 (induced by source paper "non overlapping matrices"):
  with members:
    - "cross bifix free sets in two dimensions"
    - "cross bifix free codes within a constant factor of optimality"
    - "a new approach to cross bifix free sets"

Connected through hyperedge HE-5 (induced by source paper "weakly mutually uncorrelated codes"):
  with members:
    - "codes for dna sequence profiles"

Connected through hyperedge HE-6 (induced by source paper "disjoint difference families and their applications"):
  with members:
    - "new families of optimal frequency hopping sequence sets"
    - "a combinatorial model of interference in frequency hopping schemes"
    - "high rate self synchronizing codes"
    - "information theoretic authentication and secrecy codes in the splitting model"
    - "combinatorial bounds and characterizations of splitting authentication codes"
    - "strong secrecy and reliable byzantine detection in the presence of an untrusted relay"
    - "optimal rate code constructions for computationally simple channels"
    - "authentication and secrecy codes for equiprobable source probability distributions"

Connected through hyperedge HE-7 (induced by source paper "dna based storage trends and methods"):
  with members:
    - "asymmetric lee distance codes for dna based storage"
    - "a rewritable random access dna based storage system"
    - "codes for dna sequence profiles"
    - "codes for dna storage channels"

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.DM(Discrete Mathematics)