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: "sorted range reporting"
  Abstract: In this paper we consider a variant of the orthogonal range reporting problem when all points should be reported in the sorted order of their $x$-coordinates. We show that reporting two-dimensional points with this additional condition can be organized (almost) as efficiently as the standard range reporting. #R##N#Moreover, our results generalize and improve the previously known results for the orthogonal range successor problem and can be used to obtain better solutions for some stringology problems.

Connected through hyperedge HE-1 (induced by source paper "four dimensional dominance range reporting in linear space"):
  with members:
    - "succinct indices for range queries with applications to orthogonal range maxima"
    - "more haste less waste lowering the redundancy in fully indexable dictionaries"
    - "space efficient multi dimensional range reporting"

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

Connected through hyperedge HE-3 (induced by source paper "improved algorithms for maintaining dfs tree in undirected graphs"):
  with members:
    - "dynamic dfs in undirected graphs breaking the o m barrier"
    - "improved distance sensitivity oracles via tree partitioning"
    - "simple deterministic algorithms for fully dynamic maximal matching"
    - "fully dynamic maximal matching in o log n update time"

Connected through hyperedge HE-4 (induced by source paper "range predecessor and lempel ziv parsing"):
  with members:
    - "faster lightweight lempel ziv parsing"
    - "wavelet trees meet suffix trees"
    - "linear time construction of compressed text indices in compact space"
    - "queries on lz bounded encodings"
    - "lightweight lempel ziv parsing"
    - "faster compact on line lempel ziv factorization"
    - "linear time lempel ziv factorization simple fast small"
    - "succinct indices for range queries with applications to orthogonal range maxima"

Connected through hyperedge HE-5 (induced by source paper "orthogonal range searching for text indexing"):
  with members:
    - "spaces trees and colors the algorithmic landscape of document retrieval on sequences"
    - "binary jumbled string matching for highly run length compressible texts"
    - "linear space substring range counting over polylogarithmic alphabets"
    - "compact binary relation representations with rich functionality"
    - "on optimal top k string retrieval"
    - "orthogonal range searching on the ram revisited"
    - "improved grammar based compressed indexes"
    - "encoding 2 d range maximum queries"

Connected through hyperedge HE-6 (induced by source paper "internal pattern matching queries in a text and applications"):
  with members:
    - "wavelet trees meet suffix trees"
    - "sorted range reporting revisited"
    - "orthogonal range searching for text indexing"
    - "searching of gapped repeats and subrepetitions in a word"
    - "pattern matching in lempel ziv compressed strings fast simple and deterministic"
    - "on the maximal sum of exponents of runs in a string"

Connected through hyperedge HE-7 (induced by source paper "optimal planar orthogonal skyline counting queries"):
  with members:
    - "orthogonal range searching on the ram revisited"
    - "unifying the landscape of cell probe lower bounds"
    - "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 "sorted range reporting revisited"):
  with members:
    - "orthogonal range searching on the ram revisited"
    - "more haste less waste lowering the redundancy in fully indexable dictionaries"

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)