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: "on the computational complexity of vertex integrity and component order connectivity"
  Abstract: The Weighted Vertex Integrity (wVI) problem takes as input an $n$-vertex graph $G$, a weight function $w:V(G)\to\mathbb{N}$, and an integer $p$. The task is to decide if there exists a set $X\subseteq V(G)$ such that the weight of $X$ plus the weight of a heaviest component of $G-X$ is at most $p$. Among other results, we prove that: #R##N#(1) wVI is NP-complete on co-comparability graphs, even if each vertex has weight $1$; #R##N#(2) wVI can be solved in $O(p^{p+1}n)$ time; #R##N#(3) wVI admits a kernel with at most $p^3$ vertices. #R##N#Result (1) refutes a conjecture by Ray and Deogun and answers an open question by Ray et al. It also complements a result by Kratsch et al., stating that the unweighted version of the problem can be solved in polynomial time on co-comparability graphs of bounded dimension, provided that an intersection model of the input graph is given as part of the input. #R##N#An instance of the Weighted Component Order Connectivity (wCOC) problem consists of an $n$-vertex graph $G$, a weight function $w:V(G)\to \mathbb{N}$, and two integers $k$ and $l$, and the task is to decide if there exists a set $X\subseteq V(G)$ such that the weight of $X$ is at most $k$ and the weight of a heaviest component of $G-X$ is at most $l$. In some sense, the wCOC problem can be seen as a refined version of the wVI problem. We prove, among other results, that: #R##N#(4) wCOC can be solved in $O(\min\{k,l\}\cdot n^3)$ time on interval graphs, while the unweighted version can be solved in $O(n^2)$ time on this graph class; #R##N#(5) wCOC is W[1]-hard on split graphs when parameterized by $k$ or by $l$; #R##N#(6) wCOC can be solved in $2^{O(k\log l)} n$ time; #R##N#(7) wCOC admits a kernel with at most $kl(k+l)+k$ vertices. #R##N#We also show that result (6) is essentially tight by proving that wCOC cannot be solved in $2^{o(k \log l)}n^{O(1)}$ time, unless the ETH fails.

Connected through hyperedge HE-1 (induced by source paper "subgraph isomorphism on graph classes that exclude a substructure"):
  with members:
    - "tight lower bounds on graph embedding problems"
    - "characterizing the easy to find subgraphs from the viewpoint of polynomial time algorithms kernels and turing kernels"
    - "everything you always wanted to know about the parameterized complexity of subgraph isomorphism but were afraid to ask"
    - "surface split decompositions and subgraph isomorphism in graphs on surfaces"
    - "planar subgraph isomorphism revisited"
    - "subgraph isomorphism in planar graphs and related problems"

Connected through hyperedge HE-2 (induced by source paper "parameterized complexity of safe set"):
  with members:
    - "linear kernels for separating a graph into components of bounded size"
    - "generalized feedback vertex set problems on bounded treewidth graphs chordality is the key to single exponential parameterized algorithms"
    - "solving integer linear programs with a small number of global variables and constraints"
    - "partitioning a graph into small pieces with applications to path transversal"

Connected through hyperedge HE-3 (induced by source paper "losing treewidth by separating subsets"):
  with members:
    - "linear kernels for edge deletion problems to immersion closed graph classes"
    - "parameterized vertex deletion problems for hereditary graph classes with a block property"
    - "approximation and kernelization for chordal vertex deletion"
    - "a single exponential fixed parameter algorithm for distance hereditary vertex deletion"
    - "lp based robust algorithms for noisy minor free and bounded treewidth graphs"
    - "partitioning a graph into small pieces with applications to path transversal"
    - "polynomial bounds for the grid minor theorem"
    - "fixed parameter tractability of multicut parameterized by the size of the cutset"

Connected through hyperedge HE-4 (induced by source paper "slightly superexponential parameterized problems"):
  with members:
    - "parameterized vertex deletion problems for hereditary graph classes with a block property"
    - "linear recognition of almost interval graphs"
    - "solving connectivity problems parameterized by treewidth in single exponential time"
    - "problems parameterized by treewidth tractable in single exponential time a logical approach"
    - "bandwidth and distortion revisited"
    - "planar subgraph isomorphism revisited"
    - "randomized algorithms for the loop cutset problem"
    - "on the closest string and substring problems"

Connected through hyperedge HE-5 (induced by source paper "linear kernels for separating a graph into components of bounded size"):
  with members:
    - "on a generalization of nemhauser and trotter s local optimization theorem"
    - "deleting edges to restrict the size of an epidemic a new application for treewidth"
    - "minimum bisection is fixed parameter tractable"
    - "minimum k way cut of bounded size is fixed parameter tractable"
    - "finding small separators in linear time via treewidth reduction"
    - "hitting forbidden minors approximation and kernelization"
    - "multicut is fpt"
    - "fixed parameter tractability of multicut parameterized by the size of the cutset"

Connected through hyperedge HE-6 (induced by source paper "solving integer linear programs with a small number of global variables and constraints"):
  with members:
    - "a parameterized strongly polynomial algorithm for block structured integer programs"
    - "scheduling meets n fold integer programming"
    - "the complexity landscape of decompositional parameters for ilp"
    - "backdoors into heterogeneous classes of sat and csp"
    - "voting and bribing in single exponential time"
    - "a structural approach to kernels for ilps treewidth and total unimodularity"
    - "backdoors to satisfaction"

Connected through hyperedge HE-7 (induced by source paper "generalized feedback vertex set problems on bounded treewidth graphs chordality is the key to single exponential parameterized algorithms"):
  with members:
    - "slightly superexponential parameterized problems"
    - "optimal algorithms for hitting topological minors on graphs of bounded treewidth"
    - "parameterized vertex deletion problems for hereditary graph classes with a block property"
    - "deleting edges to restrict the size of an epidemic a new application for treewidth"
    - "solving connectivity problems parameterized by treewidth in single exponential time"
    - "known algorithms on graphs of bounded treewidth are probably optimal"

Connected through hyperedge HE-8 (induced by source paper "parameterized vertex deletion problems for hereditary graph classes with a block property"):
  with members:
    - "a faster fpt algorithm and a smaller kernel for block graph vertex deletion"
    - "a polynomial kernel for block graph deletion"
    - "hitting and harvesting pumpkins"
    - "half integrality lp branching and fpt algorithms"
    - "faster deterministic feedback vertex set"
    - "planar f deletion approximation and optimal fpt algorithms"
    - "linear kernels and single exponential algorithms via protrusion decompositions"

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)