human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "univariate contraction and multivariate desingularization of ore ideals"):
  Abstract: Ore operators with polynomial coefficients form a common algebraic abstraction for representing D-finite functions. They form the Ore ring $K(x)[D_x]$, where $K$ is the constant field. Suppose $K$ is the quotient field of some principal ideal domain $R$. The ring $R[x][D_x]$ consists of elements in $K(x)[D_x]$ without "denominator". #R##N#Given $L \in K(x)[D_x]$, it generates a left ideal $I$ in $K(x)[D_x]$. We call $I \cap R[x][D_x]$ the univariate contraction of $I$. #R##N#When $L$ is a linear ordinary differential or difference operator, we design a contraction algorithm for $L$ by using desingularized operators as proposed by Chen, Jaroschek, Kauers and Singer. When $L$ is an ordinary differential operator and $R = K$, our algorithm is more elementary than known algorithms. In other cases, our results are new. #R##N#We propose the notion of completely desingularized operators, study their properties, and design an algorithm for computing them. Completely desingularized operators have interesting applications such as certifying integer sequences and checking special cases of a conjecture of Krattenthaler. #R##N#A D-finite system is a finite set of linear homogeneous partial differential equations in several variables, whose solution space is of finite dimension. For such systems, we give the notion of a singularity in terms of the polynomials appearing in them. We show that a point is a singularity of the system unless it admits a basis of power series solutions in which the starting monomials are as small as possible with respect to some term order. Then a singularity is apparent if the system admits a full basis of power series solutions, the starting terms of which are not as small as possible. We prove that apparent singularities in the multivariate case can be removed like in the univariate case by adding suitable additional solutions to the original system.

Includes members:
  Member "contraction of ore ideals with applications":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "desingularization in the q weyl algebra")
  Member "desingularization of ore operators":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "desingularization in the q weyl algebra")
  Member "a recursive method for determining the one dimensional submodules of laurent ore modules":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the existence of telescopers for mixed hypergeometric terms")

Question: Please tell me which class the source paper 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)