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: "succinct indices for range queries with applications to orthogonal range maxima"
  Abstract: We consider the problem of preprocessing $N$ points in 2D, each endowed with a priority, to answer the following queries: given a axis-parallel rectangle, determine the point with the largest priority in the rectangle. Using the ideas of the \emph{effective entropy} of range maxima queries and \emph{succinct indices} for range maxima queries, we obtain a structure that uses O(N) words and answers the above query in $O(\log N \log \log N)$ time. This is a direct improvement of Chazelle's result from FOCS 1985 for this problem -- Chazelle required $O(N/\epsilon)$ words to answer queries in $O((\log N)^{1+\epsilon})$ time for any constant $\epsilon > 0$.

Connected through hyperedge HE-1 (induced by source paper "four dimensional dominance range reporting in linear space"):
  with members:
    - "sorted range reporting"
    - "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 "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"
    - "sorted range reporting"

Connected through hyperedge HE-3 (induced by source paper "submatrix maximum queries in monge matrices are equivalent to predecessor search"):
  with members:
    - "improved submatrix maximum queries in monge matrices"
    - "orthogonal range searching for text indexing"
    - "orthogonal range searching on the ram revisited"

Connected through hyperedge HE-4 (induced by source paper "improved submatrix maximum queries in monge matrices"):
  with members:
    - "multiple source multiple sink maximum flow in directed planar graphs in near linear time"
    - "orthogonal range searching on the ram revisited"

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)