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 "fast small and simple document listing on repetitive text collections"):
  Abstract: Document listing on string collections is the task of finding all documents where a pattern appears. It is regarded as the most fundamental document retrieval problem, and is useful in various applications. Many of the fastest-growing string collections are composed of very similar documents, such as versioned code and document collections, genome repositories, etc. Plain pattern-matching indexes designed for repetitive text collections achieve orders-of-magnitude reductions in space. Instead, there are not many analogous indexes for document retrieval. In this paper we present a simple document listing index for repetitive string collections of total length $n$ that lists the $ndoc$ distinct documents where a pattern of length $m$ appears in time $\mathcal{O}(m+ndoc \cdot \log n)$. We exploit the repetitiveness of the document array (i.e., the suffix array coarsened to document identifiers) to grammar-compress it while precomputing the answers to nonterminals, and store them in grammar-compressed form as well. Our experimental results show that our index sharply outperforms existing alternatives in the space/time tradeoff map.

Includes members:
  Member "fully functional suffix trees and optimal text searching in bwt runs bounded space":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "towards a definitive measure of repetitiveness")
  Member "document listing on repetitive collections with guaranteed performance":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "fully functional suffix trees and optimal text searching in bwt runs bounded space")
  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 "document retrieval on repetitive string collections":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a simple algorithm for computing the document array")
  Member "document retrieval on repetitive collections":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "document listing on repetitive collections with guaranteed performance")
  Member "a really simple approximation of smallest grammar":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "towards a definitive measure of repetitiveness")
  Member "spaces trees and colors the algorithmic landscape of document retrieval on sequences":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "document listing on repetitive collections with guaranteed performance")

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)