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 "distributed domination on graph classes of bounded expansion"):
  Abstract: We provide a new constant factor approximation algorithm for the (connected) distance-$r$ dominating set problem on graph classes of bounded expansion. Classes of bounded expansion include many familiar classes of sparse graphs such as planar graphs and graphs with excluded (topological) minors, and notably, these classes form the most general subgraph closed classes of graphs for which a sequential constant factor approximation algorithm for the distance-$r$ dominating set problem is currently known. Our algorithm can be implemented in the \congestbc model of distributed computing and uses $\mathcal{O}(r^2 \log n)$ communication rounds. #R##N#Our techniques, which may be of independent interest, are based on a distributed computation of sparse neighborhood covers of small radius on bounded expansion classes. We show how to compute an $r$-neighborhood cover of radius~$2r$ and overlap $f(r)$ on every class of bounded expansion in $\mathcal{O}(r^2 \log n)$ communication rounds for some function~$f$.% in the $\mathcal{CONGEST}_{\mathrm{BC}}$ model. #R##N#Finally, we show how to use the greater power of the $\mathcal{LOCAL}$ model to turn any distance-$r$ dominating set into a constantly larger connected distance-$r$ dominating set in $3r+1$ rounds on any class of bounded expansion. Combining this algorithm, e.g., with the constant factor approximation algorithm for dominating sets on planar graphs of Lenzen et al.\ gives a constant factor approximation algorithm for connected dominating sets on planar graphs in a constant number of rounds in the $\mathcal{LOCAL}$ model, where the approximation ratio is only $6$ times larger than that of Lenzen et al.'s algorithm.

Includes members:
  Member "the generalised colouring numbers on classes of bounded expansion":
    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 "on the complexity of local distributed graph problems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "distributed edge coloring in time quasi polylogarithmic in delta")
  Member "approximation algorithms for polynomial expansion and low density graphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "diameter computation on h minor free graphs and graphs of bounded distance vc dimension")
  Member "structural sparsity of complex networks bounded expansion in random models and real world graphs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a color avoiding approach to subgraph counting in bounded expansion classes")
  Member "cops robbers and threatening skeletons padded decomposition for minor free graphs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "scattering and sparse partitions and their applications")
  Member "deciding first order properties of nowhere dense graphs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "hitting topological minors is fpt")
  Member "analytical approach to parallel repetition":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "an improved algorithm for dynamic set cover")
  Member "local computation lower and upper bounds":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "distributed maximum matching verification in congest")

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.DC(Distributed, Parallel, and Cluster Computing)