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 strong direct product theorem for disjointness"
  Abstract: A strong direct product theorem states that if we want to compute $k$ independent instances of a function, using less than $k$ times the resources needed for one instance, then the overall success probability will be exponentially small in $k$. We establish such a theorem for the randomized communication complexity of the Disjointness problem, i.e., with communication $const\cdot kn$ the success probability of solving $k$ instances of size $n$ can only be exponentially small in $k$. We show that this bound even holds for $AM$ communication protocols with limited ambiguity. This also implies a new lower bound for Disjointness in a restricted 3-player NOF protocol, and optimal communication-space tradeoffs for Boolean matrix product. Our main result follows from a solution to the dual of a linear programming problem, whose feasibility comes from a so-called Intersection Sampling Lemma that generalizes a result by Razborov.

Connected through hyperedge HE-1 (induced by source paper "query to communication lifting using low discrepancy gadgets"):
  with members:
    - "from expanders to hitting distributions and simulation theorems"
    - "query to communication lifting for bpp"
    - "simulation theorems via pseudorandom properties"
    - "communication lower bounds via critical block sensitivity"
    - "lower bounds on information complexity via zero communication protocols and applications"
    - "information equals amortized communication"
    - "improved direct product theorems for randomized query complexity"
    - "the partition bound for classical communication complexity and query complexity"

Connected through hyperedge HE-2 (induced by source paper "query to communication lifting for bpp using inner product"):
  with members:
    - "from expanders to hitting distributions and simulation theorems"
    - "query to communication lifting for bpp"
    - "communication lower bounds via critical block sensitivity"
    - "lower bounds on information complexity via zero communication protocols and applications"
    - "information equals amortized communication"
    - "improved direct product theorems for randomized query complexity"
    - "the partition bound for classical communication complexity and query complexity"

Connected through hyperedge HE-3 (induced by source paper "multi party protocols information complexity and privacy"):
  with members:
    - "the range of topological effects on communication"
    - "tribes is hard in the message passing model"
    - "tight bounds for set disjointness in the message passing model"
    - "information equals amortized communication"
    - "lower bounds for number in hand multiparty communication complexity made easy"
    - "distributed verification and hardness of distributed approximation"
    - "a direct sum theorem in communication complexity via message compression"

Connected through hyperedge HE-4 (induced by source paper "communication complexity of inevitable intersection"):
  with members:
    - "on the communication complexity of sparse set disjointness and exists equal problems"
    - "an optimal lower bound on the communication complexity of gap hamming distance"
    - "the partition bound for classical communication complexity and query complexity"

Connected through hyperedge HE-5 (induced by source paper "information complexity and the quest for interactive compression a survey"):
  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"
    - "information equals amortized communication"
    - "a discrepancy lower bound for information complexity"
    - "strong direct product theorems for quantum communication and query complexity"

Connected through hyperedge HE-6 (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"
    - "a direct product theorem for bounded round public coin randomized communication complexity"
    - "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"

Connected through hyperedge HE-7 (induced by source paper "a strong direct product theorem in terms of the smooth rectangle bound"):
  with members:
    - "a strong direct product theorem for the tribes function via the smooth rectangle bound"
    - "lower bounds on information complexity via zero communication protocols and applications"
    - "information equals amortized communication"
    - "a discrepancy lower bound for information complexity"
    - "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"

Connected through hyperedge HE-8 (induced by source paper "a direct product theorem for bounded round public coin randomized communication complexity"):
  with members:
    - "information equals amortized communication"
    - "improved direct product theorems for randomized query complexity"
    - "strong direct product theorems for quantum communication and query complexity"
    - "a direct sum theorem in communication complexity via message compression"

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)