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: "on the randomised query complexity of composition"
  Abstract: Let $f\subseteq\{0,1\}^n\times\Xi$ be a relation and $g:\{0,1\}^m\to\{0,1,*\}$ be a promise function. This work investigates the randomised query complexity of the relation $f\circ g^n\subseteq\{0,1\}^{m\cdot n}\times\Xi$, which can be viewed as one of the most general cases of composition in the query model (letting $g$ be a relation seems to result in a rather unnatural definition of $f\circ g^n$). #R##N#We show that for every such $f$ and $g$, $$\mathcal R(f\circ g^n) \in \Omega(\mathcal R(f)\cdot\sqrt{\mathcal R(g)}),$$ where $\mathcal R$ denotes the randomised query complexity. On the other hand, we demonstrate a relation $f_0$ and a promise function $g_0$, such that $\mathcal R(f_0)\in\Theta(\sqrt n)$, $\mathcal R(g_0)\in\Theta(n)$ and $\mathcal R(f_0\circ g_0^n)\in\Theta(n)$ $-$ that is, our composition statement is tight. #R##N#To the best of our knowledge, there was no known composition theorem for the randomised query complexity of relations or promise functions (and for the special case of total functions our lower bound gives multiplicative improvement of $\sqrt{\log n}$).

Connected through hyperedge HE-1 (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"
    - "randomized query complexity of sabotaged and composed functions"
    - "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-2 (induced by source paper "a composition theorem via conflict complexity"):
  with members:
    - "randomized query complexity of sabotaged and composed functions"

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)