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 "2 edge connectivity in directed graphs"):
  Abstract: Edge and vertex connectivity are fundamental concepts in graph theory. While they have been thoroughly studied in the case of undirected graphs, surprisingly not much has been investigated for directed graphs. In this paper we study $2$-edge connectivity problems in directed graphs and, in particular, we consider the computation of the following natural relation: We say that two vertices $v$ and $w$ are $2$-edge-connected if there are two edge-disjoint paths from $v$ to $w$ and two edge-disjoint paths from $w$ to $v$. This relation partitions the vertices into blocks such that all vertices in the same block are $2$-edge-connected. Differently from the undirected case, those blocks do not correspond to the $2$-edge-connected components of the graph. We show how to compute this relation in linear time so that we can report in constant time if two vertices are $2$-edge-connected. We also show how to compute in linear time a sparse certificate for this relation, i.e., a subgraph of the input graph that has $O(n)$ edges and maintains the same $2$-edge-connected blocks as the input graph.

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 "approximating the smallest spanning subgraph for 2 edge connectivity in directed graphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "strong connectivity in directed graphs under failures with application")
  Member "computing the 2 blocks of directed graphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "twinless articulation points and some related problems")
  Member "on computing the 2 vertex connected components of directed graphs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "twinless articulation points and some related problems")
  Member "finding dominators via disjoint set union":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "concurrent disjoint set union")
  Member "dominator tree certification and independent spanning trees":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "approximating the smallest spanning subgraph for 2 edge connectivity in directed graphs")

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)