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 "essentially optimal sparse polynomial multiplication"):
  Abstract: In this article, we present a probabilistic algorithm to compute the product of two univariate sparse polynomials over a field with a number of bit operations that is quasi-linear in the size of the input and the output. Our algorithm works for any field of characteristic zero or larger than the degree. We mainly rely on sparse interpolation and on a new algorithm for verifying a sparse product that has also a quasi-linear time complexity. Using Kronecker substitution techniques we are able to extend our result to the multivariate case.

Includes members:
  Member "nearly optimal sparse polynomial multiplication":
    also connected through other hyperedges:
      (none)
  Member "what can and can t we do with sparse polynomials":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "lu factorization with errors")
  Member "revisit sparse polynomial interpolation based on randomized kronecker substitution":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "sparse polynomial interpolation based on diversification")
  Member "output sensitive algorithms for sumset and sparse polynomial multiplication":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "nearly optimal sparse polynomial multiplication")
  Member "multivariate sparse interpolation using randomized kronecker substitutions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "sparse polynomial interpolation based on diversification")
  Member "chunky and equal spaced polynomial multiplication":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "nearly optimal sparse polynomial multiplication")

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)