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 simple deterministic distributed mst algorithm with near optimal time and message complexities"
  Abstract: Distributed minimum spanning tree (MST) problem is one of the most central and fundamental problems in distributed graph algorithms. Garay et al. \cite{GKP98,KP98} devised an algorithm with running time $O(D + \sqrt{n} \cdot \log^* n)$, where $D$ is the hop-diameter of the input $n$-vertex $m$-edge graph, and with message complexity $O(m + n^{3/2})$. Peleg and Rubinovich \cite{PR99} showed that the running time of the algorithm of \cite{KP98} is essentially tight, and asked if one can achieve near-optimal running time **together with near-optimal message complexity**. #R##N#In a recent breakthrough, Pandurangan et al. \cite{PRS16} answered this question in the affirmative, and devised a **randomized** algorithm with time $\tilde{O}(D+ \sqrt{n})$ and message complexity $\tilde{O}(m)$. They asked if such a simultaneous time- and message-optimality can be achieved by a **deterministic** algorithm. #R##N#In this paper, building upon the work of \cite{PRS16}, we answer this question in the affirmative, and devise a **deterministic** algorithm that computes MST in time $O((D + \sqrt{n}) \cdot \log n)$, using $O(m \cdot \log n + n \log n \cdot \log^* n)$ messages. The polylogarithmic factors in the time and message complexities of our algorithm are significantly smaller than the respective factors in the result of \cite{PRS16}. Also, our algorithm and its analysis are very **simple** and self-contained, as opposed to rather complicated previous sublinear-time algorithms \cite{GKP98,KP98,E04b,PRS16}.

Connected through hyperedge HE-1 (induced by source paper "improved algorithm for min cuts in distributed networks"):
  with members:
    - "local flow partitioning for faster edge connectivity"
    - "a time and message optimal distributed algorithm for minimum spanning trees"
    - "deterministic global minimum cut of a simple graph in near linear time"
    - "almost tight distributed minimum cut algorithms"
    - "distributed minimum cut approximation"
    - "distributed verification and hardness of distributed approximation"
    - "fast computation of small cuts via cycle space sampling"
    - "fast distributed computation of cuts via random circulations"

Connected through hyperedge HE-2 (induced by source paper "distributed construction of light networks"):
  with members:
    - "light spanners for high dimensional norms via stochastic decompositions"
    - "greedy spanners are optimal in doubling metrics"
    - "distributed exact shortest paths in sublinear time"
    - "improved distributed algorithms for exact shortest paths"
    - "constructing light spanners deterministically in near linear time"
    - "minor free graphs have light spanners"
    - "the greedy spanner is existentially optimal"
    - "near optimal approximate shortest paths and transshipment in distributed and streaming models"

Connected through hyperedge HE-3 (induced by source paper "distributed mst a smoothed analysis"):
  with members:
    - "fast approximate shortest paths in the congested clique"
    - "fast and efficient distributed computation of hamiltonian cycles in random graphs"
    - "congested clique algorithms for graph spanners"
    - "new distributed algorithms in almost mixing time via transformations from parallel algorithms"
    - "distributed symmetry breaking algorithms for congested cliques"
    - "towards a complexity theory for the congested clique"
    - "a time and message optimal distributed algorithm for minimum spanning trees"
    - "smoothed analysis of dynamic networks"

Connected through hyperedge HE-4 (induced by source paper "latency capacity and distributed mst"):
  with members:
    - "time message trade offs in distributed algorithms"
    - "broadcast and minimum spanning tree with o m messages in the asynchronous congest model"
    - "round and message optimal distributed graph algorithms"
    - "a time and message optimal distributed algorithm for minimum spanning trees"
    - "construction and impromptu repair of an mst in a distributed network with o m communication"
    - "distributed verification and hardness of distributed approximation"

Connected through hyperedge HE-5 (induced by source paper "faster asynchronous mst and low diameter tree construction with sublinear communication"):
  with members:
    - "time message trade offs in distributed algorithms"
    - "broadcast and minimum spanning tree with o m messages in the asynchronous congest model"
    - "a time and message optimal distributed algorithm for minimum spanning trees"
    - "construction and impromptu repair of an mst in a distributed network with o m communication"
    - "distributed verification and hardness of distributed approximation"

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"
    - "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"
    - "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"

Connected through hyperedge HE-7 (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"
    - "a faster distributed single source shortest paths algorithm"
    - "distributed exact shortest paths in sublinear time"
    - "deterministic subgraph detection in broadcast congest"
    - "on the distributed complexity of large scale graph computations"

Connected through hyperedge HE-8 (induced by source paper "minor excluded network families admit fast distributed algorithms"):
  with members:
    - "distributed exact shortest paths in sublinear time"
    - "distributed exact weighted all pairs shortest paths in tilde o n 5 4 rounds"
    - "low congestion shortcuts without embedding"
    - "an almost tight distributed algorithm for computing single source shortest paths"
    - "near optimal distributed maximum flow"
    - "fast partial distance estimation and applications"
    - "almost tight distributed minimum cut algorithms"
    - "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)