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 "on the length of integers in telescopers for proper hypergeometric terms"):
  Abstract: We show that the number of digits in the integers of a creative telescoping relation of expected minimal order for a bivariate proper hypergeometric term has essentially cubic growth with the problem size. For telescopers of higher order but lower degree we obtain a quintic bound. Experiments suggest that these bounds are tight. As applications of our results, we give an improved bound on the maximal possible integer root of the leading coefficient of a telescoper, and the first discussion of the bit complexity of creative telescoping.

Includes members:
  Member "simplifying multiple sums in difference fields":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a refined machinery to calculate large moments from coupled systems of linear differential equations")
  Member "complexity of creative telescoping for bivariate rational functions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "an additive decomposition in s primitive towers")
  Member "creative telescoping for holonomic functions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "minimal representations and algebraic relations for single nested products")
  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)