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: "orienting fully dynamic graphs with worst case time bounds"
  Abstract: In edge orientations, the goal is usually to orient (direct) the edges of an undirected $n$-vertex graph $G$ such that all out-degrees are bounded. When the graph $G$ is fully dynamic, i.e., admits edge insertions and deletions, we wish to maintain such an orientation while keeping a tab on the update time. Low out-degree orientations turned out to be a surprisingly useful tool, with several algorithmic applications involving static or dynamic graphs. #R##N#Brodal and Fagerberg (1999) initiated the study of the edge orientation problem in terms of the graph's arboricity, which is very natural in this context. They provided a solution with constant out-degree and \emph{amortized} logarithmic update time for all graphs with constant arboricity, which include all planar and excluded-minor graphs. However, it remained an open question (first proposed by Brodal and Fagerberg, later by others) to obtain similar bounds with worst-case update time. #R##N#We resolve this 15 year old question in the affirmative, by providing a simple algorithm with worst-case bounds that nearly match the previous amortized bounds. Our algorithm is based on a new approach of a combinatorial invariant, and achieves a logarithmic out-degree with logarithmic worst-case update times. This result has applications in various dynamic graph problems such as maintaining a maximal matching, where we obtain $O(\log n)$ worst-case update time compared to the $O(\frac{\log n}{\log\log n})$ amortized update time of Neiman and Solomon (2013).

Connected through hyperedge HE-1 (induced by source paper "dynamic approximate shortest paths and beyond subquadratic and worst case update time"):
  with members:
    - "fully dynamic all pairs shortest paths improved worst case time and space bounds"
    - "dynamic matrix inverse improved algorithms and matching conditional lower bounds"
    - "sensitive distance and reachability oracles for large batch updates"
    - "towards tight approximation bounds for graph diameter and eccentricities"
    - "algorithms and hardness for diameter in dynamic graphs"
    - "diameter spanner eccentricity spanner and approximating extremal graph distances static dynamic and fault tolerant"
    - "a deamortization approach for dynamic spanner and dynamic maximal matching"
    - "deterministic partially dynamic single source shortest paths in weighted graphs"

Connected through hyperedge HE-2 (induced by source paper "improved dynamic graph coloring"):
  with members:
    - "fully dynamic mis in uniformly sparse graphs"
    - "fully dynamic maximal independent set with sublinear update time"
    - "testing bounded arboricity"
    - "fully dynamic almost maximal matching breaking the polynomial barrier for worst case time bounds"
    - "the shortest augmenting paths for online matchings on trees"
    - "dynamic algorithms for graph coloring"
    - "dynamic graph coloring"
    - "dynamic minimum spanning forest with subpolynomial worst case update time"

Connected through hyperedge HE-3 (induced by source paper "near optimal fully dynamic densest subgraph"):
  with members:
    - "distributed dense subgraph detection and low outdegree orientation"
    - "new algorithms and lower bounds for all pairs max flow in undirected graphs"
    - "inapproximability of maximum biclique problems minimum k cut and densest at least k subgraph from the small set expansion hypothesis"
    - "fully dynamic approximate maximum matching and minimum vertex cover in o log 3 n worst case update time"
    - "egalitarian graph orientations"
    - "the ubiquity of large graphs and surprising challenges of graph processing"
    - "new deterministic approximation algorithms for fully dynamic matching"
    - "popular conjectures as a barrier for dynamic planar graph algorithms"

Connected through hyperedge HE-4 (induced by source paper "distributed dense subgraph detection and low outdegree orientation"):
  with members:
    - "near optimal fully dynamic densest subgraph"
    - "improved distributed expander decomposition and nearly optimal triangle enumeration"
    - "distributed approximation algorithms for maximum matching in graphs and hypergraphs"
    - "improved deterministic distributed matching via rounding"
    - "improved distributed degree splitting and edge coloring"
    - "on derandomizing local distributed algorithms"
    - "distributed degree splitting edge coloring and orientations"
    - "densest subgraph in dynamic graph streams"

Connected through hyperedge HE-5 (induced by source paper "deterministically maintaining a 2 epsilon approximate minimum vertex cover in o 1 epsilon 2 amortized update time"):
  with members:
    - "fully dynamic approximate maximum matching and minimum vertex cover in o log 3 n worst case update time"
    - "dynamic matching reducing integral algorithms to approximately maximal fractional algorithms"
    - "fully dynamic almost maximal matching breaking the polynomial barrier for worst case time bounds"
    - "fully dynamic maximal matching in constant update time"
    - "design of dynamic algorithms via primal dual method"
    - "fully dynamic matching in bipartite graphs"
    - "deterministic fully dynamic data structures for vertex cover and matching"
    - "simple deterministic algorithms for fully dynamic maximal matching"

Connected through hyperedge HE-6 (induced by source paper "fully dynamic mis in uniformly sparse graphs"):
  with members:
    - "fully dynamic maximal independent set in expected poly log update time"
    - "fully dynamic maximal independent set with polylogarithmic update time"
    - "fully dynamic maximal independent set with sublinear update time"
    - "optimal dynamic distributed mis"
    - "greedy sequential maximal independent set and matching are parallel on average"
    - "simple deterministic algorithms for fully dynamic maximal matching"

Connected through hyperedge HE-7 (induced by source paper "fully dynamic almost maximal matching breaking the polynomial barrier for worst case time bounds"):
  with members:
    - "dynamic approximate matchings with an optimal recourse bound"
    - "the shortest augmenting paths for online matchings on trees"
    - "fully dynamic maximal matching in constant update time"
    - "new deterministic approximation algorithms for fully dynamic matching"
    - "fully dynamic minimum spanning forest with improved worst case update time"
    - "fault tolerant bfs structures a reinforcement backup tradeoff"
    - "fully dynamic matching in bipartite graphs"
    - "deterministic fully dynamic data structures for vertex cover and matching"

Connected through hyperedge HE-8 (induced by source paper "popular conjectures as a barrier for dynamic planar graph algorithms"):
  with members:
    - "improved bounds for shortest paths in dense distance graphs"
    - "on the hardness of partially dynamic graph problems and connections to diameter"
    - "faster online matrix vector multiplication"
    - "unifying and strengthening hardness for dynamic problems via the online matrix vector multiplication conjecture"
    - "simpler faster and shorter labels for distances in graphs"
    - "sublinear distance labeling for sparse graphs"
    - "a faster algorithm for the discrete frechet distance under translation"
    - "fully dynamic matching in bipartite graphs"

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)