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: "effective topological degree computation based on interval arithmetic"
  Abstract: We describe a new algorithm for calculating the topological degree deg (f, B, 0) where B \subseteq Rn is a product of closed real intervals and f : B \rightarrow Rn is a real-valued continuous function given in the form of arithmetical expressions. The algorithm cleanly separates numerical from combinatorial computation. Based on this, the numerical part provably computes only the information that is strictly necessary for the following combinatorial part, and the combinatorial part may optimize its computation based on the numerical information computed before. We also present computational experiments based on an implementation of the algorithm. Also, in contrast to previous work, the algorithm does not assume knowledge of a Lipschitz constant of the function f, and works for arbitrary continuous functions for which some notion of interval arithmetic can be defined.

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"
    - "quasi decidability of a fragment of the first order theory of real numbers"

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"
    - "quasi decidability of a fragment of the first order theory of real numbers"
    - "polynomial time homology for simplicial eilenberg maclane spaces"
    - "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"
    - "quasi decidability of a fragment of the first order theory of real numbers"
    - "polynomial time computation of homotopy groups and postnikov systems in fixed dimension"
    - "quantifying transversality by measuring the robustness of intersections"

Connected through hyperedge HE-4 (induced by source paper "quasi decidability of a fragment of the first order theory of real numbers"):
  with members:
    - "robust satisfiability of systems of equations"
    - "extendability of continuous maps is undecidable"
    - "delta decidability over the reals"
    - "delta complete decision procedures for satisfiability over the reals"
    - "polynomial time computation of homotopy groups and postnikov systems in fixed dimension"
    - "quantifying transversality by measuring the robustness of intersections"
    - "efficient solving of quantified inequality constraints over the real numbers"
    - "convergent approximate solving of first order constraints by approximate quantifiers"

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.CG(Computational Geometry)