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 "subexponential time algorithms for finding large induced sparse subgraphs"):
  Abstract: Let $\mathcal{C}$ and $\mathcal{D}$ be hereditary graph classes. Consider the following problem: given a graph $G\in\mathcal{D}$, find a largest, in terms of the number of vertices, induced subgraph of $G$ that belongs to $\mathcal{C}$. We prove that it can be solved in $2^{o(n)}$ time, where $n$ is the number of vertices of $G$, if the following conditions are satisfied: #R##N#* the graphs in $\mathcal{C}$ are sparse, i.e., they have linearly many edges in terms of the number of vertices; #R##N#* the graphs in $\mathcal{D}$ admit balanced separators of size governed by their density, e.g., $\mathcal{O}(\Delta)$ or $\mathcal{O}(\sqrt{m})$, where $\Delta$ and $m$ denote the maximum degree and the number of edges, respectively; and #R##N#* the considered problem admits a single-exponential fixed-parameter algorithm when parameterized by the treewidth of the input graph. #R##N#This leads, for example, to the following corollaries for specific classes $\mathcal{C}$ and $\mathcal{D}$: #R##N#* a largest induced forest in a $P_t$-free graph can be found in $2^{\tilde{\mathcal{O}}(n^{2/3})}$ time, for every fixed $t$; and #R##N#* a largest induced planar graph in a string graph can be found in $2^{\tilde{\mathcal{O}}(n^{3/4})}$ time.

Includes members:
  Member "deleting vertices to graphs of bounded genus":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a complexity dichotomy for hitting connected minors on bounded treewidth graphs the chair and the banner draw the boundary")
  Member "polynomial time algorithm for maximum weight independent set on p_6 free graphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "induced subgraphs of bounded treewidth and the container method")
  Member "exact algorithms via monotone local search":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "hitting topological minors is fpt")
  Member "tight running time lower bounds for vertex deletion problems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "destroying bicolored p_3 s by deleting few edges")
  Member "hitting forbidden subgraphs in graphs of bounded treewidth":
    also connected through other hyperedges:
      (none)
  Member "large induced subgraphs via triangulations and cmso":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "hitting topological minors is fpt")
  Member "largest chordal and interval subgraphs faster than 2 n":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "hitting topological minors is fpt")
  Member "finding a maximum induced degenerate subgraph faster than 2 n":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "solving target set selection with bounded thresholds faster than 2 n")

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)