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 "what can and can t we do with sparse polynomials"):
  Abstract: Simply put, a sparse polynomial is one whose zero coefficients are not explicitly stored. Such objects are ubiquitous in exact computing, and so naturally we would like to have efficient algorithms to handle them. However, with this compact storage comes new algorithmic challenges, as fast algorithms for dense polynomials may no longer be efficient. In this tutorial we examine the state of the art for sparse polynomial algorithms in three areas: arithmetic, interpolation, and factorization. The aim is to highlight recent progress both in theory and in practice, as well as opportunities for future work.

Includes members:
  Member "bounded degree factors of lacunary multivariate polynomials":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "lacunaryx computing bounded degree factors of lacunary polynomials")
  Member "output sensitive algorithms for sumset and sparse polynomial multiplication":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "essentially optimal sparse polynomial multiplication")
  Member "parallel sparse interpolation using small primes":
    also connected through other hyperedges:
      (none)
  Member "sparse interpolation over finite fields via low order roots of unity":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "sparse interpolation in terms of multivariate chebyshev polynomials")
  Member "faster sparse multivariate polynomial interpolation of straight line programs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "sparse polynomial interpolation based on diversification")
  Member "faster polynomial multiplication over finite fields":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "generic reductions for in place polynomial multiplication")
  Member "multivariate sparse interpolation using randomized kronecker substitutions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "essentially optimal sparse polynomial multiplication")
  Member "faster sparse interpolation of straight line programs":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "sparse polynomial interpolation based on diversification")

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)