human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "linear kernels on graphs excluding topological minors"
  Abstract: We show that problems which have finite integer index and satisfy a requirement we call treewidth-bounding admit linear kernels on the class of $H$-topological-minor free graphs, for an arbitrary fixed graph $H$. This builds on earlier results by Fomin et al.\ on linear kernels for $H$-minor-free graphs and by Bodlaender et al.\ on graphs of bounded genus. Our framework encompasses several problems, the prominent ones being Chordal Vertex Deletion, Feedback Vertex Set and Edge Dominating Set.

Connected through hyperedge HE-1 (induced by source paper "tight kernel bounds for problems on graphs with small degeneracy"):
  with members:
    - "bidimensionality and kernels"
    - "kernelization lower bounds by cross composition"
    - "linear kernels and single exponential algorithms via protrusion decompositions"
    - "kernelization of packing problems"
    - "co nondeterminism in compositions a kernelization lower bound for a ramsey type problem"
    - "cross composition a new technique for kernelization lower bounds"
    - "polynomial time data reduction for dominating set"

Connected through hyperedge HE-2 (induced by source paper "everything you always wanted to know about the parameterized complexity of subgraph isomorphism but were afraid to ask"):
  with members:
    - "on feedback vertex set new measure and new structures"
    - "kernels for connected dominating set on graphs with excluded topological subgraphs"
    - "parameterized complexity of directed steiner tree on sparse graphs"
    - "structure theorem and isomorphism test for graphs with excluded topological subgraphs"
    - "finding topological subgraphs is fixed parameter tractable"
    - "deciding first order properties of locally tree decomposable structures"

Connected through hyperedge HE-3 (induced by source paper "planar f deletion approximation and optimal fpt algorithms"):
  with members:
    - "on feedback vertex set new measure and new structures"
    - "hitting and harvesting pumpkins"
    - "solving connectivity problems parameterized by treewidth in single exponential time"
    - "bidimensionality and geometric graphs"
    - "hitting forbidden minors approximation and kernelization"
    - "a quartic kernel for pathwidth one vertex deletion"
    - "bidimensionality and eptas"
    - "hitting diamonds and growing cacti"

Question: Please tell me which class the center node 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)