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 "parallel correlation clustering on big graphs"):
  Abstract: Given a similarity graph between items, correlation clustering (CC) groups similar items together and dissimilar ones apart. One of the most popular CC algorithms is KwikCluster: an algorithm that serially clusters neighborhoods of vertices, and obtains a 3-approximation ratio. Unfortunately, KwikCluster in practice requires a large number of clustering rounds, a potential bottleneck for large graphs. #R##N#We present C4 and ClusterWild!, two algorithms for parallel correlation clustering that run in a polylogarithmic number of rounds and achieve nearly linear speedups, provably. C4 uses concurrency control to enforce serializability of a parallel clustering process, and guarantees a 3-approximation ratio. ClusterWild! is a coordination free algorithm that abandons consistency for the benefit of better scaling; this leads to a provably small loss in the 3-approximation ratio. #R##N#We provide extensive experimental results for both algorithms, where we outperform the state of the art, both in terms of clustering accuracy and running time. We show that our algorithms can cluster billion-edge graphs in under 5 seconds on 32 cores, while achieving a 15x speedup.

Includes members:
  Member "correlation clustering with noisy partial information":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "robust clustering oracle and local reconstructor of cluster structure of graphs")
  Member "correlation clustering with constrained cluster sizes and extended weights bounds":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "discovering polarized communities in signed networks")
  Member "optimistic concurrency control for distributed unsupervised learning":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "generalized dirichlet process means for f separable distortion measures")
  Member "greedy sequential maximal independent set and matching are parallel on average":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "relaxed scheduling for scalable belief propagation")
  Member "layered label propagation a multiresolution coordinate free ordering for compressing social networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "2ps high quality edge partitioning with two phase streaming")
  Member "correlation clustering with a fixed number of clusters":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "spectral clustering of signed graphs via matrix power means")

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)