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 "improved direct product theorems for randomized query complexity"):
  Abstract: The direct product problem is a fundamental question in complexity theory which seeks to understand how the difficulty of computing a function on each of k independent inputs scales with k. We prove the following direct product theorem (DPT) for query complexity: if every T-query algorithm has success probability at most 1 - eps in computing the Boolean function f on input distribution Mu, then for alpha   0, the worst-case success probability of any (alpha R_2(f)k)-query randomized algorithm for f^k falls exponentially with k. The best previous statement of this type, due to Klauck, Spalek, and de Wolf, required a query bound of O(bs(f)k). The proof involves defining and analyzing a collection of martingales associated with an algorithm attempting to solve f^k. Our method is quite general and yields a new XOR lemma and threshold DPT for the query model, as well as DPTs for the query complexity of learning tasks, search problems, and tasks involving interaction with dyamic entities. We also give a version of our DPT in which decision tree size is the resource of interest.

Includes members:
  Member "a direct product theorem for bounded round public coin randomized communication complexity":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the power of multiplexing in number on the forehead protocols")
  Member "general hardness amplification of predicates and puzzles":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "adversarially robust learning could leverage computational hardness")
  Member "a strong direct product theorem for two way public coin communication complexity":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a discrepancy lower bound for information complexity")
  Member "strong direct product conjecture holds for all relations in public coin randomized one way communication complexity":
    also connected through other hyperedges:
      (none)
  Member "strong direct product theorems for quantum communication and query complexity":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a new minimax theorem for randomized algorithms")
  Member "optimal direct sum results for deterministic and randomized decision tree 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")
  Member "a strong direct product theorem for disjointness":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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)