human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "range quantile queries another virtue of wavelet trees"
  Abstract: We show how to use a balanced wavelet tree as a data structure that stores a list of numbers and supports efficient {\em range quantile queries}. A range quantile query takes a rank and the endpoints of a sublist and returns the number with that rank in that sublist. For example, if the rank is half the sublist's length, then the query returns the sublist's median. We also show how these queries can be used to support space-efficient {\em coloured range reporting} and {\em document listing}.

Connected through hyperedge HE-1 (induced by source paper "path query data structures in practice"):
  with members:
    - "aggregated 2d range queries on clustered points"
    - "orthogonal range searching on the ram revisited"
    - "succinct representations of permutations and functions"
    - "succinct indexable dictionaries with applications to encoding k ary trees prefix sums and multisets"
    - "range mode and range median queries on lists and trees"

Connected through hyperedge HE-2 (induced by source paper "on approximate range mode and range selection"):
  with members:
    - "improved time and space bounds for dynamic range mode"
    - "dynamic range selection in linear space"
    - "towards optimal range medians"
    - "range mode and range median queries on lists and trees"

Connected through hyperedge HE-3 (induced by source paper "efficient compressed wavelet trees over large alphabets"):
  with members:
    - "optimal dynamic sequence representations"
    - "new lower and upper bounds for representing sequences"
    - "on compressing permutations and adaptive sorting"
    - "new algorithms on wavelet trees and applications to information retrieval"
    - "succinct representations of dynamic strings"
    - "efficient fully compressed sequence representations"
    - "fully functional static and dynamic succinct trees"
    - "fast in memory xpath search over compressed text and tree indexes"

Connected through hyperedge HE-4 (induced by source paper "optimal encodings for range top k selection and min max"):
  with members:
    - "encodings of range maximum sum segment queries and applications"
    - "combined data structure for previous and next smaller values"
    - "succinct indexable dictionaries with applications to encoding k ary trees prefix sums and multisets"

Connected through hyperedge HE-5 (induced by source paper "spaces trees and colors the algorithmic landscape of document retrieval on sequences"):
  with members:
    - "orthogonal range searching for text indexing"
    - "optimal top k document retrieval"
    - "on optimal top k string retrieval"
    - "faster compact top k document retrieval"
    - "new lower and upper bounds for representing sequences"
    - "towards an optimal space and query time index for top k document retrieval"
    - "space efficient data analysis queries on grids"
    - "new algorithms on wavelet trees and applications to information retrieval"

Connected through hyperedge HE-6 (induced by source paper "space efficient data analysis queries on grids"):
  with members:
    - "orthogonal range searching on the ram revisited"
    - "new algorithms on wavelet trees and applications to information retrieval"
    - "succinct representations of dynamic strings"
    - "fully functional static and dynamic succinct trees"
    - "optimal succinctness for range minimum queries"
    - "searching for frequent colors in rectangles"
    - "practical entropy compressed rank select dictionary"

Connected through hyperedge HE-7 (induced by source paper "towards an optimal space and query time index for top k document retrieval"):
  with members:
    - "optimal trade off for succinct string indexes"
    - "top k color queries for document retrieval"
    - "optimal succinctness for range minimum queries"
    - "succinct indexable dictionaries with applications to encoding k ary trees prefix sums and multisets"

Connected through hyperedge HE-8 (induced by source paper "linear space data structures for range mode query in arrays"):
  with members:
    - "towards optimal range medians"
    - "biased range trees"
    - "optimal succinctness for range minimum queries"
    - "range mode and range median queries on lists and trees"

Question: Please tell me which class the center node 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)