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 mode and range median queries on lists and trees"
  Abstract: We consider algorithms for preprocessing labelled lists and trees so that, for any two nodes u and v we can answer queries of the form: What is the mode or median label in the sequence of labels on the path from u to v.

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"
    - "range quantile queries another virtue of wavelet trees"
    - "succinct indexable dictionaries with applications to encoding k ary trees prefix sums and multisets"

Connected through hyperedge HE-2 (induced by source paper "on the hardness of set disjointness and set intersection with bounded universe"):
  with members:
    - "how hard is it to find honest witnesses"
    - "conditional lower bounds for space time tradeoffs"
    - "data structure lower bounds for document indexing problems"
    - "dynamic set intersection"
    - "popular conjectures imply strong lower bounds for dynamic problems"
    - "on hardness of jumbled indexing"
    - "higher lower bounds from the 3sum conjecture"
    - "approximate distance oracle with constant query time"

Connected through hyperedge HE-3 (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"
    - "range quantile queries another virtue of wavelet trees"
    - "towards optimal range medians"

Connected through hyperedge HE-4 (induced by source paper "path and ancestor queries on trees with multidimensional weight vectors"):
  with members:
    - "sorted range reporting"
    - "more haste less waste lowering the redundancy in fully indexable dictionaries"

Connected through hyperedge HE-5 (induced by source paper "enumerating range modes"):
  with members:
    - "linear space data structures for range mode query in arrays"
    - "succinct indexable dictionaries with applications to encoding k ary trees prefix sums and multisets"

Connected through hyperedge HE-6 (induced by source paper "optimal algorithm for profiling dynamic arrays with finite values"):
  with members:
    - "densealert incremental dense subtensor detection in tensor streams"

Connected through hyperedge HE-7 (induced by source paper "range majorities and minorities in arrays"):
  with members:
    - "optimal encodings for range majority queries"
    - "optimal lower and upper bounds for representing sequences"
    - "dynamic range majority data structures"
    - "more haste less waste lowering the redundancy in fully indexable dictionaries"
    - "optimal succinctness for range minimum queries"
    - "searching for frequent colors in rectangles"

Connected through hyperedge HE-8 (induced by source paper "better space bounds for parameterized range majority and minority"):
  with members:
    - "new lower and upper bounds for representing sequences"
    - "dynamic range majority data structures"
    - "efficient fully compressed sequence representations"
    - "optimal succinctness for range minimum queries"
    - "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)