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: "quantum multi prover interactive proof systems with limited prior entanglement"
  Abstract: This paper gives the first formal treatment of a quantum analogue of multi-prover interactive proof systems. It is proved that the class of languages having quantum multi-prover interactive proof systems is necessarily contained in NEXP, under the assumption that provers are allowed to share at most polynomially many prior-entangled qubits. This implies that, in particular, if provers do not share any prior entanglement with each other, the class of languages having quantum multi-prover interactive proof systems is equal to NEXP. Related to these, it is shown that, in the case a prover does not have his private qubits, the class of languages having quantum single-prover interactive proof systems is also equal to NEXP.

Connected through hyperedge HE-1 (induced by source paper "on quantum interactive proofs with short messages"):
  with members:
    - "quantum arthur merlin games"

Connected through hyperedge HE-2 (induced by source paper "polynomial space approximation of no signaling provers"):
  with members:
    - "two message quantum interactive proofs are in pspace"
    - "sequential and parallel algorithms for mixed packing and covering"

Connected through hyperedge HE-3 (induced by source paper "two message quantum interactive proofs are in pspace"):
  with members:
    - "quantum arthur merlin games"

Connected through hyperedge HE-4 (induced by source paper "quantum arthur merlin games"):
  with members:
    - "quantum interactive proofs with competing provers"
    - "on the hardness of distinguishing mixed state quantum computations"
    - "succinct quantum proofs for properties of finite groups"
    - "complexity limitations on quantum computation"

Connected through hyperedge HE-5 (induced by source paper "short quantum games"):
  with members:
    - "quantum interactive proofs with competing provers"
    - "on the hardness of distinguishing mixed state quantum computations"

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)