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 "fast approximate shortest paths in the congested clique"):
  Abstract: We design fast deterministic algorithms for distance computation in the congested clique model. Our key contributions include: #R##N#-- A $(2+\epsilon)$-approximation for all-pairs shortest paths in $O(\log^2{n} / \epsilon)$ rounds on unweighted undirected graphs. With a small additional additive factor, this also applies for weighted graphs. This is the first sub-polynomial constant-factor approximation for APSP in this model. #R##N#-- A $(1+\epsilon)$-approximation for multi-source shortest paths from $O(\sqrt{n})$ sources in $O(\log^2{n} / \epsilon)$ rounds on weighted undirected graphs. This is the first sub-polynomial algorithm obtaining this approximation for a set of sources of polynomial size. #R##N#Our main techniques are new distance tools that are obtained via improved algorithms for sparse matrix multiplication, which we leverage to construct efficient hopsets and shortest paths. Furthermore, our techniques extend to additional distance problems for which we improve upon the state-of-the-art, including diameter approximation, and an exact single-source shortest paths algorithm for weighted undirected graphs in $\tilde{O}(n^{1/6})$ rounds.

Includes members:
  Member "delta 1 coloring in the congested clique model":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "efficient deterministic distributed coloring with small bandwidth")
  Member "congested clique algorithms for graph spanners":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "massively parallel algorithms for distance approximation and spanners")
  Member "sparse matrix multiplication and triangle listing in the congested clique model":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "exponentially faster shortest paths in the congested clique")
  Member "towards tight approximation bounds for graph diameter and eccentricities":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "graph spanners a tutorial review")
  Member "a deterministic distributed algorithm for exact weighted all pairs shortest paths in tilde o n 3 2 rounds":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "smaller cuts higher lower bounds")
  Member "distributed triangle detection via expander decomposition":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "distributed testing of graph isomorphism in the congest model")
  Member "distributed exact weighted all pairs shortest paths in near linear time":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "simple and fast distributed computation of betweenness centrality")
  Member "mst in o 1 rounds of the congested clique":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "how fast can you update your mst dynamic algorithms for cluster computing")

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)