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 exact weighted all pairs shortest paths in near linear time"
  Abstract: In the {\em distributed all-pairs shortest paths} problem (APSP), every node in the weighted undirected distributed network (the CONGEST model) needs to know the distance from every other node using least number of communication rounds (typically called {\em time complexity}). The problem admits $(1+o(1))$-approximation $\tilde\Theta(n)$-time algorithm and a nearly-tight $\tilde \Omega(n)$ lower bound [Nanongkai, STOC'14; Lenzen and Patt-Shamir PODC'15]\footnote{$\tilde \Theta$, $\tilde O$ and $\tilde \Omega$ hide polylogarithmic factors. Note that the lower bounds also hold even in the unweighted case and in the weighted case with polynomial approximation ratios~\cite{LenzenP_podc13,HolzerW12,PelegRT12,Nanongkai-STOC14}.}. For the exact case, Elkin [STOC'17] presented an $O(n^{5/3} \log^{2/3} n)$ time bound, which was later improved to $\tilde O(n^{5/4})$ [Huang, Nanongkai, Saranurak FOCS'17]. It was shown that any super-linear lower bound (in $n$) requires a new technique [Censor-Hillel, Khoury, Paz, DISC'17], but otherwise it remained widely open whether there exists a $\tilde O(n)$-time algorithm for the exact case, which would match the best possible approximation algorithm. #R##N#This paper resolves this question positively: we present a randomized (Las Vegas) $\tilde O(n)$-time algorithm, matching the lower bound up to polylogarithmic factors. Like the previous $\tilde O(n^{5/4})$ bound, our result works for directed graphs with zero (and even negative) edge weights. In addition to the improved running time, our algorithm works in a more general setting than that required by the previous $\tilde O(n^{5/4})$ bound; in our setting (i) the communication is only along edge directions (as opposed to bidirectional), and (ii) edge weights are arbitrary (as opposed to integers in {1, 2, ... poly(n)}). ...

Connected through hyperedge HE-1 (induced by source paper "simple and fast distributed computation of betweenness centrality"):
  with members:
    - "distributed estimation and control of node centrality in undirected asymmetric networks"
    - "distributed algorithms for directed betweenness centrality and all pairs shortest paths"
    - "distributed algorithms for computation of centrality measures in complex networks"
    - "quadratic and near quadratic lower bounds for the congest model"
    - "abra approximating betweenness centrality in static and dynamic graphs with rademacher averages"
    - "fully dynamic approximation of betweenness centrality"
    - "scalable online betweenness centrality in evolving graphs"
    - "approximating betweenness centrality in large evolving networks"

Connected through hyperedge HE-2 (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"
    - "expander decomposition and pruning faster stronger and simpler"
    - "a faster distributed single source shortest paths algorithm"
    - "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-3 (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"
    - "mst in o 1 rounds of the congested clique"
    - "linear size hopsets with small hopbound and distributed routing with low memory"

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"
    - "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"
    - "distributed approximation of maximum independent set and maximum matching"

Connected through hyperedge HE-5 (induced by source paper "hardness of distributed optimization"):
  with members:
    - "small cuts and connectivity certificates a fault tolerant approach"
    - "fast and efficient distributed computation of hamiltonian cycles in random graphs"
    - "a distributed algorithm for finding hamiltonian cycles in random graphs in o log n time"
    - "new distributed algorithms in almost mixing time via transformations from parallel algorithms"
    - "parameterized distributed algorithms"
    - "detecting cliques in congest networks"
    - "simple and local independent set approximation"
    - "distributed spanner approximation"

Connected through hyperedge HE-6 (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"
    - "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"
    - "near linear lower bounds for distributed distance computations even in sparse networks"

Connected through hyperedge HE-7 (induced by source paper "reachability and shortest paths in the broadcast congest 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 shortest paths in sublinear time"
    - "improved distributed algorithms for exact shortest paths"
    - "algebraic methods in the congested clique"
    - "fast partial distance estimation and applications"
    - "distributed approximation algorithms for weighted shortest paths"
    - "distributed verification and hardness of distributed approximation"

Connected through hyperedge HE-8 (induced by source paper "distributed algorithms for directed betweenness centrality and all pairs shortest paths"):
  with members:
    - "a deterministic distributed algorithm for exact weighted all pairs shortest paths in tilde o n 3 2 rounds"
    - "distributed algorithms for computation of centrality measures in complex networks"
    - "distributed exact shortest paths in sublinear time"
    - "algebraic methods in the congested clique"
    - "distributed approximation algorithms for weighted shortest paths"

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)