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 faster distributed single source shortest paths algorithm"):
  Abstract: We devise new algorithms for the single-source shortest paths (SSSP) problem with non-negative edge weights in the CONGEST model of distributed computing. While close-to-optimal solutions, in terms of the number of rounds spent by the algorithm, have recently been developed for computing SSSP approximately, the fastest known exact algorithms are still far away from matching the lower bound of $ \tilde \Omega (\sqrt{n} + D) $ rounds by Peleg and Rubinovich [SIAM Journal on Computing 2000], where $ n $ is the number of nodes in the network and $ D $ is its diameter. The state of the art is Elkin's randomized algorithm [STOC 2017] that performs $ \tilde O(n^{2/3} D^{1/3} + n^{5/6}) $ rounds. We significantly improve upon this upper bound with our two new randomized algorithms for polynomially bounded integer edge weights, the first performing $ \tilde O (\sqrt{n D}) $ rounds and the second performing $ \tilde O (\sqrt{n} D^{1/4} + n^{3/5} + D) $ rounds. Our bounds also compare favorably to the independent result by Ghaffari and Li [STOC 2018]. As side results, we obtain a $ (1 + \epsilon) $-approximation $ \tilde O ((\sqrt{n} D^{1/4} + D) / \epsilon) $-round algorithm for directed SSSP and a new work/depth trade-off for exact SSSP on directed graphs in the PRAM model.

Includes members:
  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-1 (induced by source paper "fast approximate shortest paths in the congested clique")
  Member "faster distributed shortest path approximations via shortcuts":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "dynamic low stretch trees via dynamic low diameter decompositions")
  Member "distributed exact shortest paths in sublinear time":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "distributed edge connectivity in sublinear time")
  Member "improved distributed algorithms for exact shortest paths":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "distributed edge connectivity in sublinear time")
  Member "a simple deterministic distributed mst algorithm with near optimal time and message complexities":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "improved algorithm for min cuts in distributed networks")
  Member "distributed approximation of maximum independent set and maximum matching":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "distributed maximum matching verification in congest")
  Member "parallel shortest paths using radius stepping":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "parallel approximate undirected shortest paths via low hop emulators")
  Member "near optimal approximate shortest paths and transshipment in distributed and streaming models":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "polynomial pass lower bounds for graph streaming algorithms")

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)