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 "on the communication complexity of distributed clustering"):
  Abstract: In this paper we give a first set of communication lower bounds for distributed clustering problems, in particular, for k-center, k-median and k-means. When the input is distributed across a large number of machines and the number of clusters k is small, our lower bounds match the current best upper bounds up to a logarithmic factor. We have designed a new composition framework in our proofs for multiparty number-in-hand communication complexity which may be of independent interest.

Includes members:
  Member "dimensionality reduction for k means clustering and low rank approximation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "approximating spectral clustering via sampling a review")
  Member "improved distributed principal component analysis":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the communication complexity of optimization")
  Member "when distributed computation is communication expensive":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the communication complexity of optimization")
  Member "fast clustering using mapreduce":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "equivalence classes and conditional hardness in massively parallel computations")
  Member "lower bounds for number in hand multiparty communication complexity made easy":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "beyond alice and bob improved inapproximability for maximum independent set in congest")
  Member "tight bounds for distributed functional monitoring":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "towards optimal moment estimation in streaming and distributed models")

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.CC(Computational Complexity)