human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "sorting and ranking of self delimiting numbers with applications to tree isomorphism"):
  Abstract: Assume that an $N$-bit sequence $S$ of $k$ self-delimiting numbers is given as input. We present space-efficient algorithms for sorting, dense ranking and (competitive) ranking $S$ on the word RAM model with word size $\Omega(\log N)$. Our algorithms run in $O(k + \frac{N}{\log N})$ time and use $O(N)$ bits. The sorting algorithm returns the given numbers in sorted order stored within a bit-vector of $N$ bits whereas our ranking algorithms construct data structures that allows us subsequently to return the (dense) rank of each number $x$ in $S$ in constant time if the position of $x$ in $S$ is given together with $x$. As an application of our algorithms we give an algorithm for tree isomorphism that runs in $O(n)$ time and uses $O(n)$ bits on $n$-node trees.

Includes members:
  Member "nearly optimal space efficient algorithm for depth first search":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "space efficient vertex separators for treewidth")
  Member "rank select indices without tears":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "space efficient vertex separators for treewidth")

Question: Please tell me which class the source paper 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)