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: "super fast mst algorithms in the congested clique using o m messages"
  Abstract: In a sequence of recent results (PODC 2015 and PODC 2016), the running time of the fastest algorithm for the \emph{minimum spanning tree (MST)} problem in the \emph{Congested Clique} model was first improved to $O(\log \log \log n)$ from $O(\log \log n)$ (Hegeman et al., PODC 2015) and then to $O(\log^* n)$ (Ghaffari and Parter, PODC 2016). All of these algorithms use $\Theta(n^2)$ messages independent of the number of edges in the input graph. #R##N#This paper positively answers a question raised in Hegeman et al., and presents the first "super-fast" MST algorithm with $o(m)$ message complexity for input graphs with $m$ edges. Specifically, we present an algorithm running in $O(\log^* n)$ rounds, with message complexity $\tilde{O}(\sqrt{m \cdot n})$ and then build on this algorithm to derive a family of algorithms, containing for any $\varepsilon$, $0 < \varepsilon \le 1$, an algorithm running in $O(\log^* n/\varepsilon)$ rounds, using $\tilde{O}(n^{1 + \varepsilon}/\varepsilon)$ messages. Setting $\varepsilon = \log\log n/\log n$ leads to the first sub-logarithmic round Congested Clique MST algorithm that uses only $\tilde{O}(n)$ messages. #R##N#Our primary tools in achieving these results are (i) a component-wise bound on the number of candidates for MST edges, extending the sampling lemma of Karger, Klein, and Tarjan (Karger, Klein, and Tarjan, JACM 1995) and (ii) $\Theta(\log n)$-wise-independent linear graph sketches (Cormode and Firmani, Dist.~Par.~Databases, 2014) for generating MST candidate edges.

Connected through hyperedge HE-1 (induced by source paper "distributed approximation algorithms for steiner tree in the mathcal congested mathcal clique"):
  with members:
    - "connectivity lower bounds in broadcast congested clique"
    - "mst in o 1 rounds of the congested clique"
    - "algebraic methods in the congested clique"
    - "approximation of distances and shortest paths in the broadcast congest clique"
    - "fast partial distance estimation and applications"
    - "distributed approximation algorithms for weighted shortest paths"
    - "near constant time distributed algorithms on a congested clique"
    - "super fast distributed algorithms for metric facility location"

Connected through hyperedge HE-2 (induced by source paper "sparse matrix multiplication with bandwidth restricted all to all communication"):
  with members:
    - "multi threaded sparse matrix matrix multiplication for many core and gpu architectures"
    - "mst in o 1 rounds of the congested clique"
    - "increasing the efficiency of sparse matrix matrix multiplication with a 2 5d algorithm and one sided mpi"
    - "improved rectangular matrix multiplication using powers of the coppersmith winograd tensor"
    - "towards a complexity theory for the congested clique"
    - "tight bounds for distributed graph computations"
    - "further algebraic algorithms in the congested clique model and applications to graph theoretic problems"
    - "hypergraph partitioning for sparse matrix matrix multiplication"

Connected through hyperedge HE-3 (induced by source paper "mst in o 1 rounds of the congested clique"):
  with members:
    - "msf and connectivity in limited variants of the congested clique"
    - "lessons from the congested clique applied to mapreduce"
    - "distributed computation of large scale graph problems"
    - "optimal deterministic routing and sorting on the congested clique"

Connected through hyperedge HE-4 (induced by source paper "msf and connectivity in limited variants of the congested clique"):
  with members:
    - "deterministic graph connectivity in the broadcast congested clique"
    - "lessons from the congested clique applied to mapreduce"
    - "distributed computation of large scale graph problems"
    - "optimal deterministic routing and sorting on the congested clique"

Connected through hyperedge HE-5 (induced by source paper "fast distributed algorithms for connectivity and mst in large graphs"):
  with members:
    - "near optimal clustering in the k machine model"
    - "tight bounds for distributed graph computations"
    - "on the distributed complexity of large scale graph computations"
    - "a time and message optimal distributed algorithm for minimum spanning trees"
    - "distributed algorithms for finding local clusters using heat kernel pagerank"
    - "algebraic methods in the congested clique"
    - "construction and impromptu repair of an mst in a distributed network with o m communication"
    - "computing exact distances in the congested clique"

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)