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 "reducing topological minor containment to the unique linkage theorem"):
  Abstract: In the Topological Minor Containment problem (TMC) problem two undirected graphs, $G$ and $H$ are given and the objective is to check whether $G$ contains $H$ as a topological minor. Grohe, Kawarabayashi, Marx, and Wollan~[STOC 2011] resolved the parameterized complexity of this problem by designing an algorithm with running time $f(k)n^{3}$. Here, $k=|V(H)|$ and $n=|V(G)|$. Among several other tools, this algorithm was based on a variant of the linkage theorem of Robertson-Seymour, tailor-made for TMC, by adapting elements of the new proof of the unique linkage theorem of Kawarabayashi and Wollan~[STOC 2010]. In this paper we turn the wheel back, and design an alternate algorithm for TMC by giving a direct reduction to a version of unique linkage theorem appearing in Graph Minors XXII of Robertson and Seymour. That is, the new proof requires a black-box invocation of a known result arising in the proof of graph minor theorem. Our result has the following advantages: #R##N#(1) Graph classes where the bounds in the unique linkage theorem are known, this immediately results in explicit time-bounds for TMC on those graph classes. For example, we get first algorithm with explicit time bounds for TMC on planar graphs and more generally for graphs of genus $g$. In particular, the algorithm runs in time $2^{2^{2^{{\cal O}(k)}}}$ on planar graphs. #R##N#(2) Any new development on the unique linkage theorem will immediately led to a faster algorithm for TMC. That is, one does not need to design a similar theorem specifically for TMC.

Includes members:
  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 "improved analysis of highest degree branching for feedback vertex set":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "hitting topological minors is fpt")
  Member "losing treewidth by separating subsets":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "hitting topological minors is fpt")
  Member "a 2 approximation algorithm for feedback vertex set in tournaments":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "hitting topological minors is fpt")
  Member "polylogarithmic approximation for minimum planarization almost":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "hitting topological minors is fpt")
  Member "exact algorithms for maximum independent set":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "hitting topological minors is fpt")
  Member "linear kernels for edge deletion problems to immersion closed graph classes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "losing treewidth by separating subsets")
  Member "bidimensionality and kernels":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "hitting topological minors is fpt")

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)