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 "tight bound on the maximum number of shortest unique substrings"):
  Abstract: A substring Q of a string S is called a shortest unique substring (SUS) for position p in S, if Q occurs exactly once in S, this occurrence of Q contains position p, and every substring of S which contains position p and is shorter than Q occurs at least twice in S. The SUS problem is, given a string S, to preprocess S so that for any subsequent query position p all the SUSs for position p can be answered quickly. There exist optimal O(n)-time preprocessing scheme which answers queries in optimal O(k) time, where n is the length of S and k is the number of SUSs for a query position. In this paper, we reveal structural, combinatorial properties underlying this problem: Namely, we show that the number of intervals in S that correspond to SUSs for all positions in S is less than 1.5n. We also show that this is a matching upper and lower bound.

Includes members:
  Member "on stabbing queries for generalized longest repeat":
    also connected through other hyperedges:
      (none)
  Member "an in place framework for exact and approximate shortest unique substring queries":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "compact data structures for shortest unique substring queries")
  Member "shortest unique substring query revisited":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "shortest unique palindromic substring queries on run length encoded strings")

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