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 "space efficient biconnected components and recognition of outerplanar graphs"):
  Abstract: We present space-efficient algorithms for computing cut vertices in a given graph with $n$ vertices and $m$ edges in linear time using $O(n+\min\{m,n\log \log n\})$ bits. With the same time and using $O(n+m)$ bits, we can compute the biconnected components of a graph. We use this result to show an algorithm for the recognition of (maximal) outerplanar graphs in $O(n\log \log n)$ time using $O(n)$ bits.

Includes members:
  Member "rank select indices without tears":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "sorting and ranking of self delimiting numbers with applications to tree isomorphism")
  Member "improved space efficient linear time algorithms for some classical graph problems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "indexing graph search trees and applications")
  Member "succinct choice dictionaries":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "space efficient vertex separators for treewidth")
  Member "improved space efficient algorithms for bfs dfs and applications":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "fast breadth first search in still less space")
  Member "space efficient plane sweep algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "outer common tangents and nesting of convex hulls in linear time and constant workspace")
  Member "a simple test on 2 vertex and 2 edge connectivity":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a simple certifying algorithm for 3 edge connectivity")
  Member "space time trade offs for stack based algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "common tangents of two disjoint polygons in linear time and constant workspace")

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)