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 "counting small cliques in mapreduce"):
  Abstract: We present exact and approximate MapReduce estimators for the number of cliques of size k in an undirected graph, for any small constant k >= 3. Besides theoretically analyzing our algorithms in the computational model for MapReduce introduced by Karloff, Suri, and Vassilvitskii, we present the results of extensive computational experiments on the Amazon EC2 platform. Our experiments show the practical effectiveness of our algorithms even on clusters of small/medium size, and suggest their scalability to larger clusters.

Includes members:
  Member "the input output complexity of triangle enumeration":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "instance and output optimal parallel algorithms for acyclic joins")
  Member "enumerating subgraph instances using map reduce":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a survey of community search over big graphs")
  Member "efficient triangle counting in large graphs via degree based vertex partitioning":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "parallel algorithms for small subgraph counting")
  Member "sorting searching and simulation in the mapreduce framework":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "equivalence classes and conditional hardness in massively parallel computations")
  Member "colorful triangle counting and a mapreduce implementation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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.DC(Distributed, Parallel, and Cluster Computing)