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: "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.

Connected through hyperedge HE-1 (induced by source paper "some open problems related to creative telescoping"):
  with members:
    - "efficient algorithms for mixed creative telscoping"
    - "existence problem of telescopers beyond the bivariate case"
    - "computing hypergeometric solutions of second order linear differential equations using quotients of formal solutions and integral bases"
    - "reduction based creative telescoping for algebraic functions"
    - "new bounds for hypergeometric creative telescoping"
    - "multiple binomial sums"
    - "a modified abramov petkovsek reduction and creative telescoping for hypergeometric terms"
    - "an algorithm for deciding the summability of bivariate rational functions"

Connected through hyperedge HE-2 (induced by source paper "efficient algorithms for mixed creative telscoping"):
  with members:
    - "computing periods of rational integrals"
    - "a modified abramov petkovsek reduction and creative telescoping for hypergeometric terms"
    - "hermite reduction and creative telescoping for hyperexponential functions"
    - "creative telescoping for rational functions using the griffiths dwork method"
    - "complexity of creative telescoping for bivariate rational functions"
    - "creative telescoping for holonomic functions"
    - "order degree curves for hypergeometric creative telescoping"
    - "on the existence of telescopers for mixed hypergeometric terms"

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

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)