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: "symbolic numeric tools for analytic combinatorics in several variables"
  Abstract: Analytic combinatorics studies the asymptotic behavior of sequences through the analytic properties of their generating functions. This article provides effective algorithms required for the study of analytic combinatorics in several variables, together with their complexity analyses. Given a multivariate rational function we show how to compute its smooth isolated critical points, with respect to a polynomial map encoding asymptotic behaviour, in complexity singly exponential in the degree of its denominator. We introduce a numerical Kronecker representation for solutions of polynomial systems with rational coefficients and show that it can be used to decide several properties (0 coordinate, equal coordinates, sign conditions for real solutions, and vanishing of a polynomial) in good bit complexity. Among the critical points, those that are minimal---a property governed by inequalities on the moduli of the coordinates---typically determine the dominant asymptotics of the diagonal coefficient sequence. When the Taylor expansion at the origin has all non-negative coefficients (known as the 'combinatorial case') and under regularity conditions, we utilize this Kronecker representation to determine probabilistically the minimal critical points in complexity singly exponential in the degree of the denominator, with good control over the exponent in the bit complexity estimate. Generically in the combinatorial case, this allows one to automatically and rigorously determine asymptotics for the diagonal coefficient sequence. Examples obtained with a preliminary implementation show the wide applicability of this approach.

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"
    - "bit complexity for multi homogeneous polynomial system solving application to polynomial minimization"
    - "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 "linear differential equations as a data structure"):
  with members:
    - "computing the volume of compact semi algebraic sets"
    - "generalized hermite reduction creative telescoping and definite integration of d finite functions"
    - "efficient algorithms for mixed creative telscoping"
    - "reduction based creative telescoping for algebraic functions"
    - "reduction based creative telescoping for fuchsian d finite functions"
    - "new bounds for hypergeometric creative telescoping"
    - "multiple binomial sums"
    - "formulas for continued fractions an automated guess and prove approach"

Connected through hyperedge HE-3 (induced by source paper "algorithms for weighted sums of squares decomposition of non negative univariate polynomials"):
  with members:
    - "formal proofs for nonlinear optimization"
    - "probabilistic algorithm for polynomial optimization over a real algebraic set"
    - "from approximate factorization to root isolation with application to cylindrical algebraic decomposition"
    - "univariate real root isolation in an extension field"

Connected through hyperedge HE-4 (induced by source paper "bit complexity for multi homogeneous polynomial system solving application to polynomial minimization"):
  with members:
    - "solving rank constrained semidefinite programs in exact arithmetic"
    - "powers of tensors and fast matrix multiplication"
    - "a nearly optimal algorithm for deciding connectivity queries in smooth and bounded real algebraic sets"
    - "on the complexity of the multivariate resultant"
    - "intrinsic complexity estimates in polynomial optimization"
    - "probabilistic algorithm for polynomial optimization over a real algebraic set"
    - "critical points and gr obner bases the unmixed case"
    - "multihomogeneous resultant formulae for systems with scaled support"

Connected through hyperedge HE-5 (induced by source paper "multiple binomial sums"):
  with members:
    - "computing periods of rational integrals"
    - "creative telescoping for rational functions using the griffiths dwork method"
    - "creative telescoping for holonomic functions"
    - "a fast approach to creative telescoping"
    - "effective bounds for p recursive sequences"

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)