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 "tight bounds for distributed graph computations"):
  Abstract: Motivated by the need to understand the algorithmic foundations of distributed large-scale graph computations, we study some fundamental graph problems in a message-passing model for distributed computing where $k \geq 2$ machines jointly perform computations on graphs with $n$ nodes (typically, $n \gg k$). The input graph is assumed to be initially randomly partitioned among the $k$ machines. Communication is point-to-point, and the goal is to minimize the number of communication rounds of the computation. #R##N#We present (almost) tight bounds for the round complexity of two fundamental graph problems, namely PageRank computation and triangle enumeration. Our tight lower bounds, a main contribution of the paper, are established through an information-theoretic approach that relates the round complexity to the minimal amount of information required by machines for correctly solving a problem. Our approach is generic and might be useful in showing lower bounds in the context of similar problems and similar models. #R##N#We show a lower bound of $\tilde{\Omega}(n/k^2)$ rounds for computing the PageRank. (Notation $\tilde \Omega$ hides a ${1}/{\text{polylog}(n)}$ factor.) We also present a simple distributed algorithm that computes the PageRank of all the nodes of a graph in $\tilde{O}(n/k^2)$ rounds (notation $\tilde O$ hides a $\text{polylog}(n)$ factor and an additive $\text{polylog}(n)$ term). #R##N#For triangle enumeration, we show a lower bound of $\tilde{\Omega}(m/k^{5/3})$ rounds, where $m$ is the number of edges of the graph. Our result implies a lower bound of $\tilde\Omega(n^{1/3})$ for the congested clique, which is tight up to logarithmic factors. We also present a distributed algorithm that enumerates all the triangles of a graph in $\tilde{O}(m/k^{5/3})$ rounds.

Includes members:
  Member "mst in o 1 rounds of the congested clique":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "how fast can you update your mst dynamic algorithms for cluster computing")
  Member "near optimal clustering in the k machine model":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "efficient distributed community detection in the stochastic block model")
  Member "worst case optimal algorithms for parallel query processing":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "instance and output optimal parallel algorithms for acyclic joins")
  Member "algebraic methods in the congested clique":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "exponentially faster 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 "fast distributed pagerank computation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "walking randomly massively and efficiently")
  Member "almost optimal distributed algorithms for large scale graph problems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "how fast can you update your mst dynamic algorithms for cluster computing")
  Member "the input output complexity of triangle enumeration":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "instance and output optimal parallel algorithms for acyclic joins")

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)