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 "domination above r independence does sparseness help"):
  Abstract: Inspired by the potential of improving tractability via gap- or above-guarantee parametrisations, we investigate the complexity of Dominating Set when given a suitable lower-bound witness. Concretely, we consider being provided with a maximal r-independent set X (a set in which all vertices have pairwise distance at least r + 1) along the input graph G which, for r >= 2, lower-bounds the minimum size of any dominating set of G. In the spirit of gap-parameters, we consider a parametrisation by the size of the 'residual' set R := V (G) \ N [X]. Our work aims to answer two questions: How does the constant r affect the tractability of the problem and does the restriction to sparse graph classes help here? For the base case r = 2, we find that the problem is paraNP -complete even in apex- and bounded-degree graphs. For r = 3, the problem is W[2]-hard for general graphs but in FPT for nowhere dense classes and it admits a linear kernel for bounded expansion classes. For r >= 4, the parametrisation becomes essentially equivalent to the natural parameter, the size of the dominating set.

Includes members:
  Member "neighborhood complexity and kernelization for nowhere dense classes of graphs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the parameterized complexity of reconfiguration of connected dominating sets")
  Member "kernelization and sparseness the case of dominating set":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "parameterized circuit complexity of model checking first order logic on sparse structures")
  Member "faster parameterized algorithms using linear programming":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "structural parameterizations with modulator oblivion")
  Member "testing first order properties for subclasses of sparse graphs":
    also connected through other hyperedges:
      (none)
  Member "all ternary permutation constraint satisfaction problems parameterized above average have kernels with quadratic numbers of variables":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "satisfiability of ordering csps above average")
  Member "vertex cover problem parameterized above and below tight bounds":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "going far from degeneracy")
  Member "solving max r sat above a tight lower bound":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "going far from degeneracy")
  Member "linear time algorithms for finding a dominating set of fixed size in degenerated graphs":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "parallel algorithms for small subgraph counting")

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.DS(Data Structures and Algorithms)