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 "massively parallel computation via remote memory access"):
  Abstract: We introduce the Adaptive Massively Parallel Computation (AMPC) model, which is an extension of the Massively Parallel Computation (MPC) model. At a high level, the AMPC model strengthens the MPC model by storing all messages sent within a round in a distributed data store. In the following round, all machines are provided with random read access to the data store, subject to the same constraints on the total amount of communication as in the MPC model. Our model is inspired by the previous empirical studies of distributed graph algorithms using MapReduce and a distributed hash table service. #R##N#This extension allows us to give new graph algorithms with much lower round complexities compared to the best known solutions in the MPC model. In particular, in the AMPC model we show how to solve maximal independent set in $O(1)$ rounds and connectivity/minimum spanning tree in $O(\log\log_{m/n} n)$ rounds both using $O(n^\delta)$ space per machine for constant $\delta < 1$. In the same memory regime for MPC, the best known algorithms for these problems require polylog $n$ rounds. Our results imply that the 2-Cycle conjecture, which is widely believed to hold in the MPC model, does not hold in the AMPC model.

Includes members:
  Member "massively parallel algorithms for finding well connected components in sparse graphs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (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-2 (induced by source paper "equivalence classes and conditional hardness in massively parallel computations")
  Member "connected components at scale via local contractions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "equivalence classes and conditional hardness in massively parallel computations")
  Member "implicit decomposition for write efficient connectivity algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "semi asymmetric parallel graph algorithms for nvrams")
  Member "massively parallel algorithms and hardness for single linkage clustering under ell_p distances":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "equivalence classes and conditional hardness in massively parallel computations")
  Member "communication steps for parallel query processing":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "equivalence classes and conditional hardness in massively parallel computations")
  Member "greedy sequential maximal independent set and matching are parallel on average":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "relaxed scheduling for scalable belief propagation")
  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)