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: "incremental cycle detection topological ordering and strong component maintenance"
  Abstract: We present two on-line algorithms for maintaining a topological order of a directed $n$-vertex acyclic graph as arcs are added, and detecting a cycle when one is created. Our first algorithm handles $m$ arc additions in $O(m^{3/2})$ time. For sparse graphs ($m/n = O(1)$), this bound improves the best previous bound by a logarithmic factor, and is tight to within a constant factor among algorithms satisfying a natural {\em locality} property. Our second algorithm handles an arbitrary sequence of arc additions in $O(n^{5/2})$ time. For sufficiently dense graphs, this bound improves the best previous bound by a polynomial factor. Our bound may be far from tight: we show that the algorithm can take $\Omega(n^2 2^{\sqrt{2\lg n}})$ time by relating its performance to a generalization of the $k$-levels problem of combinatorial geometry. A completely different algorithm running in $\Theta(n^2 \log n)$ time was given recently by Bender, Fineman, and Gilbert. We extend both of our algorithms to the maintenance of strong components, without affecting the asymptotic time bounds.

Connected through hyperedge HE-1 (induced by source paper "an algorithmic approach to handle circulartrading in commercial taxing system"):
  with members:
    - "a new approach to incremental cycle detection and related problems"

Connected through hyperedge HE-2 (induced by source paper "dynamic shortest path and transitive closure algorithms a survey"):
  with members:
    - "dynamic planar embeddings of dynamic graphs"
    - "tight bounds for online coloring of basic graph classes"
    - "a survey of shortest path algorithms"
    - "popular conjectures as a barrier for dynamic planar graph algorithms"
    - "faster online matrix vector multiplication"
    - "improved algorithms for decremental single source reachability on directed graphs"
    - "higher lower bounds from the 3sum conjecture"
    - "fully dynamic all pairs all shortest paths"

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"
    - "finding dominators via disjoint set union"
    - "a new approach to incremental cycle detection and related problems"

Connected through hyperedge HE-4 (induced by source paper "unifying and strengthening hardness for dynamic problems via the online matrix vector multiplication conjecture"):
  with members:
    - "improved algorithms for decremental single source reachability on directed graphs"
    - "space and time efficient algorithm for maintaining dense subgraphs on one pass dynamic streams"
    - "decremental single source shortest paths on undirected graphs in near linear total update time"
    - "powers of tensors and fast matrix multiplication"
    - "sublinear time decremental algorithms for single source reachability and shortest paths on directed graphs"
    - "3sum hardness in dynamic data structures"
    - "popular conjectures imply strong lower bounds for dynamic problems"
    - "higher lower bounds from the 3sum conjecture"

Connected through hyperedge HE-5 (induced by source paper "popular conjectures imply strong lower bounds for dynamic problems"):
  with members:
    - "on problems as hard as cnf sat"
    - "powers of tensors and fast matrix multiplication"
    - "3sum 3xor triangles"
    - "exact weight subgraphs and the k sum conjecture"
    - "faster all pairs shortest paths via circuit complexity"
    - "dynamic approximate all pairs shortest paths breaking the o mn barrier and derandomization"
    - "navigating central path with electrical flows from flows to matchings and back"
    - "deterministic parameterized connected vertex cover"

Connected through hyperedge HE-6 (induced by source paper "sampling based temporal logic path planning"):
  with members:
    - "sampling based algorithms for optimal motion planning"

Connected through hyperedge HE-7 (induced by source paper "a labeling approach to incremental cycle detection"):
  with members:
    - "faster algorithms for online topological ordering"

Connected through hyperedge HE-8 (induced by source paper "a new approach to incremental cycle detection and related problems"):
  with members:
    - "average case analysis of online topological ordering"
    - "faster algorithms for online topological ordering"
    - "an o n 2 75 algorithm for online topological ordering"

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)