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: "optimal succinctness for range minimum queries"
  Abstract: For a static array A of n ordered objects, a range minimum query asks for the position of the minimum between two specified array indices. We show how to preprocess A into a scheme of size 2n+o(n) bits that allows to answer range minimum queries on A in constant time. This space is asymptotically optimal in the important setting where access to A is not permitted after the preprocessing step. Our scheme can be computed in linear time, using only n + o(n) additional bits at construction time. In interesting by-product is that we also improve on LCA-computation in BPS- or DFUDS-encoded trees.

Connected through hyperedge HE-1 (induced by source paper "space efficient construction of lyndon arrays in linear time"):
  with members:
    - "inducing the lyndon array"
    - "lyndon array construction during burrows wheeler inversion"
    - "algorithms to compute the lyndon array"
    - "combined data structure for previous and next smaller values"

Connected through hyperedge HE-2 (induced by source paper "linear time string indexing and analysis in small space"):
  with members:
    - "string synchronizing sets sublinear time bwt construction and optimal lce data structure"
    - "space efficient construction of compressed indexes in deterministic linear time"
    - "a framework for space efficient string kernels"
    - "linear time construction of compressed text indices in compact space"
    - "linear time computation of minimal absent words using suffix array"
    - "optimal dynamic sequence representations"
    - "combined data structure for previous and next smaller values"
    - "more haste less waste lowering the redundancy in fully indexable dictionaries"

Connected through hyperedge HE-3 (induced by source paper "succinct data structure for nearest colored node in a tree"):
  with members:
    - "efficient vertex label distance oracles for planar graphs"
    - "compressed subsequence matching and packed tree coloring"
    - "succinct representation of labeled trees"
    - "the power of dynamic distance oracles efficient dynamic algorithms for the steiner tree"
    - "new lower and upper bounds for representing sequences"
    - "improved distance oracles and spanners for vertex labeled graphs"

Connected through hyperedge HE-4 (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"
    - "searching for frequent colors in rectangles"
    - "range mode and range median queries on lists and trees"

Connected through hyperedge HE-5 (induced by source paper "low space external memory construction of the succinct permuted longest common prefix array"):
  with members:
    - "faster average case low memory semi external construction of the burrows wheeler transform"
    - "sampled longest common prefix array"
    - "lightweight data indexing and compression in external memory"

Connected through hyperedge HE-6 (induced by source paper "lempel ziv computation in small space lz ciss"):
  with members:
    - "alphabet dependent string searching with wexponential search trees"
    - "simpler and faster lempel ziv factorization"
    - "a linear time algorithm for seeds computation"
    - "fully functional static and dynamic succinct trees"

Connected through hyperedge HE-7 (induced by source paper "linear time construction of compressed text indices in compact space"):
  with members:
    - "combined data structure for previous and next smaller values"
    - "optimal trade off for succinct string indexes"
    - "more haste less waste lowering the redundancy in fully indexable dictionaries"
    - "fully functional static and dynamic succinct trees"

Connected through hyperedge HE-8 (induced by source paper "towards tight lower bounds for range reporting on the ram"):
  with members:
    - "certificates in data structures"
    - "optimal planar orthogonal skyline counting queries"
    - "orthogonal range searching on the ram revisited"
    - "the power of simple tabulation hashing"

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)