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: "root isolation of zero dimensional polynomial systems with linear univariate representation"
  Abstract: In this paper, a linear univariate representation for the roots of a zero-dimensional polynomial equation system is presented, where the roots of the equation system are represented as linear combinations of roots of several univariate polynomial equations. The main advantage of this representation is that the precision of the roots can be easily controlled. In fact, based on the linear univariate representation, we can give the exact precisions needed for roots of the univariate equations in order to obtain the roots of the equation system to a given precision. As a consequence, a root isolation algorithm for a zero-dimensional polynomial equation system can be easily derived from its linear univariate representation.

Connected through hyperedge HE-1 (induced by source paper "the complexity of subdivision for diameter distance tests"):
  with members:
    - "complete subdivision algorithms ii isotopic meshing of singular algebraic curves"
    - "when newton meets descartes a simple and fast algorithm to isolate the real roots of a polynomial"
    - "sqfreeeval an almost optimal real root isolation algorithm"

Connected through hyperedge HE-2 (induced by source paper "on the complexity of solving zero dimensional polynomial systems via projection"):
  with members:
    - "a near optimal subdivision algorithm for complex root isolation based on the pellet test and newton iteration"
    - "on the complexity of computing with planar algebraic curves"
    - "powers of tensors and fast matrix multiplication"
    - "from approximate factorization to root isolation with application to cylindrical algebraic decomposition"
    - "on the complexity of solving a bivariate polynomial system"
    - "the dmm bound multivariate aggregate separation bounds"
    - "on the asymptotic and practical complexity of solving bivariate systems over the reals"

Connected through hyperedge HE-3 (induced by source paper "a generic position based method for real root isolation of zero dimensional polynomial systems"):
  with members:
    - "exact symbolic numeric computation of planar algebraic curves"
    - "a worst case bound for topology computation of algebraic curves"
    - "when newton meets descartes a simple and fast algorithm to isolate the real roots of a polynomial"
    - "on the complexity of solving a bivariate polynomial system"
    - "parallel computation of real solving bivariate polynomial systems by zero matching method"
    - "an elimination method for solving bivariate polynomial systems eliminating the usual drawbacks"
    - "on the asymptotic and practical complexity of solving bivariate systems over the reals"

Connected through hyperedge HE-4 (induced by source paper "certified rational parametric approximation of real algebraic space curves with local generic position method"):
  with members:
    - "exact symbolic numeric computation of planar algebraic curves"
    - "complete subdivision algorithms ii isotopic meshing of singular algebraic curves"

Connected through hyperedge HE-5 (induced by source paper "real root isolation of polynomial equations based on hybrid computation"):
  with members:
    - "the dmm bound multivariate aggregate separation bounds"

Connected through hyperedge HE-6 (induced by source paper "real root refinements for univariate polynomial equations"):
  with members:
    - "univariate polynomial real root isolation continued fractions revisited"

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)