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: "rational univariate representations of bivariate systems and applications"
  Abstract: We address the problem of solving systems of two bivariate polynomials of total degree at most $d$ with integer coefficients of maximum bitsize $\tau$. It is known that a linear separating form, that is a linear combination of the variables that takes different values at distinct solutions of the system, can be computed in $\sOB(d^{8}+d^7\tau)$ bit operations (where $O_B$ refers to bit complexities and $\sO$ to complexities where polylogarithmic factors are omitted) and we focus here on the computation of a Rational Univariate Representation (RUR) given a linear separating form. We present an algorithm for computing a RUR with worst-case bit complexity in $\sOB(d^7+d^6\tau)$ and bound the bitsize of its coefficients by $\sO(d^2+d\tau)$. We show in addition that isolating boxes of the solutions of the system can be computed from the RUR with $\sOB(d^{8}+d^7\tau)$ bit operations. Finally, we show how a RUR can be used to evaluate the sign of a bivariate polynomial (of degree at most $d$ and bitsize at most $\tau$) at one real solution of the system in $\sOB(d^{8}+d^7\tau)$ bit operations and at all the $\Theta(d^2)$ {real} solutions in only $O(d)$ times that for one solution.

Connected through hyperedge HE-1 (induced by source paper "on the complexity of computing the topology of real algebraic space curves"):
  with members:
    - "a generic position based method for real root isolation of zero dimensional polynomial systems"
    - "arrangement computation for planar 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"
    - "on the asymptotic and practical complexity of solving bivariate systems over the reals"

Connected through hyperedge HE-2 (induced by source paper "a fast algorithm for computing the truncated resultant"):
  with members:
    - "on the complexity of computing with planar algebraic curves"
    - "numeric certified algorithm for the topology of resultant and discriminant curves"
    - "improved algorithm for computing separating linear forms for bivariate systems"
    - "separating linear forms for bivariate systems"
    - "on the complexity of solving a bivariate polynomial system"
    - "an elimination method for solving bivariate polynomial systems eliminating the usual drawbacks"

Connected through hyperedge HE-3 (induced by source paper "on the complexity of computing with planar algebraic curves"):
  with members:
    - "improved algorithm for computing separating linear forms for bivariate systems"
    - "fast approximate polynomial multipoint evaluation and applications"
    - "a generic position based method for real root isolation of zero dimensional polynomial systems"
    - "from approximate factorization to root isolation with application to cylindrical algebraic decomposition"
    - "separating linear forms for bivariate systems"
    - "exact symbolic numeric computation of planar algebraic curves"
    - "a worst case bound for topology computation of algebraic curves"
    - "complete subdivision algorithms ii isotopic meshing of singular algebraic curves"

Connected through hyperedge HE-4 (induced by source paper "a near optimal algorithm for computing real roots of sparse polynomials"):
  with members:
    - "from approximate factorization to root isolation with application to cylindrical algebraic decomposition"
    - "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"
    - "sqfreeeval an almost optimal real root isolation algorithm"
    - "the dmm bound multivariate aggregate separation bounds"

Connected through hyperedge HE-5 (induced by source paper "from approximate factorization to root isolation with application to cylindrical algebraic decomposition"):
  with members:
    - "solving bivariate systems efficient worst case algorithm for computing rational univariate representations and applications"
    - "separating linear forms for bivariate systems"
    - "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"
    - "sqfreeeval an almost optimal real root isolation algorithm"
    - "univariate real root isolation in an extension field"

Connected through hyperedge HE-6 (induced by source paper "separating linear forms for bivariate systems"):
  with members:
    - "solving bivariate systems efficient worst case algorithm for computing rational univariate representations and applications"
    - "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"
    - "on the asymptotic and practical complexity of solving bivariate systems over the reals"

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)