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: "robust satisfiability of systems of equations"
  Abstract: We study the problem of \emph{robust satisfiability} of systems of nonlinear equations, namely, whether for a given continuous function $f:\,K\to\mathbb{R}^n$ on a~finite simplicial complex $K$ and $\alpha>0$, it holds that each function $g:\,K\to\mathbb{R}^n$ such that $\|g-f\|_\infty \leq \alpha$, has a root in $K$. Via a reduction to the extension problem of maps into a sphere, we particularly show that this problem is decidable in polynomial time for every fixed $n$, assuming $\dim K \le 2n-3$. This is a substantial extension of previous computational applications of \emph{topological degree} and related concepts in numerical and interval analysis. Via a reverse reduction we prove that the problem is undecidable when $\dim K\ge 2n-2$, where the threshold comes from the \emph{stable range} in homotopy theory. For the lucidity of our exposition, we focus on the setting when $f$ is piecewise linear. Such functions can approximate general continuous functions, and thus we get approximation schemes and undecidability of the robust satisfiability in other possible settings.

Connected through hyperedge HE-1 (induced by source paper "solving equations and optimization problems with uncertainty"):
  with members:
    - "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"
    - "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 "quasi decidability of a fragment of the first order theory of real numbers"):
  with members:
    - "extendability of continuous maps is undecidable"
    - "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-3 (induced by source paper "computing all maps into a sphere"):
  with members:
    - "computing higher homotopy groups is w 1 hard"
    - "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.CC(Computational Complexity)