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 "a general kernelization technique for domination and independence problems in sparse classes"):
  Abstract: We unify and extend previous kernelization techniques in sparse classes [5, 16] by defining a structure we call water lilies and show how it can be used in bounded expansion classes to construct linear bikernels for $(r, c)$-DOMINATING SET, $(r, c)$-SCATTERED SET, TOTAL $r$-DOMINATION, r-Roman Domination, and a problem we call $(r, [{\lambda}, {\mu}])$-DOMINATION (implying a bikernel for r-PERFECT CODE). At the cost of slightly changing the output graph class these bikernels can be turned into into kernels. Finally, we demonstrate how these constructions can be combined to create 'multikernels', meaning graphs who represent kernels for multiple problems at once. Concretely, we show that $r$-DOMINATING SET, TOTAL $r$-DOMINATION, and $r$-ROMAN DOMINATION admit a multikernel; as well as $r$-DOMINATING SET and $2r$-INDEPENDENT SET for multiple values of $r$ at once.

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 "nowhere dense graph classes and algorithmic applications a tutorial at highlights of logic games and automata 2019")
  Member "the generalised colouring numbers on classes of bounded expansion":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "nowhere dense graph classes and algorithmic applications a tutorial at highlights of logic games and automata 2019")
  Member "characterising bounded expansion by neighbourhood complexity":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "empirical evaluation of approximation algorithms for generalized graph coloring and uniform quasi wideness")
  Member "polynomial kernels and wideness properties of nowhere dense graph classes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "nowhere dense graph classes and algorithmic applications a tutorial at highlights of logic games and automata 2019")
  Member "bidimensionality and kernels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "hitting topological minors is fpt")
  Member "kernels for connected dominating set on graphs with excluded topological subgraphs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "lossy kernels for connected dominating set on sparse graphs")
  Member "polynomial time data reduction for dominating set":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "domination above r independence does sparseness help")

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)