human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "how fast can you update your mst dynamic algorithms for cluster computing"):
  Abstract: Imagine a large graph that is being processed by a cluster of computers, e.g., described by the $k$-machine model or the Massively Parallel Computation Model. The graph, however, is not static; instead it is receiving a constant stream of updates. How fast can the cluster process the stream of updates? The fundamental question we want to ask in this paper is whether we can update the graph fast enough to keep up with the stream. We focus specifically on the problem of maintaining a minimum spanning tree (MST), and we give an algorithm for the $k$-machine model that can process $O(k)$ graph updates per $O(1)$ rounds with high probability. (And these results carry over to the Massively Parallel Computation (MPC) model.) We also show a lower bound, i.e., it is impossible to process $k^{1+\epsilon}$ updates in $O(1)$ rounds. Thus we provide a nearly tight answer to the question of how fast a cluster can respond to a stream of graph modifications while maintaining an MST.

Includes members:
  Member "parallel batch dynamic graph connectivity":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "dynamic graph algorithms with batch updates in the massively parallel computation model")
  Member "dynamic algorithms for the massively parallel computation model":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "equivalence classes and conditional hardness in massively parallel computations")
  Member "sparsifying distributed algorithms with ramifications in massively parallel computation and centralized local computation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "equivalence classes and conditional hardness in massively parallel computations")
  Member "mst in o 1 rounds of the congested clique":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "fast approximate shortest paths in the congested clique")
  Member "fast distributed algorithms for connectivity and mst in large graphs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "equivalence classes and conditional hardness in massively parallel computations")
  Member "almost optimal distributed algorithms for large scale graph problems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "tight bounds for distributed graph computations")
  Member "optimal deterministic routing and sorting on the congested clique":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "exponentially faster shortest paths in the congested clique")
  Member "sorting searching and simulation in the mapreduce framework":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "equivalence classes and conditional hardness in massively parallel computations")

Question: Please tell me which class the source paper 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)