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 "a direct product theorem for bounded round public coin randomized communication complexity"):
  Abstract: A strong direct product theorem for a problem in a given model of computation states that, in order to compute k instances of the problem, if we provide resource which is less than k times the resource required for computing one instance of the problem with constant success probability, then the probability of correctly computing all the k instances together, is exponentially small in k. In this paper, we consider the model of two-party bounded-round public-coin randomized communication complexity. For a relation f ⊆ X ×Y×Z (X,Y,Z are finite sets), let R (t),pub " (f) denote the two-party t-message public-coin communication complexity of f with worst case error e. We show that for any relation f and integer k ≥ 1

Includes members:
  Member "information equals amortized communication":
    also connected through other hyperedges:
      - Hyperedge HE-1 (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-2 (induced by source paper "a tight composition theorem for the randomized query complexity of partial functions")
  Member "strong direct product theorems for quantum communication and query complexity":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a new minimax theorem for randomized algorithms")
  Member "a strong direct product theorem for disjointness":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "query to communication lifting using low discrepancy gadgets")
  Member "a direct sum theorem in communication complexity via message compression":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "polynomial pass lower bounds for graph streaming algorithms")

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)