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 "orthogonal range searching for text indexing"):
  Abstract: Text indexing, the problem in which one desires to preprocess a (usually large) text for future (shorter) queries, has been researched ever since the suffix tree was invented in the early 70's. With textual data continuing to increase and with changes in the way it is accessed, new data structures and new algorithmic methods are continuously required. Therefore, text indexing is of utmost importance and is a very active research domain. #R##N#Orthogonal range searching, classically associated with the computational geometry community, is one of the tools that has increasingly become important for various text indexing applications. Initially, in the mid 90's there were a couple of results recognizing this connection. In the last few years we have seen an increase in use of this method and are reaching a deeper understanding of the range searching uses for text indexing. #R##N#In this monograph we survey some of these results.

Includes members:
  Member "spaces trees and colors the algorithmic landscape of document retrieval on sequences":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fast small and simple document listing on repetitive text collections")
  Member "binary jumbled string matching for highly run length compressible texts":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on abelian longest common factor with and without rle")
  Member "linear space substring range counting over polylogarithmic alphabets":
    also connected through other hyperedges:
      (none)
  Member "compact binary relation representations with rich functionality":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "compressed data structures for binary relations in practice")
  Member "on optimal top k string retrieval":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "spaces trees and colors the algorithmic landscape of document retrieval on sequences")
  Member "sorted range reporting":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "four dimensional dominance range reporting in linear space")
  Member "orthogonal range searching on the ram revisited":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "path query data structures in practice")
  Member "improved grammar based compressed indexes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "top tree compression of tries")

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)