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 "linear kernels for outbranching problems in sparse digraphs"):
  Abstract: In the $k$-Leaf Out-Branching and $k$-Internal Out-Branching problems we are given a directed graph $D$ with a designated root $r$ and a nonnegative integer $k$. The question is to determine the existence of an outbranching rooted at $r$ that has at least $k$ leaves, or at least $k$ internal vertices, respectively. Both these problems were intensively studied from the points of view of parameterized complexity and kernelization, and in particular for both of them kernels with $O(k^2)$ vertices are known on general graphs. In this work we show that $k$-Leaf Out-Branching admits a kernel with $O(k)$ vertices on $\mathcal{H}$-minor-free graphs, for any fixed family of graphs $\mathcal{H}$, whereas $k$-Internal Out-Branching admits a kernel with $O(k)$ vertices on any graph class of bounded expansion.

Includes members:
  Member "bidimensionality and kernels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "hitting topological minors is fpt")
  Member "kernelization and sparseness the case of dominating set":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "domination above r independence does sparseness help")
  Member "kernelization using structural parameters on sparse graph classes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the parameterized complexity of reconfiguration of connected dominating sets")
  Member "network sparsification for steiner problems on planar and bounded genus graphs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a relaxation of the directed disjoint paths problem a global congestion metric helps")
  Member "solving connectivity problems parameterized by treewidth in single exponential time":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "hamiltonian cycle parameterized by treedepth in single exponential time and polynomial space")
  Member "problems parameterized by treewidth tractable in single exponential time a logical approach":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "subexponential parameterized algorithms and kernelization on almost chordal graphs")
  Member "beyond bidimensionality parameterized subexponential algorithms on directed graphs":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "detecting and counting small patterns in planar graphs in subexponential parameterized time")
  Member "on finding directed trees with many leaves":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "privacy risks of explaining machine learning models")

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)