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 "bounds for d finite closure properties"):
  Abstract: We provide bounds on the size of operators obtained by algorithms for executing D-finite closure properties. For operators of small order, we give bounds on the degree and on the height (bit-size). For higher order operators, we give degree bounds that are parameterized with respect to the order and reflect the phenomenon that higher order operators may have lower degrees (order-degree curves).

Includes members:
  Member "complexity of creative telescoping for bivariate rational functions":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "an additive decomposition in s primitive towers")
  Member "desingularization explains order degree curves for ore operators":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "linear differential equations as a data structure")
  Member "on the length of integers in telescopers for proper hypergeometric terms":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "some open problems related to creative telescoping")
  Member "order degree curves for hypergeometric creative telescoping":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "efficient rational creative telescoping")
  Member "trading order for degree in creative telescoping":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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)