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 "optimal separation and strong direct sum for randomized query complexity"):
  Abstract: We establish two results regarding the query complexity of bounded-error randomized algorithms. #R##N#* Bounded-error separation theorem. There exists a total function $f : \{0,1\}^n \to \{0,1\}$ whose $\epsilon$-error randomized query complexity satisfies $\overline{\mathrm{R}}_\epsilon(f) = \Omega( \mathrm{R}(f) \cdot \log\frac1\epsilon)$. #R##N#* Strong direct sum theorem. For every function $f$ and every $k \ge 2$, the randomized query complexity of computing $k$ instances of $f$ simultaneously satisfies $\overline{\mathrm{R}}_\epsilon(f^k) = \Theta(k \cdot \overline{\mathrm{R}}_{\frac\epsilon k}(f))$. #R##N#As a consequence of our two main results, we obtain an optimal superlinear direct-sum-type theorem for randomized query complexity: there exists a function $f$ for which $\mathrm{R}(f^k) = \Theta( k \log k \cdot \mathrm{R}(f))$. This answers an open question of Drucker (2012). Combining this result with the query-to-communication complexity lifting theorem of Goos, Pitassi, and Watson (2017), this also shows that there is a total function whose public-coin randomized communication complexity satisfies $\mathrm{R}^{\mathrm{cc}} (f^k) = \Theta( k \log k \cdot \mathrm{R}^{\mathrm{cc}}(f))$, answering a question of Feder, Kushilevitz, Naor, and Nisan (1995).

Includes members:
  Member "query to communication lifting for bpp":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "complexity theory game theory and economics the barbados lectures")
  Member "randomized query complexity of sabotaged and composed functions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a tight composition theorem for the randomized query complexity of partial functions")
  Member "nearly optimal separations between communication or query complexity and partitions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "improved bounds on fourier entropy and min entropy")
  Member "information equals amortized communication":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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-5 (induced by source paper "a tight composition theorem for the randomized query complexity of partial functions")

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)