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: "finding dominators via disjoint set union"
  Abstract: The problem of finding dominators in a directed graph has many important applications, notably in global optimization of computer code. Although linear and near-linear-time algorithms exist, they use sophisticated data structures. We develop an algorithm for finding dominators that uses only a "static tree" disjoint set data structure in addition to simple lists and maps. The algorithm runs in near-linear or linear time, depending on the implementation of the disjoint set data structure. We give several versions of the algorithm, including one that computes loop nesting information (needed in many kinds of global code optimization) and that can be made self-certifying, so that the correctness of the computed dominators is very easy to verify.

Connected through hyperedge HE-1 (induced by source paper "concurrent disjoint set union"):
  with members:
    - "simple concurrent labeling algorithms for connected components"
    - "a randomized concurrent algorithm for disjoint set union"

Connected through hyperedge HE-2 (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"
    - "2 edge connectivity in directed graphs"
    - "computing the 2 blocks of directed graphs"
    - "on computing the 2 vertex connected components of directed graphs"
    - "a new approach to incremental cycle detection and related problems"

Connected through hyperedge HE-3 (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"
    - "2 edge connectivity in directed graphs"
    - "computing the 2 blocks of directed graphs"
    - "on computing the 2 vertex connected components of directed graphs"
    - "a new approach to incremental cycle detection and related problems"
    - "incremental cycle detection topological ordering and strong component maintenance"

Connected through hyperedge HE-4 (induced by source paper "an experimental study of dynamic dominators"):
  with members:
    - "finding 2 edge and 2 vertex strongly connected components in quadratic time"
    - "2 edge connectivity in directed graphs"
    - "computing the 2 blocks of directed graphs"
    - "on computing the 2 vertex connected components of directed graphs"
    - "influence maximization in continuous time diffusion networks"

Connected through hyperedge HE-5 (induced by source paper "strong connectivity in directed graphs under failures with application"):
  with members:
    - "finding 2 edge and 2 vertex strongly connected components in quadratic time"
    - "approximating the smallest spanning subgraph for 2 edge connectivity in directed graphs"
    - "2 edge connectivity in directed graphs"
    - "computing the 2 blocks of directed graphs"

Connected through hyperedge HE-6 (induced by source paper "a new framework for strong connectivity and 2 connectivity in directed graphs"):
  with members:
    - "finding 2 edge and 2 vertex strongly connected components in quadratic time"
    - "approximating the smallest spanning subgraph for 2 edge connectivity in directed graphs"
    - "2 edge connectivity in directed graphs"
    - "computing the 2 blocks of directed graphs"

Connected through hyperedge HE-7 (induced by source paper "2 edge connectivity in directed graphs"):
  with members:
    - "finding 2 edge and 2 vertex strongly connected components in quadratic time"
    - "approximating the smallest spanning subgraph for 2 edge connectivity in directed graphs"
    - "computing the 2 blocks of directed graphs"
    - "on computing the 2 vertex connected components of directed graphs"
    - "dominator tree certification and independent spanning trees"

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)