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: "bivariate extensions of abramov s algorithm for rational summation"
  Abstract: Abramov's algorithm enables us to decide whether a univariate rational function can be written as a difference of another rational function, which has been a fundamental algorithm for rational summation. In 2014, Chen and Singer generalized Abramov's algorithm to the case of rational functions in two ($q$-)discrete variables. In this paper we solve the remaining three mixed cases, which completes our recent project on bivariate extensions of Abramov's algorithm for rational summation.

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"
    - "existence problem of telescopers for rational functions in three variables the mixed cases"
    - "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"

Connected through hyperedge HE-2 (induced by source paper "existence problem of telescopers for rational functions in three variables the mixed cases"):
  with members:
    - "existence problem of telescopers beyond the bivariate case"
    - "an algorithm for deciding the summability of bivariate rational functions"
    - "parallel telescoping and parameterized picard vessiot theory"
    - "testing equivalence of polynomials under shifts"
    - "telescopers for rational and algebraic functions via residues"
    - "on the existence of telescopers for mixed hypergeometric terms"
    - "a non holonomic systems approach to special function identities"
    - "parameterized telescoping proves algebraic independence of sums"

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)