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 deterministic distributed algorithm for exact weighted all pairs shortest paths in tilde o n 3 2 rounds"
  Abstract: We present a deterministic distributed algorithm to compute all-pairs shortest paths(APSP) in an edge-weighted directed or undirected graph. Our algorithm runs in $\tilde{O}(n^{3/2})$ rounds in the Congest model, where $n$ is the number of nodes in the graph. This is the first $o(n^2)$ rounds deterministic distributed algorithm for the weighted APSP problem. Our algorithm is fairly simple and incorporates a deterministic distributed algorithm we develop for computing a `blocker set' \cite{King99}, which has been used earlier in sequential dynamic computation of APSP.

Connected through hyperedge HE-1 (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"
    - "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"
    - "linear size hopsets with small hopbound and distributed routing with low memory"

Connected through hyperedge HE-2 (induced by source paper "smaller cuts higher lower bounds"):
  with members:
    - "a faster deterministic distributed algorithm for weighted apsp through pipelining"
    - "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"
    - "distributed approximation of maximum independent set and maximum matching"

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"
    - "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"
    - "near linear lower bounds for distributed distance computations even in sparse networks"

Connected through hyperedge HE-4 (induced by source paper "reachability and shortest paths in the broadcast congest model"):
  with members:
    - "fast approximate shortest paths in the congested clique"
    - "distributed exact weighted all pairs shortest paths in near linear time"
    - "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-5 (induced by source paper "deterministic combinatorial replacement paths and distance sensitivity oracles"):
  with members:
    - "dynamic matching reducing integral algorithms to approximately maximal fractional algorithms"
    - "generating families of practical fast matrix multiplication algorithms"
    - "improved algorithms for decremental single source reachability on directed graphs"
    - "a framework for practical parallel fast matrix multiplication"
    - "decremental single source shortest paths on undirected graphs in near linear total update time"
    - "sublinear time decremental algorithms for single source reachability and shortest paths on directed graphs"
    - "replacement paths via row minima of concise matrices"

Connected through hyperedge HE-6 (induced by source paper "distributed exact weighted all pairs shortest paths in near linear time"):
  with members:
    - "distributed edge connectivity in sublinear time"
    - "new and simplified distributed algorithms for weighted all pairs shortest paths"
    - "a deterministic distributed algorithm for weighted all pairs shortest paths through pipelining"
    - "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"
    - "improved distributed algorithms for exact shortest paths"
    - "a simple deterministic distributed mst algorithm with near optimal time and message complexities"

Connected through hyperedge HE-7 (induced by source paper "distributed triangle detection via expander decomposition"):
  with members:
    - "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"
    - "a faster distributed single source shortest paths algorithm"
    - "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"

Connected through hyperedge HE-8 (induced by source paper "distributed algorithms for directed betweenness centrality and all pairs shortest paths"):
  with members:
    - "distributed exact weighted all pairs shortest paths in near linear time"
    - "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.DS(Data Structures and Algorithms)