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 "parameterized complexity of safe set"):
  Abstract: In this paper we study the problem of finding a small safe set $S$ in a graph $G$, i.e. a non-empty set of vertices such that no connected component of $G[S]$ is adjacent to a larger component in $G - S$. We enhance our understanding of the problem from the viewpoint of parameterized complexity by showing that (1) the problem is W[2]-hard when parameterized by the pathwidth $pw$ and cannot be solved in time $n^{o(pw)}$ unless the ETH is false, (2) it admits no polynomial kernel parameterized by the vertex cover number $vc$ unless $\mathrm{PH} = \Sigma^{\mathrm{p}}_{3}$, but (3) it is fixed-parameter tractable (FPT) when parameterized by the neighborhood diversity $nd$, and (4) it can be solved in time $n^{f(cw)}$ for some double exponential function $f$ where $cw$ is the clique-width. We also present (5) a faster FPT algorithm when parameterized by solution size.

Includes members:
  Member "linear kernels for separating a graph into components of bounded size":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "parameterized algorithms for generalizations of directed feedback vertex set")
  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-2 (induced by source paper "a complexity dichotomy for hitting connected minors on bounded treewidth graphs the chair and the banner draw the boundary")
  Member "solving integer linear programs with a small number of global variables and constraints":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "parameterized algorithms for milps with small treedepth")
  Member "partitioning a graph into small pieces with applications to path transversal":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "losing treewidth by separating subsets")
  Member "on the computational complexity of vertex integrity and component order connectivity":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "subgraph isomorphism on graph classes that exclude a substructure")

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.CC(Computational Complexity)