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: "polynomial time computing over quadratic maps i sampling in real algebraic sets"
  Abstract: Given a quadratic map $$Q:\mathbb{K}^n \to \mathbb{K}^k $$ defined over a computable subring D of a real closed field $$\mathbb{K},$$ and p ?D[Y1,...,Yk] of degree d, we consider the zero set $$Z = Z(p(Q(X)), \mathbb{K}^n) \subseteq \mathbb{K}^n$$ of p(Q(X1,...,Xn)) ?D[X1,...,Xn]. We present a procedure that computes, in (dn)O(k) arithmetic operations in D, a set $$\mathcal{S}$$ of (real univariate representations of) sampling points in $$\mathbb{K}^n$$ that intersects nontrivially each connected component of Z. As soon as k=o(n), this is faster than the known methods that all have exponential dependence on n in the complexity. In particular, our procedure is polynomial-time for constant k. In contrast, the best previously known procedure is only capable of deciding in $$n^{O(k^2 )} $$ operations the nonemptiness (rather than constructing sampling points) of the set Z in the case of p(Y)=?iYi2 and homogeneous Q.#R##N##R##N#A by-product of our procedure is a bound (dn)O(k) on the number of connected components of Z.#R##N##R##N#The procedure consists of exact symbolic computations in D and outputs vectors of algebraic numbers. It involves extending $$\mathbb{K}$$ by infinitesimals and subsequent limit computation by a novel procedure that utilizes knowledge of an explicit isomorphism between real algebraic sets.

Connected through hyperedge HE-1 (induced by source paper "fair dimensionality reduction and iterative rounding for sdps"):
  with members:
    - "fair and diverse dpp based data summarization"
    - "fair clustering through fairlets"
    - "the price of fair pca one extra dimension"
    - "man is to computer programmer as woman is to homemaker debiasing word embeddings"
    - "simultaneous approximation of constraint satisfaction problems"
    - "discrimination in online ad delivery"

Connected through hyperedge HE-2 (induced by source paper "real root finding for equivariant semi algebraic systems"):
  with members:
    - "determinantal sets singularities and application to optimal control in medical imagery"
    - "bit complexity for multi homogeneous polynomial system solving application to polynomial minimization"
    - "real root finding for determinants of linear matrices"
    - "a nearly optimal algorithm for deciding connectivity queries in smooth and bounded real algebraic sets"
    - "intrinsic complexity estimates in polynomial optimization"
    - "probabilistic algorithm for polynomial optimization over a real algebraic set"

Connected through hyperedge HE-3 (induced by source paper "bit complexity for multi homogeneous polynomial system solving application to polynomial minimization"):
  with members:
    - "solving rank constrained semidefinite programs in exact arithmetic"
    - "symbolic numeric tools for analytic combinatorics in several variables"
    - "powers of tensors and fast matrix multiplication"
    - "a nearly optimal algorithm for deciding connectivity queries in smooth and bounded real algebraic sets"
    - "on the complexity of the multivariate resultant"
    - "intrinsic complexity estimates in polynomial optimization"
    - "probabilistic algorithm for polynomial optimization over a real algebraic set"
    - "critical points and gr obner bases the unmixed case"

Connected through hyperedge HE-4 (induced by source paper "complexity bounds for computing critical points with grobner bases algorithms the mixed case"):
  with members:
    - "on the complexity of solving quadratic boolean systems"
    - "a nearly optimal algorithm for deciding connectivity queries in smooth and bounded real algebraic sets"
    - "intrinsic complexity estimates in polynomial optimization"
    - "critical points and gr obner bases the unmixed case"
    - "on the complexity of the generalized minrank problem"

Connected through hyperedge HE-5 (induced by source paper "critical points and gr obner bases the unmixed case"):
  with members:
    - "on the complexity of the generalized minrank problem"

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.SC(Symbolic Computation)