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 "space efficient data analysis queries on grids"):
  Abstract: We consider various data-analysis queries on two-dimensional points. We give new space/time tradeoffs over previous work on geometric queries such as dominance and rectangle visibility, and on semigroup and group queries such as sum, average, variance, minimum and maximum. We also introduce new solutions to queries less frequently considered in the literature such as two-dimensional quantiles, majorities, successor/predecessor, mode, and various top-$k$ queries, considering static and dynamic scenarios.

Includes members:
  Member "orthogonal range searching on the ram revisited":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "path query data structures in practice")
  Member "new algorithms on wavelet trees and applications to information retrieval":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "edge minimization in de bruijn graphs")
  Member "succinct representations of dynamic strings":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "compressed dynamic range majority and minority data structures")
  Member "range quantile queries another virtue of wavelet trees":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "path query data structures in practice")
  Member "fully functional static and dynamic succinct trees":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "fully functional bidirectional burrows wheeler indexes")
  Member "optimal succinctness for range minimum queries":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "space efficient construction of lyndon arrays in linear time")
  Member "searching for frequent colors in rectangles":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "compressed dynamic range majority and minority data structures")
  Member "practical entropy compressed rank select dictionary":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "bitvectors with runs and the successor predecessor problem")

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)