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 "the corruption bound log rank and communication complexity"):
  Abstract: We prove upper bounds on deterministic communication complexity in terms of log of the rank and simple versions of the corruption bound. #R##N#Our bounds are a simplified version of the results of Gavinsky and Lovett, using the same set of tools. We also give an elementary proof for the upper bound on communication complexity in terms of rank proved by Lovett.

Includes members:
  Member "communication is bounded by root of rank":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "alternation sparsity and sensitivity bounds and exponential gaps")
  Member "lower bounds on information complexity via zero communication protocols and applications":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "query to communication lifting using low discrepancy gadgets")
  Member "the partition bound for classical communication complexity and query complexity":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "query to communication lifting using low discrepancy gadgets")
  Member "rectangle size bounds and threshold covers in communication complexity":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the hardness of approximate and exact bichromatic maximum inner product")
  Member "communication complexity lower bounds by polynomials":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "sensitivity affine transforms and quantum communication complexity")

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)