human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "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.

Connected through hyperedge HE-1 (induced by source paper "distributed edge connectivity in sublinear time"):
  with members:
    - "improved distributed expander decomposition and nearly optimal triangle enumeration"
    - "small cuts and connectivity certificates a fault tolerant approach"
    - "distributed triangle detection via expander decomposition"
    - "graph sparsification spectral sketches and faster resistance computation via short cycle decompositions"
    - "distributed exact weighted all pairs shortest paths in near linear time"
    - "expander decomposition and pruning faster stronger and simpler"
    - "distributed exact shortest paths in sublinear time"
    - "distributed exact weighted all pairs shortest paths in tilde o n 5 4 rounds"

Connected through hyperedge HE-2 (induced by source paper "fast approximate shortest paths in the congested clique"):
  with members:
    - "delta 1 coloring in the congested clique model"
    - "congested clique algorithms for graph spanners"
    - "sparse matrix multiplication and triangle listing in the congested clique model"
    - "towards tight approximation bounds for graph diameter and eccentricities"
    - "a deterministic distributed algorithm for exact weighted all pairs shortest paths in tilde o n 3 2 rounds"
    - "distributed triangle detection via expander decomposition"
    - "distributed exact weighted all pairs shortest paths in near linear time"
    - "mst in o 1 rounds of the congested clique"

Connected through hyperedge HE-3 (induced by source paper "shortest paths in a hybrid network model"):
  with members:
    - "fast approximate shortest paths in the congested clique"
    - "a deterministic distributed algorithm for exact weighted all pairs shortest paths in tilde o n 3 2 rounds"
    - "distributed exact weighted all pairs shortest paths in near linear time"
    - "mst in o 1 rounds of the congested clique"
    - "distributed exact shortest paths in sublinear time"
    - "improved distributed algorithms for exact shortest paths"
    - "competitive routing in hybrid communication networks"
    - "near linear lower bounds for distributed distance computations even in sparse networks"

Connected through hyperedge HE-4 (induced by source paper "planar diameter via metric compression"):
  with members:
    - "exact distance oracles for planar graphs with failing vertices"
    - "minor excluded network families admit fast distributed algorithms"
    - "distributed treewidth computation"
    - "faster distributed shortest path approximations via shortcuts"
    - "constant query time 1 epsilon approximate distance oracle for planar graphs"
    - "fast and compact exact distance oracle for planar graphs"
    - "voronoi diagrams on planar graphs and computing the diameter in deterministic tilde o n 5 3 time"
    - "better tradeoffs for exact distance oracles in planar graphs"

Connected through hyperedge HE-5 (induced by source paper "low diameter graph decompositions by approximate distance computation"):
  with members:
    - "dynamic low stretch trees via dynamic low diameter decompositions"
    - "a hierarchy of lower bounds for sublinear additive spanners"
    - "hopsets with constant hopbound and applications to approximate shortest paths"
    - "on the complexity of local distributed graph problems"
    - "parallel metric tree embedding based on an algebraic view on moore bellman ford"
    - "near optimal distributed maximum flow"
    - "simple parallel and distributed algorithms for spectral graph sparsification"
    - "parallel graph decompositions using random shifts"

Connected through hyperedge HE-6 (induced by source paper "parallel reachability in almost linear work and square root depth"):
  with members:
    - "improved distributed algorithms for exact shortest paths"
    - "popular conjectures imply strong lower bounds for dynamic problems"
    - "distributed approximation algorithms for weighted shortest paths"
    - "distributed verification and hardness of distributed approximation"

Connected through hyperedge HE-7 (induced by source paper "distributed exact weighted all pairs shortest paths in near linear time"):
  with members:
    - "distributed edge connectivity in sublinear time"
    - "a deterministic distributed algorithm for exact weighted all pairs shortest paths in tilde o n 3 2 rounds"
    - "new and simplified distributed algorithms for weighted all pairs shortest paths"
    - "a deterministic distributed algorithm for weighted all pairs shortest paths through pipelining"
    - "distributed exact shortest paths in sublinear time"
    - "distributed exact weighted all pairs shortest paths in tilde o n 5 4 rounds"
    - "improved distributed algorithms for exact shortest paths"
    - "a simple deterministic distributed mst algorithm with near optimal time and message complexities"

Connected through hyperedge HE-8 (induced by source paper "distributed triangle detection via expander decomposition"):
  with members:
    - "a deterministic distributed algorithm for exact weighted all pairs shortest paths in tilde o n 3 2 rounds"
    - "detecting cliques in congest networks"
    - "mst in o 1 rounds of the congested clique"
    - "fooling views a new lower bound technique for distributed computations under congestion"
    - "distributed exact shortest paths in sublinear time"
    - "a simple deterministic distributed mst algorithm with near optimal time and message complexities"
    - "deterministic subgraph detection in broadcast congest"
    - "on the distributed complexity of large scale graph computations"

Question: Please tell me which class the center node 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)