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 "a new deterministic algorithm for dynamic set cover"):
  Abstract: We present a deterministic dynamic algorithm for maintaining a $(1+\epsilon)f$-approximate minimum cost set cover with $O(f\log(Cn)/\epsilon^2)$ amortized update time, when the input set system is undergoing element insertions and deletions. Here, $n$ denotes the number of elements, each element appears in at most $f$ sets, and the cost of each set lies in the range $[1/C, 1]$. Our result, together with that of Gupta et al. [STOC`17], implies that there is a deterministic algorithm for this problem with $O(f\log(Cn))$ amortized update time and $O(\min(\log n, f))$-approximation ratio, which nearly matches the polynomial-time hardness of approximation for minimum set cover in the static setting. Our update time is only $O(\log (Cn))$ away from a trivial lower bound. #R##N#Prior to our work, the previous best approximation ratio guaranteed by deterministic algorithms was $O(f^2)$, which was due to Bhattacharya et al. [ICALP`15]. In contrast, the only result that guaranteed $O(f)$-approximation was obtained very recently by Abboud et al. [STOC`19], who designed a dynamic algorithm with $(1+\epsilon)f$-approximation ratio and $O(f^2 \log n/\epsilon)$ amortized update time. Besides the extra $O(f)$ factor in the update time compared to our and Gupta et al.'s results, the Abboud et al. algorithm is randomized, and works only when the adversary is oblivious and the sets are unweighted (each set has the same cost). #R##N#We achieve our result via the primal-dual approach, by maintaining a fractional packing solution as a dual certificate. Unlike previous primal-dual algorithms that try to satisfy some local constraints for individual sets at all time, our algorithm basically waits until the dual solution changes significantly globally, and fixes the solution only where the fix is needed.

Includes members:
  Member "dynamic matrix inverse improved algorithms and matching conditional lower bounds":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "solving tall dense linear programs in nearly linear time")
  Member "breaking quadratic time for small vertex connectivity and an approximation scheme":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a deterministic algorithm for balanced cut with applications to dynamic connectivity flows and beyond")
  Member "a new algorithm for decremental single source shortest paths with applications to vertex capacitated flow and cut problems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a deterministic algorithm for balanced cut with applications to dynamic connectivity flows and beyond")
  Member "a deamortization approach for dynamic spanner and dynamic maximal matching":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "dynamic graph algorithms with batch updates in the massively parallel computation model")
  Member "fully dynamic approximate maximum matching and minimum vertex cover in o log 3 n worst case update time":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "coarse grained complexity for dynamic algorithms")
  Member "dynamic minimum spanning forest with subpolynomial worst case update time":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "dynamic graph algorithms with batch updates in the massively parallel computation model")
  Member "deterministic fully dynamic approximate vertex cover and fractional matching in o 1 amortized update time":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "an improved algorithm for dynamic set cover")
  Member "fully dynamic maximal matching in constant update time":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "dynamic graph algorithms with batch updates in the massively parallel computation model")

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)