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 "lower bounds for approximating graph parameters via communication complexity"):
  Abstract: We present a new framework for proving query complexity lower bounds for graph problems via reductions from communication complexity. We illustrate our technique by giving new proofs of tight lower bounds for several graph problems: estimating the number of edges in a graph, sampling edges from an almost-uniform distribution, estimating the number of $k$-cliques in a graph, and estimating the moments of the degree distribution of a graph.

Includes members:
  Member "on approximating the number of k cliques in sublinear time":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "linear time subgraph counting graph degeneracy and the chasm at size six")
  Member "on sampling edges almost uniformly":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "computing and testing small connectivity in near linear time and queries via fast local cut algorithms")
  Member "sublinear time estimation of degree distribution moments the degeneracy connection":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "dependent randomized rounding for clustering and partition systems with knapsack constraints")
  Member "approximately counting triangles in sublinear time":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "parallel algorithms for small subgraph counting")
  Member "a stable marriage requires communication":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the complexity of interactively learning a stable matching by trial and error")

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)