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: "rank select indices without tears"
  Abstract: A rank-select index for a sequence $B=(b_1,\ldots,b_n)$ of $n$ bits is a data structure that, if provided with an operation to access $\Theta(\log n)$ arbitrary consecutive bits of $B$ in constant time (thus $B$ is stored outside of the data structure), can compute $\mathit{rank}_B(j)=\sum_{i=1}^j b_i$ for given $j\in\{0,\ldots,n\}$ and $\mathit{select}_B(k)=\min\{j:\mathit{rank}_B(j)\ge k\}$ for given $k\in\{1,\ldots,\sum_{i=1}^n b_i\}$. We describe a new rank-select index that, like previous rank-select indices, occupies $O(n\log\log n/\log n)$ bits and executes $\mathit{rank}$ and $\mathit{select}$ queries in constant time. Its derivation is intended to be particularly easy to follow and largely free of tedious low-level detail, its operations are given by straight-line code, and we show that it can be constructed in $O(n/\log n)$ time.

Connected through hyperedge HE-1 (induced by source paper "sorting and ranking of self delimiting numbers with applications to tree isomorphism"):
  with members:
    - "nearly optimal space efficient algorithm for depth first search"

Connected through hyperedge HE-2 (induced by source paper "space efficient vertex separators for treewidth"):
  with members:
    - "benchmarking treewidth as a practical component of tensor network simulations"
    - "space efficient dfs and applications simpler leaner faster"
    - "small uncolored and colored choice dictionaries"
    - "nearly optimal space efficient algorithm for depth first search"
    - "in place initializable arrays"
    - "on the fly array initialization in less space"
    - "succinct choice dictionaries"

Connected through hyperedge HE-3 (induced by source paper "space efficient dfs and applications simpler leaner faster"):
  with members:
    - "an optimal choice dictionary"
    - "succinct choice dictionaries"
    - "a simple test on 2 vertex and 2 edge connectivity"

Connected through hyperedge HE-4 (induced by source paper "space efficient biconnected components and recognition of outerplanar graphs"):
  with members:
    - "improved space efficient linear time algorithms for some classical graph problems"
    - "succinct choice dictionaries"
    - "improved space efficient algorithms for bfs dfs and applications"
    - "space efficient plane sweep algorithms"
    - "a simple test on 2 vertex and 2 edge connectivity"
    - "space time trade offs for stack based algorithms"

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)