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 arthur merlin games"
  Abstract: This paper studies quantum Arthur-Merlin games, which are Arthur-Merlin games in which Arthur and Merlin can perform quantum computations and Merlin can send Arthur quantum information. As in the classical case, messages from Arthur to Merlin are restricted to be strings of uniformly generated random bits. It is proved that for one-message quantum Arthur-Merlin games, which correspond to the complexity class QMA, completeness and soundness errors can be reduced exponentially without increasing the length of Merlin's message. Previous constructions for reducing error required a polynomial increase in the length of Merlin's message. Applications of this fact include a proof that logarithmic length quantum certificates yield no increase in power over BQP and a simple proof that QMA is contained in PP. Other facts that are proved include the equivalence of three (or more) message quantum Arthur-Merlin games with ordinary quantum interactive proof systems and some basic properties concerning two-message quantum Arthur-Merlin games.

Connected through hyperedge HE-1 (induced by source paper "complexity limitations on one turn quantum refereed games"):
  with members:
    - "quantum interactive proofs with competing provers"
    - "playing games with algorithms algorithmic combinatorial game theory"
    - "complexity limitations on quantum computation"
    - "simple strategies for large zero sum games with applications to complexity theory"

Connected through hyperedge HE-2 (induced by source paper "vanishing error approximate degree and qma complexity"):
  with members:
    - "on the power of statistical zero knowledge"
    - "hardness amplification and the approximate degree of constant depth circuits"
    - "on arthur merlin games in communication complexity"
    - "bounds for small error and zero error quantum algorithms"

Connected through hyperedge HE-3 (induced by source paper "computational notions of quantum min entropy"):
  with members:
    - "modulus computational entropy"

Connected through hyperedge HE-4 (induced by source paper "circuit obfuscation using braids"):
  with members:
    - "strong equivalence of reversible circuits is conp complete"
    - "pseudorandom generators and the bqp vs ph problem"

Connected through hyperedge HE-5 (induced by source paper "turing equivalent automata using a fixed size quantum memory"):
  with members:
    - "np has log space verifiers with fixed size public quantum registers"
    - "unbounded error quantum computation with small space bounds"
    - "languages recognized by nondeterministic quantum finite automata"
    - "two way finite automata with quantum and classical states"

Connected through hyperedge HE-6 (induced by source paper "on arthur merlin games in communication complexity"):
  with members:
    - "a separation of np and conp in multiparty communication complexity"
    - "the partition bound for classical communication complexity and query complexity"
    - "rectangle size bounds and threshold covers in communication complexity"
    - "bounds for small error and zero error quantum algorithms"

Connected through hyperedge HE-7 (induced by source paper "on quantum interactive proofs with short messages"):
  with members:
    - "quantum multi prover interactive proof systems with limited prior entanglement"

Connected through hyperedge HE-8 (induced by source paper "a parallel approximation algorithm for positive semidefinite programming"):
  with members:
    - "two message quantum interactive proofs are in pspace"

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)