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: "distributed approximation algorithms for weighted shortest paths"
  Abstract: A distributed network is modeled by a graph having $n$ nodes (processors) and diameter $D$. We study the time complexity of approximating {\em weighted} (undirected) shortest paths on distributed networks with a $O(\log n)$ {\em bandwidth restriction} on edges (the standard synchronous \congest model). The question whether approximation algorithms help speed up the shortest paths (more precisely distance computation) was raised since at least 2004 by Elkin (SIGACT News 2004). The unweighted case of this problem is well-understood while its weighted counterpart is fundamental problem in the area of distributed approximation algorithms and remains widely open. We present new algorithms for computing both single-source shortest paths (\sssp) and all-pairs shortest paths (\apsp) in the weighted case. #R##N#Our main result is an algorithm for \sssp. Previous results are the classic $O(n)$-time Bellman-Ford algorithm and an $\tilde O(n^{1/2+1/2k}+D)$-time $(8k\lceil \log (k+1) \rceil -1)$-approximation algorithm, for any integer $k\geq 1$, which follows from the result of Lenzen and Patt-Shamir (STOC 2013). (Note that Lenzen and Patt-Shamir in fact solve a harder problem, and we use $\tilde O(\cdot)$ to hide the $O(\poly\log n)$ term.) We present an $\tilde O(n^{1/2}D^{1/4}+D)$-time $(1+o(1))$-approximation algorithm for \sssp. This algorithm is {\em sublinear-time} as long as $D$ is sublinear, thus yielding a sublinear-time algorithm with almost optimal solution. When $D$ is small, our running time matches the lower bound of $\tilde \Omega(n^{1/2}+D)$ by Das Sarma et al. (SICOMP 2012), which holds even when $D=\Theta(\log n)$, up to a $\poly\log n$ factor.

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"
    - "a faster distributed single source shortest paths algorithm"
    - "distributed exact shortest paths in sublinear time"

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 "dynamic approximate shortest paths and beyond subquadratic and worst case update time"):
  with members:
    - "fully dynamic all pairs shortest paths improved worst case time and space bounds"
    - "dynamic matrix inverse improved algorithms and matching conditional lower bounds"
    - "sensitive distance and reachability oracles for large batch updates"
    - "towards tight approximation bounds for graph diameter and eccentricities"
    - "algorithms and hardness for diameter in dynamic graphs"
    - "diameter spanner eccentricity spanner and approximating extremal graph distances static dynamic and fault tolerant"
    - "a deamortization approach for dynamic spanner and dynamic maximal matching"
    - "deterministic partially dynamic single source shortest paths in weighted graphs"

Connected through hyperedge HE-4 (induced by source paper "smaller cuts higher lower bounds"):
  with members:
    - "a faster deterministic distributed algorithm for weighted apsp through pipelining"
    - "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"
    - "optimal distributed coloring algorithms for planar graphs in the local model"
    - "distributed exact shortest paths in sublinear time"
    - "a time hierarchy theorem for the local model"
    - "a 2 ϵ approximation for maximum weight matching in the semi streaming model"
    - "quadratic and near quadratic lower bounds for the congest model"

Connected through hyperedge HE-5 (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"
    - "a faster distributed single source shortest paths algorithm"
    - "distributed exact shortest paths in sublinear time"
    - "improved distributed algorithms for exact shortest paths"
    - "competitive routing in hybrid communication networks"

Connected through hyperedge HE-6 (induced by source paper "new alpha beta spanners and hopsets"):
  with members:
    - "almost shortest paths and pram distance oracles in weighted graphs"
    - "linear size hopsets with small hopbound and distributed routing with low memory"
    - "thorup zwick emulators are universally optimal hopsets"
    - "distributed exact shortest paths in sublinear time"
    - "efficient algorithms for constructing very sparse spanners and emulators"
    - "a hierarchy of lower bounds for sublinear additive spanners"
    - "hopsets with constant hopbound and applications to approximate shortest paths"
    - "on efficient distributed construction of near optimal routing schemes"

Connected through hyperedge HE-7 (induced by source paper "almost shortest paths and pram distance oracles in weighted graphs"):
  with members:
    - "thorup zwick emulators are universally optimal hopsets"
    - "efficient algorithms for constructing very sparse spanners and emulators"
    - "a hierarchy of lower bounds for sublinear additive spanners"
    - "hopsets with constant hopbound and applications to approximate shortest paths"
    - "a linear size logarithmic stretch path reporting distance oracle for general graphs"
    - "parallel metric tree embedding based on an algebraic view on moore bellman ford"
    - "the 4 3 additive spanner exponent is tight"
    - "a deterministic almost tight distributed algorithm for approximating single source shortest paths"

Connected through hyperedge HE-8 (induced by source paper "sparse hopsets in congested clique"):
  with members:
    - "fast approximate shortest paths in the congested clique"
    - "brief announcement semi mapreduce meets congested clique"
    - "massively parallel approximate distance sketches"
    - "thorup zwick emulators are universally optimal hopsets"
    - "a hierarchy of lower bounds for sublinear additive spanners"
    - "hopsets with constant hopbound and applications to approximate shortest paths"
    - "lessons from the congested clique applied to mapreduce"
    - "parallel graph decompositions using random shifts"

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.DS(Data Structures and Algorithms)