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: "magic coins are useful for small space quantum machines"
  Abstract: Although polynomial-time probabilistic Turing machines can utilize uncomputable transition probabilities to recognize uncountably many languages with bounded error when allowed to use logarithmic space, it is known that such "magic coins" give no additional computational power to constant-space versions of those machines. We show that adding a few quantum bits to the model changes the picture dramatically. For every language $L$, there exists such a two-way quantum finite automaton that recognizes a language of the same Turing degree as $L$ with bounded error in polynomial time. When used as verifiers in public-coin interactive proof systems, such automata can verify membership in all languages with bounded error, outperforming their classical counterparts, which are known to fail for the palindromes language.

Connected through hyperedge HE-1 (induced by source paper "quantum finite automata survey status and research directions"):
  with members:
    - "unary probabilistic and quantum automata on promise problems"
    - "power of the interactive proof systems with verifiers modeled by semi quantum two way finite automata"
    - "promise problems solved by quantum and classical finite automata"
    - "debates with small transparent quantum verifiers"
    - "from quantum query complexity to state complexity"
    - "classical and quantum realtime alternating automata"
    - "quantum finite automata a modern introduction"
    - "on the state complexity of semi quantum finite automata"

Connected through hyperedge HE-2 (induced by source paper "postselecting probabilistic finite state recognizers and verifiers"):
  with members:
    - "uncountable realtime probabilistic classes"
    - "uncountable classical and quantum complexity classes"
    - "classical and quantum realtime alternating automata"
    - "probabilistic and quantum finite automata with postselection"
    - "computation with narrow ctcs"

Connected through hyperedge HE-3 (induced by source paper "classically time controlled quantum automata"):
  with members:
    - "quipper a scalable quantum programming language"
    - "a lambda calculus for quantum computation with classical control"
    - "theory of one tape linear time turing machines"
    - "two way finite automata with quantum and classical states"

Connected through hyperedge HE-4 (induced by source paper "uncountable realtime probabilistic classes"):
  with members:
    - "uncountable classical and quantum complexity classes"
    - "tight bounds for the space complexity of nonregular language recognition by real time machines"

Connected through hyperedge HE-5 (induced by source paper "uncountable classical and quantum complexity classes"):
  with members:
    - "probabilistic verification of all languages"
    - "postselecting probabilistic finite state recognizers and verifiers"
    - "uncountable realtime probabilistic classes"
    - "automata and quantum computing"
    - "quantum stochastic and pseudo stochastic languages with few states"
    - "quantum finite automata a modern introduction"
    - "new results on the minimum amount of useful space"
    - "proving the power of postselection"

Connected through hyperedge HE-6 (induced by source paper "automata and quantum computing"):
  with members:
    - "potential of quantum finite automata with exact acceptance"
    - "classical automata on promise problems"
    - "finite automata with advice tapes"
    - "superiority of exact quantum automata for promise problems"
    - "probabilistic and quantum finite automata with postselection"
    - "computation with narrow ctcs"
    - "classical and quantum computation with small space bounds phd thesis"
    - "unbounded error quantum computation with small space bounds"

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)