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 "compressed indexing with signature grammars"):
  Abstract: The compressed indexing problem is to preprocess a string $S$ of length $n$ into a compressed representation that supports pattern matching queries. That is, given a string $P$ of length $m$ report all occurrences of $P$ in $S$. #R##N#We present a data structure that supports pattern matching queries in $O(m + occ (\lg\lg n + \lg^\epsilon z))$ time using $O(z \lg(n / z))$ space where $z$ is the size of the LZ77 parse of $S$ and $\epsilon > 0$, when the alphabet is small or the compression ratio is at least polynomial. We also present two data structures for the general case; one where the space is increased by $O(z\lg\lg z)$, and one where the query time changes from worst-case to expected. #R##N#In all cases, the results improve the previously best known solutions. Notably, this is the first data structure that decides if $P$ occurs in $S$ in $O(m)$ time using $O(z\lg(n/z))$ space. #R##N#Our results are mainly obtained by a novel combination of a randomized grammar construction algorithm with well known techniques relating pattern matching to 2D-range reporting.

Includes members:
  Member "fast prefix search in little space with applications":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fully functional suffix trees and optimal text searching in bwt runs bounded space")
  Member "time space trade offs for lempel ziv compressed indexing":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "top tree compression of tries")
  Member "optimal time text indexing in bwt runs bounded space":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "fast indexes for gapped pattern matching")
  Member "longest common extensions with recompression":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "tight lower bounds for the longest common extension problem")
  Member "dynamic index lz factorization and lce queries in compressed space":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "rpair rescaling repair with rsync")
  Member "optimal dynamic strings":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "online algorithms for constructing linear size suffix trie")
  Member "orthogonal range searching on the ram revisited":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "path query data structures in practice")
  Member "faster fully compressed pattern matching by recompression":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "grammar compression with probabilistic context free grammar")

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.DS(Data Structures and Algorithms)