human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "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

Connected through hyperedge HE-1 (induced by source paper "on the power of multiplexing in number on the forehead protocols"):
  with members:
    - "lower bounds for number in hand multiparty communication complexity made easy"
    - "multiparty communication complexity of disjointness"

Connected through hyperedge HE-2 (induced by source paper "a strong direct product theorem for the tribes function via the smooth rectangle bound"):
  with members:
    - "a strong direct product theorem in terms of the smooth rectangle bound"
    - "lower bounds on information complexity via zero communication protocols and applications"
    - "an optimal lower bound on the communication complexity of gap hamming distance"
    - "the partition bound for classical communication complexity and query complexity"
    - "a strong direct product theorem for disjointness"

Connected through hyperedge HE-3 (induced by source paper "superlinear lower bounds for multipass graph processing"):
  with members:
    - "better bounds for matchings in the streaming model"
    - "lower bounds on information complexity via zero communication protocols and applications"
    - "information complexity versus corruption and applications to orthogonality and gap hamming"
    - "maximum matching in semi streaming with few passes"
    - "information equals amortized communication"
    - "a discrepancy lower bound for information complexity"
    - "improved approximation guarantees for weighted matching in the semi streaming model"
    - "linear programming in the semi streaming model with application to the maximum matching problem"

Connected through hyperedge HE-4 (induced by source paper "information complexity versus corruption and applications to orthogonality and gap hamming"):
  with members:
    - "lower bounds on information complexity via zero communication protocols and applications"
    - "a discrepancy lower bound for information complexity"
    - "tight bounds for distributed functional monitoring"
    - "an optimal lower bound on the communication complexity of gap hamming distance"
    - "strong direct product theorems for quantum communication and query complexity"
    - "the partition bound for classical communication complexity and query complexity"
    - "a direct sum theorem in communication complexity via message compression"
    - "rectangle size bounds and threshold covers in communication complexity"

Connected through hyperedge HE-5 (induced by source paper "improved direct product theorems for randomized query complexity"):
  with members:
    - "general hardness amplification of predicates and puzzles"
    - "a strong direct product theorem for two way public coin communication complexity"
    - "strong direct product conjecture holds for all relations in public coin randomized one way communication complexity"
    - "strong direct product theorems for quantum communication and query complexity"
    - "optimal direct sum results for deterministic and randomized decision tree complexity"
    - "a strong direct product theorem for disjointness"

Question: Please tell me which class the center node 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)