human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "a tight composition theorem for the randomized query complexity of partial functions"):
  Abstract: We prove two new results about the randomized query complexity of composed functions. First, we show that the randomized composition conjecture is false: there are families of partial Boolean functions $f$ and $g$ such that $R(f\circ g)\ll R(f) R(g)$. In fact, we show that the left hand side can be polynomially smaller than the right hand side (though in our construction, both sides are polylogarithmic in the input size of $f$). #R##N#Second, we show that for all $f$ and $g$, $R(f\circ g)=\Omega(\mathop{noisyR}(f)\cdot R(g))$, where $\mathop{noisyR}(f)$ is a measure describing the cost of computing $f$ on noisy oracle inputs. We show that this composition theorem is the strongest possible of its type: for any measure $M(\cdot)$ satisfying $R(f\circ g)=\Omega(M(f)R(g))$ for all $f$ and $g$, it must hold that $\mathop{noisyR}(f)=\Omega(M(f))$ for all $f$. We also give a clean characterization of the measure $\mathop{noisyR}(f)$: it satisfies $\mathop{noisyR}(f)=\Theta(R(f\circ gapmaj_n)/R(gapmaj_n))$, where $n$ is the input size of $f$ and $gapmaj_n$ is the $\sqrt{n}$-gap majority function on $n$ bits.

Includes members:
  Member "the power of many samples in query complexity":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a new minimax theorem for randomized algorithms")
  Member "a new minimax theorem for randomized algorithms":
    also connected through other hyperedges:
      (none)
  Member "optimal separation and strong direct sum for randomized query complexity":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a new minimax theorem for randomized algorithms")
  Member "a composition theorem for randomized query complexity via max conflict complexity":
    also connected through other hyperedges:
      (none)
  Member "a composition theorem for randomized query complexity":
    also connected through other hyperedges:
      (none)
  Member "randomized query complexity of sabotaged and composed functions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimal separation and strong direct sum for randomized query complexity")
  Member "separations in query complexity based on pointer functions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a nearly optimal lower bound on the approximate degree of ac 0")
  Member "composition limits and separating examples for some boolean function complexity measures":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the power of many samples in query complexity")

Question: Please tell me which class the source paper 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)