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 low rank linear matrices"
  Abstract: The problem of finding $m \times s$ matrices (with $m \ge s$) of rank $r$ in a real affine subspace of dimension n has many applications in information and systems theory, where low rank is synonymous of structure and parsimony. We design computer algebra algorithms to solve this problem efficiently and exactly: the input are the rational coefficients of the matrices spanning the affine subspace as well as the expected maximum rank, and the output is a rational parametrization encoding a finite set of points that intersects each connected component of the low rank real algebraic set. The complexity of our algorithm is studied thoroughly. It is essentially polynomial in $n+m(s-r)$ ; it improves on the state-of-the-art in the field. Moreover, computer experiments show the practical efficiency of our approach.

Connected through hyperedge HE-1 (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 rank defects in linear hankel matrices"
    - "real root finding for determinants of linear matrices"
    - "critical points and gr obner bases the unmixed case"
    - "on the complexity of the generalized minrank problem"

Connected through hyperedge HE-2 (induced by source paper "solving rank constrained semidefinite programs in exact arithmetic"):
  with members:
    - "real root finding for rank defects in linear hankel matrices"
    - "real root finding for determinants of 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"

Connected through hyperedge HE-3 (induced by source paper "real root finding for rank defects in linear hankel matrices"):
  with members:
    - "real root finding for determinants of 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)