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: "differential equations for algebraic functions"
  Abstract: It is classical that univariate algebraic functions satisfy linear differential equations with polynomial coefficients. Linear recurrences follow for the coefficients of their power series expansions. We show that the linear differential equation of minimal order has coefficients whose degree is cubic in the degree of the function. We also show that there exists a linear differential equation of order linear in the degree whose coefficients are only of quadratic degree. Furthermore, we prove the existence of recurrences of order and degree close to optimal. We study the complexity of computing these differential equations and recurrences. We deduce a fast algorithm for the expansion of algebraic series.

Connected through hyperedge HE-1 (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"
    - "symbolic numeric tools for analytic combinatorics in several variables"
    - "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"

Connected through hyperedge HE-2 (induced by source paper "bounds for substituting algebraic functions into d finite functions"):
  with members:
    - "bounds for d finite closure properties"
    - "desingularization of ore operators"
    - "desingularization explains order degree curves for ore operators"
    - "order degree curves for hypergeometric creative telescoping"
    - "trading order for degree in creative telescoping"

Connected through hyperedge HE-3 (induced by source paper "bounds for d finite substitution"):
  with members:
    - "desingularization explains order degree curves for ore operators"
    - "order degree curves for hypergeometric creative telescoping"
    - "trading order for degree in creative telescoping"

Connected through hyperedge HE-4 (induced by source paper "bounded degree factors of lacunary multivariate polynomials"):
  with members:
    - "lacunaryx computing bounded degree factors of lacunary polynomials"
    - "a near optimal algorithm for computing real roots of sparse polynomials"
    - "computing low degree factors of lacunary polynomials a newton puiseux approach"
    - "even faster integer multiplication"
    - "factoring bivariate lacunary polynomials without heights"
    - "computing the multilinear factors of lacunary polynomials without heights"
    - "on the intersection of a sparse curve and a low degree curve a polynomial version of the lost theorem"

Connected through hyperedge HE-5 (induced by source paper "fast computation of the nth term of an algebraic series over a finite prime field"):
  with members:
    - "powers of tensors and fast matrix multiplication"
    - "faster polynomial multiplication over finite fields"

Connected through hyperedge HE-6 (induced by source paper "algebraic diagonals and walks algorithms bounds complexity"):
  with members:
    - "computing periods of rational integrals"
    - "algebraic diagonals and walks"
    - "creative telescoping for rational functions using the griffiths dwork method"
    - "complexity of creative telescoping for bivariate rational functions"

Connected through hyperedge HE-7 (induced by source paper "algebraic diagonals and walks"):
  with members:
    - "computing periods of rational integrals"
    - "creative telescoping for rational functions using the griffiths dwork method"
    - "complexity of creative telescoping for bivariate rational functions"

Connected through hyperedge HE-8 (induced by source paper "creative telescoping for holonomic functions"):
  with members:
    - "hermite reduction and creative telescoping for hyperexponential functions"
    - "simplifying multiple sums in difference fields"
    - "advanced computer algebra for determinants"
    - "creative telescoping for rational functions using the griffiths dwork method"
    - "complexity of creative telescoping for bivariate rational functions"
    - "order degree curves for hypergeometric creative telescoping"
    - "telescopers for rational and algebraic functions via residues"
    - "on the existence of telescopers for mixed hypergeometric terms"

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)