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 complexity dichotomy for hitting connected minors on bounded treewidth graphs the chair and the banner draw the boundary"):
  Abstract: For a fixed connected graph $H$, the $\{H\}$-M-DELETION problem asks, given a graph $G$, for the minimum number of vertices that intersect all minor models of $H$ in $G.$ It is known that this problem can be solved in time $f(tw)\cdot n^{O(1)}$, where $tw$ is the treewidth of $G.$ We determine the asymptotically optimal function $f(tw),$ for each possible choice of $H.$ Namely, we prove that, under the ETH, $f(tw) =2^{\Theta(tw)}$ if $H$ is a contraction of the chair or the banner, and $f(tw)=2^{\Theta( tw \cdot \log tw)}$ otherwise. Prior to this work, such a complete characterization was only known when $H$ is a planar graph with at most five vertices. For the upper bounds, we present an algorithm in time $2^{\Theta( tw\cdot \log tw)} \cdot n^{O(1)}$ for the more general problem where all minor models of connected graphs in a finite family ${\mathcal F}$ need to be hit. We combine several ingredients such as the machinery of boundaried graphs in dynamic programming via representatives, the Flat Wall Theorem, Bidimensionality, the irrelevant vertex technique, treewidth modulators, and protrusion replacement. In particular, this algorithm vastly generalizes a result of Jansen et al. [SODA 2014] for the particular case ${\mathcal F}=\{K_5,K_{3,3}\}.$ For the lower bounds, our reductions are based on a generic construction building on the one given by the authors in [IPEC 2018], which uses the framework introduced by Lokshtanov et al. [SODA 2011] to obtain superexponential lower bounds.

Includes members:
  Member "composing dynamic programming tree decomposition based algorithms":
    also connected through other hyperedges:
      (none)
  Member "hitting topological minor models in planar graphs is fixed parameter tractable":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "hitting topological minors is fpt")
  Member "slightly superexponential parameterized problems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the complexity of finding large odd induced subgraphs and odd colorings")
  Member "optimal algorithms for hitting topological minors on graphs of bounded treewidth":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "decomposition of map graphs with applications")
  Member "deleting vertices to graphs of bounded genus":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "subexponential time algorithms for finding large induced sparse subgraphs")
  Member "generalized feedback vertex set problems on bounded treewidth graphs chordality is the key to single exponential parameterized algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a meta algorithm for solving connectivity and acyclicity constraints on locally checkable properties parameterized by graph width measures")
  Member "hitting minors on bounded treewidth graphs":
    also connected through other hyperedges:
      (none)
  Member "explicit linear kernels for packing problems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "lower bounds for protrusion replacement by counting equivalence classes")

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)