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 "rounding dynamic matchings against an adaptive adversary"):
  Abstract: We present a new dynamic matching sparsification scheme. From this scheme we derive a framework for dynamically rounding fractional matchings against \emph{adaptive adversaries}. Plugging in known dynamic fractional matching algorithms into our framework, we obtain numerous randomized dynamic matching algorithms which work against adaptive adversaries (the first such algorithms, as all previous randomized algorithms for this problem assumed an \emph{oblivious} adversary). In particular, for any constant $\epsilon>0$, our framework yields $(2+\epsilon)$-approximate algorithms with constant update time or polylog worst-case update time, as well as $(2-\delta)$-approximate algorithms in bipartite graphs with arbitrarily-small polynomial update time, with all these algorithms' guarantees holding against adaptive adversaries. All these results achieve \emph{polynomially} better update time to approximation tradeoffs than previously known to be achievable against adaptive adversaries.

Includes members:
  Member "decremental sssp in weighted digraphs faster and against an adaptive adversary":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "new algorithms and hardness for incremental single source shortest paths in directed graphs")
  Member "deterministic algorithms for decremental approximate shortest paths faster and simpler":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "new algorithms and hardness for incremental single source shortest paths in directed graphs")
  Member "tight bounds for online edge coloring":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "online matching with general arrivals")
  Member "distributed weighted matching via randomized composable coresets":
    also connected through other hyperedges:
      (none)
  Member "online matching with general arrivals":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "online graph matching problems with a worst case reassignment budget")
  Member "dynamic low stretch trees via dynamic low diameter decompositions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "practice of streaming and dynamic graphs concepts models systems and parallelism")
  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-6 (induced by source paper "a deterministic algorithm for balanced cut with applications to dynamic connectivity flows and beyond")
  Member "towards a unified theory of sparsification for matching problems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "stochastic matching with few queries 1 varepsilon approximation")

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)