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: "computing all maps into a sphere"
  Abstract: Given topological spaces X and Y, a fundamental problem of algebraic topology is understanding the structure of all continuous maps X -> Y . We consider a computational version, where X, Y are given as finite simplicial complexes, and the goal is to compute [X,Y], i.e., all homotopy classes of such maps. We solve this problem in the stable range, where for some d >= 2, we have dim X   Y and ask whether it extends to a map X -> Y, or computing the Z_2-index---everything in the stable range. Outside the stable range, the extension problem is undecidable.

Connected through hyperedge HE-1 (induced by source paper "computing simplicial representatives of homotopy group elements"):
  with members:
    - "computing higher homotopy groups is w 1 hard"
    - "computing spectral sequences"

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"
    - "effective topological degree computation based on interval arithmetic"
    - "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 "extendability of continuous maps is undecidable"):
  with members:
    - "polynomial time homology for simplicial eilenberg maclane spaces"
    - "polynomial time computation of homotopy groups and postnikov systems in fixed dimension"
    - "computing spectral sequences"

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

Connected through hyperedge HE-5 (induced by source paper "polynomial time homology for simplicial eilenberg maclane spaces"):
  with members:
    - "extendability of continuous maps is undecidable"
    - "polynomial time computation of homotopy groups and postnikov systems in fixed dimension"
    - "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)