human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "solving equations and optimization problems with uncertainty"):
  Abstract: We study the problem of detecting zeros of continuous functions that are known only up to an error bound, extending the earlier theoretical work with explicit algorithms and experiments with an implementation. More formally, the robustness of zero of a continuous map $f: X\to \mathbb{R}^n$ is the maximal $r>0$ such that each $g:X\to\mathbb{R}^n$ with $\|f-g\|_\infty\le r$ has a zero. We develop and implement an efficient algorithm approximating the robustness of zero. Further, we show how to use the algorithm for approximating worst-case optima in optimization problems in which the feasible domain is defined by equations that are only known approximately. #R##N#An important ingredient is an algorithm for deciding the topological extension problem based on computing cohomological obstructions to extendability and their persistence. We describe an explicit algorithm for the primary and secondary obstruction, two stages of a sequence of algorithms with increasing complexity. We provide experimental evidence that for random Gaussian fields, the primary obstruction---a much less computationally demanding test than the secondary obstruction---is typically sufficient for approximating robustness of zero.

Includes members:
  Member "robust satisfiability of systems of equations":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "quasi decidability of a fragment of the first order theory of real numbers")
  Member "extendability of continuous maps is undecidable":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "robust satisfiability of systems of equations")
  Member "quasi decidability of a fragment of the first order theory of real numbers":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "proving the existence of loops in robot trajectories")
  Member "polynomial time homology for simplicial eilenberg maclane spaces":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "extendability of continuous maps is undecidable")
  Member "effective topological degree computation based on interval arithmetic":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "proving the existence of loops in robot trajectories")
  Member "computing all maps into a sphere":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "computing simplicial representatives of homotopy group elements")
  Member "rank profile revealing gaussian elimination and the cup matrix decomposition":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "elimination based certificates for triangular equivalence and rank profiles")
  Member "homology and robustness of level and interlevel sets":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "the persistent homotopy type distance")

Question: Please tell me which class the source paper 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)