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: "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.

Connected through hyperedge HE-1 (induced by source paper "document listing on repetitive collections with guaranteed performance"):
  with members:
    - "fast prefix search in little space with applications"
    - "universal compressed text indexing"
    - "time space trade offs for lempel ziv compressed indexing"
    - "compressed indexing with signature grammars"
    - "optimal time text indexing in bwt runs bounded space"
    - "document retrieval on repetitive string collections"
    - "fully dynamic data structure for lce queries in compressed space"
    - "composite repetition aware data structures"

Connected through hyperedge HE-2 (induced by source paper "parallel construction of wavelet trees on multicore architectures"):
  with members:
    - "parallel wavelet tree construction"
    - "succinct indexable dictionaries with applications to encoding k ary trees prefix sums and multisets"

Connected through hyperedge HE-3 (induced by source paper "aggregated 2d range queries on clustered points"):
  with members:
    - "faster compressed quadtrees"
    - "compact binary relation representations with rich functionality"
    - "layered label propagation a multiresolution coordinate free ordering for compressing social networks"
    - "practical entropy compressed rank select dictionary"

Connected through hyperedge HE-4 (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"
    - "new algorithms on wavelet trees and applications to information retrieval"
    - "optimal trade off for succinct string indexes"

Connected through hyperedge HE-5 (induced by source paper "optimal top k document retrieval"):
  with members:
    - "fast prefix search in little space with applications"
    - "alphabet dependent string searching with wexponential search trees"
    - "spaces trees and colors the algorithmic landscape of document retrieval on sequences"
    - "faster compact top k document retrieval"
    - "orthogonal range searching on the ram revisited"
    - "towards an optimal space and query time index for top k document retrieval"
    - "new algorithms on wavelet trees and applications to information retrieval"
    - "top k color queries for document retrieval"

Connected through hyperedge HE-6 (induced by source paper "compact binary relation representations with rich functionality"):
  with members:
    - "sorted range reporting"
    - "optimal dynamic sequence representations"
    - "orthogonal range searching on the ram revisited"
    - "new algorithms on wavelet trees and applications to information retrieval"
    - "compressed representations of permutations and applications"
    - "fully functional static and dynamic succinct trees"
    - "optimal succinctness for range minimum queries"
    - "succinct indexable dictionaries with applications to encoding k ary trees prefix sums and multisets"

Connected through hyperedge HE-7 (induced by source paper "dynamic range majority data structures"):
  with members:
    - "better space bounds for parameterized range majority and minority"
    - "optimal dynamic sequence representations"
    - "dynamic range selection in linear space"
    - "counting colours in compressed strings"
    - "searching for frequent colors in rectangles"
    - "dynamic ordered sets with exponential search 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)