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 "twinless articulation points and some related problems"):
  Abstract: Let $G=(V,E)$ be a twinless strongly connected graph. a vertex $v\in V$ is a twinless articulation point if the subrgraph obtained from $G$ by removing the vertex $v$ is not twinless strongly connected. An edge $e\in E$ is a twinless bridge if the subgraph obtained from $G$ by deleting $e$ is not twiless strongly connected graph. In this paper we study twinless articulation points and twinless bridges. We also study the problem of finding a minimum cardinality edge subset $E_{1} \subseteq E$ such that the subgraph $(V,E_{1})$ is twinless strongly connected. Moreover, we present an algorithm for computing the $2$-vertex-twinless connected components of $G$.

Includes members:
  Member "finding 2 edge and 2 vertex strongly connected components in quadratic time":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "computing and testing small connectivity in near linear time and queries via fast local cut algorithms")
  Member "2 edge connectivity in directed graphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "2 edge twinless blocks")
  Member "computing the 2 blocks of directed graphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "2 edge twinless blocks")
  Member "on computing the 2 vertex connected components of directed graphs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "2 edge twinless blocks")
  Member "a simple test on 2 vertex and 2 edge connectivity":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a simple certifying algorithm for 3 edge connectivity")
  Member "approximating the minimum equivalent digraph":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "correspondent banking networks theory and experiment")

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)