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 "improved in approximability bounds for d scattered set"):
  Abstract: In the $d$-Scattered Set problem we are asked to select at least $k$ vertices of a given graph, so that the distance between any pair is at least $d$. We study the problem's (in-)approximability and offer improvements and extensions of known results for Independent Set, of which the problem is a generalization. #R##N#Specifically, we show: #R##N#- A lower bound of $\Delta^{\lfloor d/2\rfloor-\epsilon}$ on the approximation ratio of any polynomial-time algorithm for graphs of maximum degree $\Delta$ and an improved upper bound of $O(\Delta^{\lfloor d/2\rfloor})$ on the approximation ratio of any greedy scheme for this problem. #R##N#- A polynomial-time $2\sqrt{n}$-approximation for bipartite graphs and even values of $d$, that matches the known lower bound by considering the only remaining case. #R##N#- A lower bound on the complexity of any $\rho$-approximation algorithm of (roughly) $2^{\frac{n^{1-\epsilon}}{\rho d}}$ for even $d$ and $2^{\frac{n^{1-\epsilon}}{\rho(d+\rho)}}$ for odd $d$ (under the randomized ETH), complemented by $\rho$-approximation algorithms of running times that (almost) match these bounds.

Includes members:
  Member "kernelization and approximation of distance r independent sets on nowhere dense graphs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a general kernelization technique for domination and independence problems in sparse classes")
  Member "structurally parameterized d scattered set":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "new algorithms for mixed dominating set")
  Member "on distance d independent set and other problems in graphs with few minimal separators":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "potential maximal cliques parameterized by edge clique cover")
  Member "time approximation trade offs for inapproximable problems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "from gap eth to fpt inapproximability clique dominating set and more")
  Member "optimal parameterized algorithms for planar facility location problems using voronoi diagrams":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "grundy coloring friends half graphs bicliques")
  Member "independent set induced matching and pricing connections and tight subexponential time approximation hardnesses":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "revenue maximization for query pricing")
  Member "bidimensionality and eptas":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "baker game and polynomial time approximation schemes")
  Member "exponential time approximation of hard problems":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "on subexponential running times for approximating directed steiner tree and related problems")

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)