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 "linear differential equations as a data structure"):
  Abstract: A lot of information concerning solutions of linear differential equations can be computed directly from the equation. It is therefore natural to consider these equations as a data-structure, from which mathematical properties can be computed. A variety of algorithms has thus been designed in recent years that do not aim at "solving", but at computing with this representation. Many of these results are surveyed here.

Includes members:
  Member "computing the volume of compact semi algebraic sets":
    also connected through other hyperedges:
      (none)
  Member "generalized hermite reduction creative telescoping and definite integration of d finite functions":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "efficient rational creative telescoping")
  Member "efficient algorithms for mixed creative telscoping":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "generalized hermite reduction creative telescoping and definite integration of d finite functions")
  Member "symbolic numeric tools for analytic combinatorics in several variables":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "effective coefficient asymptotics of multivariate rational functions via semi numerical algorithms for polynomial systems")
  Member "reduction based creative telescoping for algebraic functions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "an additive decomposition in s primitive towers")
  Member "reduction based creative telescoping for fuchsian d finite functions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "integral p recursive sequences")
  Member "new bounds for hypergeometric creative telescoping":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "efficient rational creative telescoping")
  Member "multiple binomial sums":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "efficient rational creative telescoping")

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)