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: "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.

Connected through hyperedge HE-1 (induced by source paper "a tight composition theorem for the randomized query complexity of partial functions"):
  with members:
    - "the power of many samples in query complexity"
    - "a new minimax theorem for randomized algorithms"
    - "optimal separation and strong direct sum for randomized query complexity"
    - "a composition theorem for randomized query complexity via max conflict complexity"
    - "a composition theorem for randomized query complexity"
    - "randomized query complexity of sabotaged and composed functions"
    - "separations in query complexity based on pointer functions"
    - "composition limits and separating examples for some boolean function complexity measures"

Connected through hyperedge HE-2 (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"
    - "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 "constructive derandomization of query algorithms"):
  with members:
    - "lifting with simple gadgets and applications to circuit and proof complexity"
    - "beyond worst case analysis"
    - "query to communication lifting for bpp"
    - "the influence lower bound via query elimination"
    - "optimal direct sum results for deterministic and randomized decision tree complexity"
    - "every decision tree has an influential variable"
    - "optimal aggregation algorithms for middleware"

Connected through hyperedge HE-4 (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"
    - "the partition bound for classical communication complexity and query complexity"
    - "a strong direct product theorem for disjointness"

Connected through hyperedge HE-5 (induced by source paper "optimal separation and strong direct sum for randomized query complexity"):
  with members:
    - "query to communication lifting for bpp"
    - "randomized query complexity of sabotaged and composed functions"
    - "nearly optimal separations between communication or query complexity and partitions"
    - "information equals amortized communication"

Connected through hyperedge HE-6 (induced by source paper "simulation theorems via pseudorandom properties"):
  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"
    - "strong direct product theorems for quantum communication and query complexity"
    - "a direct sum theorem in communication complexity via message compression"

Connected through hyperedge HE-7 (induced by source paper "a composition theorem for randomized query complexity"):
  with members:
    - "query to communication lifting for bpp"
    - "randomized query complexity of sabotaged and composed functions"
    - "a composition theorem for parity kill number"
    - "dual lower bounds for approximate degree and markov bernstein inequalities"

Connected through hyperedge HE-8 (induced by source paper "randomized query complexity of sabotaged and composed functions"):
  with members:
    - "nearly optimal separations between communication or query complexity and partitions"
    - "a quadratically tight partition bound for classical communication complexity and query complexity"
    - "composition limits and separating examples for some boolean function complexity measures"
    - "a composition theorem for decision tree complexity"
    - "optimal direct sum results for deterministic and randomized decision tree complexity"
    - "the partition bound for classical communication complexity and query complexity"

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)