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 "no signaling proofs with o log n provers are in pspace"):
  Abstract: No-signaling proofs, motivated by quantum computation, have found applications in cryptography and hardness of approximation. An important open problem is characterizing the power of no-signaling proofs. It is known that 2-prover no-signaling proofs are characterized by PSPACE, and that no-signaling proofs with $poly(n)$-provers are characterized by EXP. However, the power of $k$-prover no-signaling proofs, for $2<k<poly(n)$ remained an open problem. #R##N#We show that $k$-prover no-signaling proofs (with negligible soundness) for $k=O(\sqrt{\log n})$ are contained in PSPACE. We prove this via two different routes that are of independent interest. In both routes we consider a relaxation of no-signaling called sub-no-signaling. Our main technical contribution (which is used in both our proofs) is a reduction showing how to convert any sub-no-signaling strategy with value at least $1-2^{-\Omega(k^2)}$ into a no-signaling one with value at least $2^{-O(k^2)}$. #R##N#In the first route, we show that the classical prover reduction method for converting $k$-prover games into $2$-prover games carries over to the no-signaling setting with the following loss in soundness: if a $k$-player game has value less than $2^{-ck^2}$ (for some constant~$c>0$), then the corresponding 2-prover game has value at most $1 - 2^{dk^2}$ (for some constant~$d>0$). In the second route we show that the value of a sub-no-signaling game can be approximated in space that is polynomial in the communication complexity and exponential in the number of provers.

Includes members:
  Member "polynomial space approximation of no signaling provers":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "interactive proofs with competing teams of no signaling provers")
  Member "sequential and parallel algorithms for mixed packing and covering":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "distributed assignment with limited communication for multi robot multi target tracking")

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)