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: "real root finding for determinants of linear matrices"
  Abstract: Let $\A_0, \A_1, \ldots, \A_n$ be given square matrices of size $m$ with rational coefficients. The paper focuses on the exact computation of one point in each connected component of the real determinantal variety $\{\X \in\RR^n \: :\: \det(\A_0+x_1\A_1+\cdots+x_n\A_n)=0\}$. Such a problem finds applications in many areas such as control theory, computational geometry, optimization, etc. Using standard complexity results this problem can be solved using $m^{O(n)}$ arithmetic operations. Under some genericity assumptions on the coefficients of the matrices, we provide an algorithm solving this problem whose runtime is essentially quadratic in ${{n+m}\choose{n}}^{3}$. We also report on experiments with a computer implementation of this algorithm. Its practical performance illustrates the complexity estimates. In particular, we emphasize that for subfamilies of this problem where $m$ is fixed, the complexity is polynomial in $n$.

Connected through hyperedge HE-1 (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"
    - "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"
    - "polynomial time computing over quadratic maps i sampling in real algebraic sets"

Connected through hyperedge HE-2 (induced by source paper "exact algorithms for semidefinite programs with degenerate feasible set"):
  with members:
    - "solving rank constrained semidefinite programs in exact arithmetic"
    - "bit complexity for multi homogeneous polynomial system solving application to polynomial minimization"
    - "a nearly optimal algorithm for deciding connectivity queries in smooth and bounded real algebraic sets"
    - "intrinsic complexity estimates in polynomial optimization"

Connected through hyperedge HE-3 (induced by source paper "determinantal sets singularities and application to optimal control in medical imagery"):
  with members:
    - "data discriminants of likelihood equations"
    - "real root finding for low rank linear matrices"
    - "real root finding for rank defects in linear hankel matrices"
    - "critical points and gr obner bases the unmixed case"
    - "on the complexity of the generalized minrank problem"

Connected through hyperedge HE-4 (induced by source paper "solving rank constrained semidefinite programs in exact arithmetic"):
  with members:
    - "real root finding for low rank linear matrices"
    - "real root finding for rank defects in linear hankel matrices"
    - "a nearly optimal algorithm for deciding connectivity queries in smooth and bounded real algebraic sets"
    - "probabilistic algorithm for polynomial optimization over a real algebraic set"

Connected through hyperedge HE-5 (induced by source paper "real root finding for low rank linear matrices"):
  with members:
    - "sparse fglm algorithms"
    - "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 rank defects in linear hankel matrices"
    - "polynomial systems solving by fast linear algebra"
    - "a nearly optimal algorithm for deciding connectivity queries in smooth and bounded real algebraic sets"
    - "probabilistic algorithm for polynomial optimization over a real algebraic set"
    - "critical points and gr obner bases the unmixed case"

Connected through hyperedge HE-6 (induced by source paper "real root finding for rank defects in linear hankel matrices"):
  with members:
    - "real root finding for low rank linear matrices"
    - "a nearly optimal algorithm for deciding connectivity queries in smooth and bounded real algebraic sets"
    - "probabilistic algorithm for polynomial optimization over a real algebraic set"
    - "critical points and gr obner bases the unmixed case"

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)