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 "algorithmic properties of sparse digraphs"):
  Abstract: The notions of bounded expansion and nowhere denseness have been applied very successfully in algorithmic graph theory. We study the corresponding notions of directed bounded expansion and nowhere crownfulness on directed graphs. We show that many of the algorithmic tools that were developed for undirected bounded expansion classes can, with some care, also be applied in their directed counterparts, and thereby we highlight a rich algorithmic structure theory of directed bounded expansion classes. #R##N#More specifically, we show that the directed Steiner tree problem is fixed-parameter tractable on any class of directed bounded expansion parameterized by the number $k$ of non-terminals plus the maximal diameter $s$ of a strongly connected component in the subgraph induced by the terminals. Our result strongly generalizes a result of Jones et al., who proved that the problem is fixed parameter tractable on digraphs of bounded degeneracy if the set of terminals is required to be acyclic. #R##N#We furthermore prove that for every integer $r\geq 1$, the distance-$r$ dominating set problem can be approximated up to a factor $O(\log k)$ and the connected distance-$r$ dominating set problem can be approximated up to a factor $O(k\cdot \log k)$ on any class of directed bounded expansion, where $k$ denotes the size of an optimal solution. If furthermore, the class is nowhere crownful, we are able to compute a polynomial kernel for distance-$r$ dominating sets. Polynomial kernels for this problem were not known to exist on any other existing digraph measure for sparse classes.

Includes members:
  Member "characterising bounded expansion by neighbourhood complexity":
    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 "polynomial kernels and wideness properties of nowhere dense graph classes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a general kernelization technique for domination and independence problems in sparse classes")
  Member "bidimensionality and kernels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "hitting topological minors is fpt")
  Member "neighborhood complexity and kernelization for nowhere dense classes of graphs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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-5 (induced by source paper "domination above r independence does sparseness help")
  Member "kernelization using structural parameters on sparse graph classes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the parameterized complexity of reconfiguration of connected dominating sets")
  Member "parameterized complexity of directed steiner tree on sparse graphs":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "tight bounds for planar strongly connected steiner subgraph with fixed number of terminals and extensions")

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.DM(Discrete Mathematics)