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: "randomized query complexity of sabotaged and composed functions"
  Abstract: We study the composition question for bounded-error randomized query complexity: Is R(f o g) = Omega(R(f) R(g)) for all Boolean functions f and g? We show that inserting a simple Boolean function h, whose query complexity is only Theta(log R(g)), in between f and g allows us to prove R(f o h o g) = Omega(R(f) R(h) R(g)). #R##N#We prove this using a new lower bound measure for randomized query complexity we call randomized sabotage complexity, RS(f). Randomized sabotage complexity has several desirable properties, such as a perfect composition theorem, RS(f o g) >= RS(f) RS(g), and a composition theorem with randomized query complexity, R(f o g) = Omega(R(f) RS(g)). It is also a quadratically tight lower bound for total functions and can be quadratically superior to the partition bound, the best known general lower bound for randomized query complexity. #R##N#Using this technique we also show implications for lifting theorems in communication complexity. We show that a general lifting theorem for zero-error randomized protocols implies a general lifting theorem for bounded-error protocols.

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"
    - "separations in query complexity based on pointer functions"
    - "composition limits and separating examples for some boolean function complexity measures"
    - "a composition theorem for decision tree complexity"

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

Connected through hyperedge HE-3 (induced by source paper "a composition theorem for randomized query complexity via max conflict complexity"):
  with members:
    - "a composition theorem via conflict complexity"
    - "conflict complexity is lower bounded by block sensitivity"
    - "on the randomised query complexity of composition"
    - "composition limits and separating examples for some boolean function complexity measures"
    - "a composition theorem for decision tree complexity"
    - "an optimal lower bound on the communication complexity of gap hamming distance"

Connected through hyperedge HE-4 (induced by source paper "a composition theorem via conflict complexity"):
  with members:
    - "on the randomised query complexity of composition"

Connected through hyperedge HE-5 (induced by source paper "query to communication lifting for bpp"):
  with members:
    - "entangled simultaneity versus classical interactivity in communication complexity"
    - "nearly optimal separations between communication or query complexity and partitions"
    - "approximating rectangles by juntas and weakly exponential lower bounds for lp relaxations of csps"
    - "communication complexity of approximate nash equilibria"
    - "separations in query complexity based on pointer functions"
    - "lower bounds on the size of semidefinite programming relaxations"
    - "approximate constraint satisfaction requires large lp relaxations"
    - "an optimal lower bound on the communication complexity of gap hamming distance"

Connected through hyperedge HE-6 (induced by source paper "a composition theorem for randomized query complexity"):
  with members:
    - "query to communication lifting for bpp"
    - "a composition theorem for parity kill number"
    - "dual lower bounds for approximate degree and markov bernstein inequalities"
    - "improved direct product theorems for randomized query complexity"

Connected through hyperedge HE-7 (induced by source paper "all classical adversary methods are equivalent for total functions"):
  with members:
    - "nearly optimal separations between communication or query complexity and partitions"
    - "composition limits and separating examples for some boolean function complexity measures"

Connected through hyperedge HE-8 (induced by source paper "low sensitivity functions from unambiguous certificates"):
  with members:
    - "nearly optimal separations between communication or query complexity and partitions"
    - "degree and sensitivity tails of two distributions"
    - "separations in query complexity based on pointer functions"
    - "smooth boolean functions are easy efficient algorithms for low sensitivity functions"
    - "sensitivity versus certificate complexity of boolean functions"
    - "size of sets with small sensitivity a generalization of simon s lemma"
    - "an o n 0 4732 upper bound on the complexity of the gks communication game"
    - "separating decision tree complexity from subcube partition 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)