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: "extendability of continuous maps is undecidable"
  Abstract: We consider two basic problems of algebraic topology, the extension problem and the computation of higher homotopy groups, from the point of view of computability and computational complexity. The extension problem is the following: Given topological spaces X and Y, a subspace A\subseteq X, and a (continuous) map f:A->Y, decide whether f can be extended to a continuous map \bar{f}:X->Y. All spaces are given as finite simplicial complexes and the map f is simplicial. Recent positive algorithmic results, proved in a series of companion papers, show that for (k-1)-connected Y, k>=2, the extension problem is algorithmically solvable if the dimension of X is at most 2k-1, and even in polynomial time when k is fixed. Here we show that the condition \dim X<=2k-1 cannot be relaxed: for \dim X=2k, the extension problem with (k-1)-connected Y becomes undecidable. Moreover, either the target space Y or the pair (X,A) can be fixed in such a way that the problem remains undecidable. Our second result, a strengthening of a result of Anick, says that the computation of \pi_k(Y) of a 1-connected simplicial complex Y is #P-hard when k is considered as a part of the input.

Connected through hyperedge HE-1 (induced by source paper "solving equations and optimization problems with uncertainty"):
  with members:
    - "robust satisfiability of systems of equations"
    - "quasi decidability of a fragment of the first order theory of real numbers"
    - "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-2 (induced by source paper "robust satisfiability of systems of equations"):
  with members:
    - "quasi decidability of a fragment of the first order theory of real numbers"
    - "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"

Connected through hyperedge HE-3 (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"
    - "delta decidability over the reals"
    - "effective topological degree computation based on interval arithmetic"
    - "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"

Connected through hyperedge HE-4 (induced by source paper "computing higher homotopy groups is w 1 hard"):
  with members:
    - "polynomial time computation of homotopy groups and postnikov systems in fixed dimension"

Connected through hyperedge HE-5 (induced by source paper "polynomial time computation of homotopy groups and postnikov systems in fixed dimension"):
  with members:
    - "computing higher homotopy groups is w 1 hard"
    - "polynomial time homology for simplicial eilenberg maclane spaces"
    - "computing all maps into a sphere"
    - "complexity and algorithms for euler characteristic of simplicial complexes"
    - "computing spectral sequences"

Connected through hyperedge HE-6 (induced by source paper "polynomial time homology for simplicial eilenberg maclane spaces"):
  with members:
    - "polynomial time computation of homotopy groups and postnikov systems in fixed dimension"
    - "computing all maps into a sphere"
    - "computing spectral sequences"

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)