human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "effective coefficient asymptotics of multivariate rational functions via semi numerical algorithms for polynomial systems"):
  Abstract: The coefficient sequences of multivariate rational functions appear in many areas of combinatorics. Their diagonal coefficient sequences enjoy nice arithmetic and asymptotic properties, and the field of analytic combinatorics in several variables (ACSV) makes it possible to compute asymptotic expansions. We consider these methods from the point of view of effectivity. In particular, given a rational function, ACSV requires one to determine a (generically) finite collection of points that are called critical and minimal. Criticality is an algebraic condition, meaning it is well treated by classical methods in computer algebra, while minimality is a semi-algebraic condition describing points on the boundary of the domain of convergence of a multivariate power series. We show how to obtain dominant asymptotics for the diagonal coefficient sequence of multivariate rational functions under some genericity assumptions using symbolic-numeric techniques. To our knowledge, this is the first completely automatic treatment and complexity analysis for the asymptotic enumeration of rational functions in an arbitrary number of variables.

Includes members:
  Member "computing real roots of real polynomials and now for real":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "new progress in univariate polynomial root finding")
  Member "symbolic numeric tools for analytic combinatorics in several variables":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "linear differential equations as a data structure")
  Member "bit complexity for multi homogeneous polynomial system solving application to polynomial minimization":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "real root finding for equivariant semi algebraic systems")
  Member "rigorous multiple precision evaluation of d finite functions in sagemath":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "computing the volume of compact semi algebraic sets")
  Member "multiple binomial sums":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "efficient rational creative telescoping")
  Member "computing periods of rational integrals":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the existence of telescopers for rational functions in three variables")
  Member "on the complexity of computing with planar algebraic curves":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on the complexity of solving zero dimensional polynomial systems via projection")
  Member "ultimate positivity is decidable for simple linear recurrence sequences":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "pumping lemmas for weighted automata")

Question: Please tell me which class the source paper 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)