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: "quasi decidability of a fragment of the first order theory of real numbers"
  Abstract: In this paper we consider a fragment of the first-order theory of the real numbers that includes systems of equations of continuous functions in bounded domains, and for which all functions are computable in the sense that it is possible to compute arbitrarily close piece-wise interval approximations. Even though this fragment is undecidable, we prove that there is a (possibly non-terminating) algorithm for checking satisfiability such that (1) whenever it terminates, it computes a correct answer, and (2) it always terminates when the input is robust. A formula is robust, if its satisfiability does not change under small perturbations. As a basic tool for our algorithm we use the notion of degree from the field of (differential) topology.

Connected through hyperedge HE-1 (induced by source paper "proving the existence of loops in robot trajectories"):
  with members:
    - "estimating uncertain spatial relationships in robotics"
    - "effective topological degree computation based on interval arithmetic"

Connected through hyperedge HE-2 (induced by source paper "solving equations and optimization problems with uncertainty"):
  with members:
    - "robust satisfiability of systems of equations"
    - "extendability of continuous maps is undecidable"
    - "polynomial time homology for simplicial eilenberg maclane spaces"
    - "effective topological degree computation based on interval arithmetic"
    - "computing all maps into a sphere"
    - "rank profile revealing gaussian elimination and the cup matrix decomposition"
    - "homology and robustness of level and interlevel sets"

Connected through hyperedge HE-3 (induced by source paper "robust satisfiability of systems of equations"):
  with members:
    - "extendability of continuous maps is undecidable"
    - "effective topological degree computation based on interval arithmetic"
    - "polynomial time computation of homotopy groups and postnikov systems in fixed dimension"
    - "quantifying transversality by measuring the robustness of intersections"

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)