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: "two message quantum interactive proofs are in pspace"
  Abstract: We prove that QIP(2), the class of problems having two-message quantum interactive proof systems, is a subset of PSPACE. This relationship is obtained by means of an efficient parallel algorithm, based on the multiplicative weights update method, for approximately solving a certain class of semidefinite programs.

Connected through hyperedge HE-1 (induced by source paper "using optimization to obtain a width independent parallel simpler and faster positive sdp solver"):
  with members:
    - "spectral sparsification and regret minimization beyond matrix multiplicative updates"
    - "a nearly linear time ptas for explicit fractional packing and covering linear programs"
    - "using optimization to break the epsilon barrier a faster and simpler width independent algorithm for solving positive linear programs in parallel"
    - "nearly linear time approximation schemes for mixed packing covering and facility location linear programs"
    - "a parallel approximation algorithm for mixed packing and covering semidefinite programs"
    - "a parallel approximation algorithm for positive semidefinite programming"
    - "approximating the exponential the lanczos method and an tilde o m time spectral algorithm for balanced separator"
    - "sequential and parallel algorithms for mixed packing and covering"

Connected through hyperedge HE-2 (induced by source paper "approximation theory and the design of fast algorithms"):
  with members:
    - "dual lower bounds for approximate degree and markov bernstein inequalities"
    - "towards an sdp based approach to spectral methods a nearly linear time algorithm for graph partitioning and decomposition"
    - "nearly linear time algorithms for graph partitioning graph sparsification and solving linear systems"

Connected through hyperedge HE-3 (induced by source paper "a parallel approximation algorithm for mixed packing and covering semidefinite programs"):
  with members:
    - "faster and simpler width independent parallel algorithms for positive semidefinite programming"
    - "a parallel approximation algorithm for positive semidefinite programming"
    - "sequential and parallel algorithms for mixed packing and covering"

Connected through hyperedge HE-4 (induced by source paper "a parallel approximation algorithm for positive semidefinite programming"):
  with members:
    - "quantum arthur merlin games"

Connected through hyperedge HE-5 (induced by source paper "interactive proofs with competing teams of no signaling provers"):
  with members:
    - "parallel repetition simplification and the no signaling case"
    - "polynomial space approximation of no signaling provers"
    - "sequential and parallel algorithms for mixed packing and covering"

Connected through hyperedge HE-6 (induced by source paper "polynomial space approximation of no signaling provers"):
  with members:
    - "sequential and parallel algorithms for mixed packing and covering"
    - "quantum multi prover interactive proof systems with limited prior entanglement"

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)