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: "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.

Connected through hyperedge HE-1 (induced by source paper "twinless articulation points and some related problems"):
  with members:
    - "finding 2 edge and 2 vertex strongly connected components in quadratic time"
    - "computing the 2 blocks of directed graphs"
    - "on computing the 2 vertex connected components of directed graphs"
    - "a simple test on 2 vertex and 2 edge connectivity"
    - "approximating the minimum equivalent digraph"

Connected through hyperedge HE-2 (induced by source paper "2 edge twinless blocks"):
  with members:
    - "twinless articulation points and some related problems"
    - "computing 2 twinless blocks"
    - "finding 2 edge and 2 vertex strongly connected components in quadratic time"
    - "computing the 2 blocks of directed graphs"
    - "on computing the 2 vertex connected components of directed graphs"

Connected through hyperedge HE-3 (induced by source paper "computing 2 twinless blocks"):
  with members:
    - "twinless articulation points and some related problems"
    - "finding 2 edge and 2 vertex strongly connected components in quadratic time"
    - "computing the 2 blocks of directed graphs"
    - "on computing the 2 vertex connected components of directed graphs"
    - "a simple test on 2 vertex and 2 edge connectivity"

Connected through hyperedge HE-4 (induced by source paper "incremental strong connectivity and 2 connectivity in directed graphs"):
  with members:
    - "decremental data structures for connectivity and dominators in directed graphs"
    - "incremental 2 edge connectivity in directed graphs"
    - "an experimental study of dynamic dominators"
    - "unifying and strengthening hardness for dynamic problems via the online matrix vector multiplication conjecture"
    - "prime factorization of the kirchhoff polynomial compact enumeration of arborescences"
    - "popular conjectures imply strong lower bounds for dynamic problems"

Connected through hyperedge HE-5 (induced by source paper "decremental single source reachability in planar digraphs"):
  with members:
    - "faster algorithms for computing maximal 2 connected subgraphs in sparse directed graphs"
    - "improved bounds for shortest paths in dense distance graphs"
    - "fully dynamic maximal matching in constant update time"
    - "popular conjectures as a barrier for dynamic planar graph algorithms"
    - "finding 2 edge and 2 vertex strongly connected components in quadratic time"
    - "improved algorithms for decremental single source reachability on directed graphs"
    - "sublinear time decremental algorithms for single source reachability and shortest paths on directed graphs"
    - "popular conjectures imply strong lower bounds for dynamic problems"

Connected through hyperedge HE-6 (induced by source paper "faster algorithms for computing maximal 2 connected subgraphs in sparse directed graphs"):
  with members:
    - "finding 2 edge and 2 vertex strongly connected components in quadratic time"
    - "deterministic global minimum cut of a simple graph in near linear time"
    - "on computing the 2 vertex connected components of directed graphs"
    - "minimum cuts in near linear time"

Connected through hyperedge HE-7 (induced by source paper "on low high orders of directed graphs incremental algorithms and applications"):
  with members:
    - "incremental 2 edge connectivity in directed graphs"
    - "an experimental study of dynamic dominators"
    - "finding 2 edge and 2 vertex strongly connected components in quadratic time"
    - "popular conjectures imply strong lower bounds for dynamic problems"
    - "computing the 2 blocks of directed graphs"
    - "on computing the 2 vertex connected components of directed graphs"
    - "finding dominators via disjoint set union"
    - "a new approach to incremental cycle detection and related problems"

Connected through hyperedge HE-8 (induced by source paper "incremental 2 edge connectivity in directed graphs"):
  with members:
    - "an experimental study of dynamic dominators"
    - "finding 2 edge and 2 vertex strongly connected components in quadratic time"
    - "popular conjectures imply strong lower bounds for dynamic problems"
    - "computing the 2 blocks of directed graphs"
    - "on computing the 2 vertex connected components of directed graphs"
    - "finding dominators via disjoint set union"
    - "a new approach to incremental cycle detection and related problems"
    - "incremental cycle detection topological ordering and strong component maintenance"

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)