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: "integral d finite functions"
  Abstract: We propose a differential analog of the notion of integral closure of algebraic function fields. We present an algorithm for computing the integral closure of the algebra defined by a linear differential operator. Our algorithm is a direct analog of van Hoeij's algorithm for computing integral bases of algebraic function fields.

Connected through hyperedge HE-1 (induced by source paper "integral p recursive sequences"):
  with members:
    - "computing hypergeometric solutions of second order linear differential equations using quotients of formal solutions and integral bases"
    - "reduction based creative telescoping for algebraic functions"
    - "reduction based creative telescoping for fuchsian d finite functions"

Connected through hyperedge HE-2 (induced by source paper "reduction based creative telescoping for fuchsian d finite functions"):
  with members:
    - "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"
    - "computing periods of rational integrals"
    - "a modified abramov petkovsek reduction and creative telescoping for hypergeometric terms"
    - "a generalized apagodu zeilberger algorithm"
    - "hermite reduction and creative telescoping for hyperexponential functions"

Connected through hyperedge HE-3 (induced by source paper "reduction based creative telescoping for algebraic functions"):
  with members:
    - "new bounds for hypergeometric creative telescoping"
    - "multiple binomial sums"
    - "computing periods of rational integrals"
    - "a modified abramov petkovsek reduction and creative telescoping for hypergeometric terms"
    - "a generalized apagodu zeilberger algorithm"
    - "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"

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)