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: "optimal direct sum results for deterministic and randomized decision tree complexity"
  Abstract: A Direct Sum Theorem holds in a model of computation, when solving some k input instances together is k times as expensive as solving one. We show that Direct Sum Theorems hold in the models of deterministic and randomized decision trees for all relations. We also note that a near optimal Direct Sum Theorem holds for quantum decision trees for boolean functions.

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 "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"
    - "improved direct product theorems for randomized query complexity"
    - "every decision tree has an influential variable"
    - "optimal aggregation algorithms for middleware"

Connected through hyperedge HE-3 (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"
    - "improved direct product theorems for randomized query complexity"
    - "the partition bound for classical communication complexity and query complexity"

Connected through hyperedge HE-4 (induced by source paper "improved direct product theorems for randomized query complexity"):
  with members:
    - "a direct product theorem for bounded round public coin randomized communication complexity"
    - "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"
    - "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)