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 "bounded degree factors of lacunary multivariate polynomials"):
  Abstract: In this paper, we present a new method for computing bounded-degree factors of lacunary multivariate polynomials. In particular for polynomials over number fields, we give a new algorithm that takes as input a multivariate polynomial f in lacunary representation and a degree bound d and computes the irreducible factors of degree at most d of f in time polynomial in the lacunary size of f and in d. Our algorithm, which is valid for any field of zero characteristic, is based on a new gap theorem that enables reducing the problem to several instances of (a) the univariate case and (b) low-degree multivariate factorization.The reduction algorithms we propose are elementary in that they only manipulate the exponent vectors of the input polynomial. The proof of correctness and the complexity bounds rely on the Newton polytope of the polynomial, where the underlying valued field consists of Puiseux series in a single variable.

Includes members:
  Member "lacunaryx computing bounded degree factors of lacunary polynomials":
    also connected through other hyperedges:
      (none)
  Member "a near optimal algorithm for computing real roots of sparse polynomials":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "efficiently computing real roots of sparse polynomials")
  Member "computing low degree factors of lacunary polynomials a newton puiseux approach":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "lacunaryx computing bounded degree factors of lacunary polynomials")
  Member "even faster integer multiplication":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the i o complexity of hybrid algorithms for integer multiplication")
  Member "factoring bivariate lacunary polynomials without heights":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "what can and can t we do with sparse polynomials")
  Member "computing the multilinear factors of lacunary polynomials without heights":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "what can and can t we do with sparse polynomials")
  Member "on the intersection of a sparse curve and a low degree curve a polynomial version of the lost theorem":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "computing low degree factors of lacunary polynomials a newton puiseux approach")
  Member "differential equations for algebraic functions":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "linear differential equations as a data structure")

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)