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 "round compression for parallel graph algorithms in strongly sublinear space"):
  Abstract: The Massive Parallel Computation (MPC) model is a theoretical framework for popular parallel and distributed platforms such as MapReduce, Hadoop, or Spark. We consider the task of computing a large matching or small vertex cover in this model when the space per machine is $n^\delta$ for $\delta \in (0,1)$, where $n$ is the number of vertices in the input graph. A direct simulation of classic PRAM and distributed algorithms from the 1980s results in algorithms that require at least a logarithmic number of MPC rounds. We give the first algorithm that breaks this logarithmic barrier and runs in $\tilde O(\sqrt{\log n})$ rounds, as long as the total space is at least slightly superlinear in the number of vertices. #R##N#The result is obtained by repeatedly compressing several rounds of a natural peeling algorithm to a logarithmically smaller number of MPC rounds. Each time we show that it suffices to consider a low-degree subgraph, in which local neighborhoods can be explored with exponential speedup. Our techniques are relatively simple and can also be used to accelerate the simulation of distributed algorithms for bounded-degree graphs and finding a maximal independent set in bounded-arboricity graphs.

Includes members:
  Member "matching and mis for uniformly sparse graphs in the low memory mpc model":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "batch dynamic algorithms via parallel change propagation and applications to dynamic trees")
  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 "massively parallel symmetry breaking on sparse graphs mis and maximal matching":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "log diameter rounds algorithms for 2 vertex and 2 edge connectivity")
  Member "breaking the linear memory barrier in mpc fast mis on trees with n e memory per machine":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "parallel algorithms for small subgraph counting")
  Member "greedy and local ratio algorithms in the mapreduce model":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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-6 (induced by source paper "how fast can you update your mst dynamic algorithms for cluster computing")
  Member "coresets meet edcs algorithms for matching and vertex cover on massive graphs":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "equivalence classes and conditional hardness in massively parallel computations")
  Member "simple round compression for parallel vertex cover":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "parallel algorithms for small subgraph counting")

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.DS(Data Structures and Algorithms)