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 "almost optimal distributed algorithms for large scale graph problems"):
  Abstract: Motivated by the increasing need to understand the algorithmic foundations of distributed large-scale graph computations, we study a number of 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 graph is assumed to be randomly partitioned among the $k$ machines, a common implementation in many real-world systems. The communication is point-to-point, and the goal is to minimize the time complexity, i.e., the number of communication rounds of the computation. #R##N#Our main result is an (almost) optimal distributed randomized algorithm for graph connectivity. Our algorithm runs in $\tilde{O}(n/k^2)$ rounds ($\tilde{O}$ notation hides a $\text{polylog}(n)$ factor and an additive $\text{polylog}(n)$ term). This improves over the best previously known bound of $\tilde{O}(n/k)$ [Klauck et al., SODA 2015], and is optimal (up to a polylogarithmic factor) in view of the existing lower bound of $\tilde{\Omega}(n/k^2)$. Our improved algorithm uses a bunch of techniques, including linear graph sketching, which for the first time is applied in a non-trivial way in distributed computing. We then present fast randomized algorithms for computing minimum spanning trees, (approximate) min-cuts, and for many graph verification problems. All these algorithms take $\tilde{O}(n/k^2)$ rounds, and are optimal up to polylogarithmic factors. We also show an almost matching lower bound of $\tilde{\Omega}(n/k^2)$ for many graph verification problems.

Includes members:
  Member "algebraic methods in the congested clique":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "exponentially faster shortest paths in the congested clique")
  Member "computing exact distances in the congested clique":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "fast distributed algorithms for connectivity and mst in large graphs")
  Member "goffish a sub graph centric framework for large scale graph analytics":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a distributed path query engine for temporal property graphs")
  Member "distributed approximation algorithms for weighted shortest paths":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "distributed edge connectivity in sublinear time")
  Member "algebrisation in distributed graph algorithms fast matrix multiplication in the congested clique":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "fast distributed algorithms for connectivity and mst in large graphs")
  Member "distributed minimum cut approximation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "beyond alice and bob improved inapproximability for maximum independent set in congest")
  Member "distributed computation of large scale graph problems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "equivalence classes and conditional hardness in massively parallel computations")
  Member "when distributed computation is communication expensive":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "the communication complexity of optimization")

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)