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 structure of compatible rational functions"
  Abstract: A finite number of rational functions are compatible if they satisfy the compatibility conditions of a first-order linear functional system involving differential, shift and q-shift operators. We present a theorem that describes the structure of compatible rational functions. The theorem enables us to decompose a solution of such a system as a product of a rational function, several symbolic powers, a hyperexponential function, a hypergeometric term, and a q-hypergeometric term. We outline an algorithm for computing this product, and present an application.

Connected through hyperedge HE-1 (induced by source paper "minimal representations and algebraic relations for single nested products"):
  with members:
    - "a difference ring theory for symbolic summation"
    - "creative telescoping for holonomic functions"
    - "fast algorithms for refined parameterized telescoping in difference fields"
    - "fast computation of smith forms of sparse matrices over local rings"
    - "order degree curves for hypergeometric creative telescoping"
    - "a symbolic summation approach to find optimal nested sum representations"
    - "parameterized telescoping proves algebraic independence of sums"
    - "a refined difference field theory for symbolic summation"

Connected through hyperedge HE-2 (induced by source paper "an effective framework for constructing exponent lattice basis of nonzero algebraic numbers"):
  with members:
    - "effective divergence analysis for linear recurrence sequences"

Connected through hyperedge HE-3 (induced by source paper "representing q hypergeometric products and mixed versions in difference rings"):
  with members:
    - "summation theory ii characterizations of boldsymbol r pi sigma extensions and algorithmic aspects"
    - "a difference ring theory for symbolic summation"
    - "a streamlined difference ring theory indefinite nested sums the alternating sign and the parameterized telescoping problem"
    - "fast algorithms for refined parameterized telescoping in difference fields"
    - "parameterized telescoping proves algebraic independence of sums"
    - "a refined difference field theory for symbolic summation"

Connected through hyperedge HE-4 (induced by source paper "on the existence of telescopers for mixed hypergeometric terms"):
  with members:
    - "hermite reduction and creative telescoping for hyperexponential functions"
    - "telescopers for rational and algebraic functions via residues"
    - "a non holonomic systems approach to special function identities"
    - "parameterized telescoping proves algebraic independence of sums"
    - "a recursive method for determining the one dimensional submodules of laurent ore modules"

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)