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 "mis in the congested clique model in o log log δ rounds"):
  Abstract: We give a maximal independent set (MIS) algorithm that runs in $O(\log \log \Delta)$ rounds in the congested clique model, where $\Delta$ is the maximum degree of the input graph. This improves upon the $O(\frac{\log(\Delta) \cdot \log \log \Delta}{\sqrt{\log n}} + \log \log \Delta )$ rounds algorithm of [Ghaffari, PODC '17], where $n$ is the number of vertices of the input graph. #R##N#In the first stage of our algorithm, we simulate the first $O(\frac{n}{\text{poly} \log n})$ iterations of the sequential random order Greedy algorithm for MIS in the congested clique model in $O(\log \log \Delta)$ rounds. This thins out the input graph relatively quickly: After this stage, the maximum degree of the residual graph is poly-logarithmic. In the second stage, we run the MIS algorithm of [Ghaffari, PODC '17] on the residual graph, which completes in $O(\log \log \Delta)$ rounds on graphs of poly-logarithmic degree.

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 "further algebraic algorithms in the congested clique model and applications to graph theoretic problems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "exponentially faster shortest paths in the congested clique")
  Member "algebraic methods in the congested clique":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "exponentially faster shortest paths in the congested clique")
  Member "an improved distributed algorithm for maximal independent set":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "space efficient approximation to maximum matching size from uniform edge samples")
  Member "near constant time distributed algorithms on a congested clique":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "distributed approximation algorithms for steiner tree in the mathcal congested mathcal clique")
  Member "optimal deterministic routing and sorting on the congested clique":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "exponentially faster shortest paths in the congested clique")
  Member "the locality of distributed symmetry breaking":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "distributed maximum matching verification in congest")
  Member "local computation lower and upper bounds":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "distributed maximum matching verification in congest")

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)