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: "combined data structure for previous and next smaller values"
  Abstract: Let $A$ be a static array storing $n$ elements from a totally ordered set. We present a data structure of optimal size at most $n\log_2(3+2\sqrt{2})+o(n)$ bits that allows us to answer the following queries on $A$ in constant time, without accessing $A$: (1) previous smaller value queries, where given an index $i$, we wish to find the first index to the left of $i$ where $A$ is strictly smaller than at $i$, and (2) next smaller value queries, which search to the right of $i$. As an additional bonus, our data structure also allows to answer a third kind of query: given indices $i<j$, find the position of the minimum in $A[i..j]$. Our data structure has direct consequences for the space-efficient storage of suffix 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"
    - "optimal succinctness for range minimum queries"

Connected through hyperedge HE-2 (induced by source paper "the effective entropy of next previous larger smaller value queries"):
  with members:
    - "simultaneous encodings for range and next previous larger smaller value queries"
    - "an encoding for order preserving matching"
    - "optimal encodings for range top k selection and min max"

Connected through hyperedge HE-3 (induced by source paper "burrows wheeler transform and lcp array construction in constant space"):
  with members:
    - "linear time string indexing and analysis in small space"
    - "low space external memory construction of the succinct permuted longest common prefix array"
    - "faster average case low memory semi external construction of the burrows wheeler transform"
    - "space efficient construction of compressed indexes in deterministic linear time"
    - "in place longest common extensions"
    - "lightweight lcp construction for very large collections of strings"
    - "linear time construction of compressed text indices in compact space"
    - "lightweight lcp construction for next generation sequencing datasets"

Connected through hyperedge HE-4 (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"
    - "more haste less waste lowering the redundancy in fully indexable dictionaries"
    - "optimal succinctness for range minimum queries"

Connected through hyperedge HE-5 (induced by source paper "simultaneous encodings for range and next previous larger smaller value queries"):
  with members:
    - "optimal encodings for range top k selection and min max"
    - "encoding 2 d range maximum queries"
    - "succinct indexable dictionaries with applications to encoding k ary trees prefix sums and multisets"

Connected through hyperedge HE-6 (induced by source paper "linear time construction of compressed text indices in compact space"):
  with members:
    - "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"
    - "optimal succinctness for range minimum queries"

Connected through hyperedge HE-7 (induced by source paper "optimal encodings for range top k selection and min max"):
  with members:
    - "encodings of range maximum sum segment queries and applications"
    - "range quantile queries another virtue of wavelet trees"
    - "succinct indexable dictionaries with applications to encoding k ary trees prefix sums and multisets"

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)