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: "bit complexity for multi homogeneous polynomial system solving application to polynomial minimization"
  Abstract: Multi-homogeneous polynomial systems arise in many applications. We provide bit complexity estimates for solving them which, up to a few extra other factors, are quadratic in the number of solutions and linear in the height of the input system under some genericity assumptions. The assumptions essentially imply that the Jacobian matrix of the system under study has maximal rank at the solution set and that this solution set if finite. The algorithm is probabilistic and a probability analysis is provided. Next, we apply these results to the problem of optimizing a linear map on the real trace of an algebraic set. Under some genericity assumptions, we provide bit complexity estimates for solving this polynomial minimization problem.

Connected through hyperedge HE-1 (induced by source paper "effective coefficient asymptotics of multivariate rational functions via semi numerical algorithms for polynomial systems"):
  with members:
    - "computing real roots of real polynomials and now for real"
    - "symbolic numeric tools for analytic combinatorics in several variables"
    - "rigorous multiple precision evaluation of d finite functions in sagemath"
    - "multiple binomial sums"
    - "computing periods of rational integrals"
    - "on the complexity of computing with planar algebraic curves"
    - "ultimate positivity is decidable for simple linear recurrence sequences"
    - "creative telescoping for rational functions using the griffiths dwork method"

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"
    - "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"
    - "polynomial time computing over quadratic maps i sampling in real algebraic sets"

Connected through hyperedge HE-3 (induced by source paper "exact algorithms for semidefinite programs with degenerate feasible set"):
  with members:
    - "solving rank constrained semidefinite programs in exact arithmetic"
    - "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"

Connected through hyperedge HE-4 (induced by source paper "towards mixed grobner basis algorithms the multihomogeneous and sparse case"):
  with members:
    - "bilinear systems with two supports koszul resultant matrices eigenvalues and eigenvectors"
    - "sparse grobner bases the unmixed case"

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"
    - "real root finding for rank defects in linear hankel matrices"
    - "real root finding for determinants of linear 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"

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)