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 "query to communication lifting for bpp using inner product"):
  Abstract: We prove a new query-to-communication lifting for randomized protocols, with inner product as gadget. This allows us to use a much smaller gadget, leading to a more efficient lifting. Prior to this work, such a theorem was known only for deterministic protocols, due to Chattopadhyay et al. and Wu et al. The only query-to-communication lifting result for randomized protocols, due to Goos, Pitassi and Watson, used the much larger indexing gadget. #R##N#Our proof also provides a unified treatment of randomized and deterministic lifting. Most existing proofs of deterministic lifting theorems use a measure of information known as thickness. In contrast, Goos, Pitassi and Watson used blockwise min-entropy as a measure of information. Our proof uses the blockwise min-entropy framework to prove lifting theorems in both settings in a unified way.

Includes members:
  Member "from expanders to hitting distributions and simulation theorems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "query to communication lifting using low discrepancy gadgets")
  Member "query to communication lifting for bpp":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "complexity theory game theory and economics the barbados lectures")
  Member "communication lower bounds via critical block sensitivity":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "complexity theory game theory and economics the barbados lectures")
  Member "lower bounds on information complexity via zero communication protocols and applications":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "query to communication lifting using low discrepancy gadgets")
  Member "information equals amortized communication":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "communication for generating correlation a unifying survey")
  Member "improved direct product theorems for randomized query complexity":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a tight composition theorem for the randomized query complexity of partial functions")
  Member "the partition bound for classical communication complexity and query complexity":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "query to communication lifting using low discrepancy gadgets")
  Member "a strong direct product theorem for disjointness":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "query to communication lifting using low discrepancy gadgets")

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)