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: "fast computation of power series solutions of systems of differential equations"
  Abstract: We propose new algorithms for the computation of the first N terms of a vector (resp. a basis) of power series solutions of a linear system of differential equations at an ordinary point, using a number of arithmetic operations which is quasi-linear with respect to N. Similar results are also given in the non-linear case. This extends previous results obtained by Brent and Kung for scalar differential equations of order one and two.

Connected through hyperedge HE-1 (induced by source paper "symbolic computations of first integrals for polynomial vector fields"):
  with members:
    - "computing minimal interpolation bases"
    - "efficient algorithms for computing rational first integrals and darboux polynomials of planar polynomial vector fields"

Connected through hyperedge HE-2 (induced by source paper "computational complexity of solving polynomial differential equations over unbounded domains"):
  with members:
    - "on the complexity of solving initial value problems"
    - "lipschitz continuous ordinary differential equations are polynomial space complete"

Connected through hyperedge HE-3 (induced by source paper "a fast algorithm for computing the p curvature"):
  with members:
    - "a fast algorithm for computing the characteristic polynomial of the p curvature"
    - "powers of tensors and fast matrix multiplication"
    - "faster polynomial multiplication over finite fields"
    - "fast algorithms for differential equations in positive characteristic"

Connected through hyperedge HE-4 (induced by source paper "efficient algorithms for computing rational first integrals and darboux polynomials of planar polynomial vector fields"):
  with members:
    - "a recombination algorithm for the decomposition of multivariate rational functions"
    - "differential equations for algebraic functions"

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)