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: "existence problem of telescopers for rational functions in three variables the mixed cases"
  Abstract: We present criteria on the existence of telescopers for trivariate rational functions in four mixed cases, in which discrete and continuous variables appear simultaneously. We reduce the existence problem in the trivariate case to the exactness testing problem, the separation problem and the existence problem in the bivariate case. The existence criteria we present help us determine the termination of Zeilberger's algorithm for the input functions studied in this paper.

Connected through hyperedge HE-1 (induced by source paper "on the existence of telescopers for rational functions in three variables"):
  with members:
    - "constructing minimal telescopers for rational functions in three discrete variables"
    - "bivariate extensions of abramov s algorithm for rational summation"
    - "existence problem of telescopers beyond the bivariate case"
    - "some open problems related to creative telescoping"
    - "computing periods of rational integrals"
    - "an algorithm for deciding the summability of bivariate rational functions"
    - "testing equivalence of polynomials under shifts"
    - "creative telescoping for rational functions using the griffiths dwork method"

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)