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: "multivariate sparse interpolation using randomized kronecker substitutions"
  Abstract: We present new techniques for reducing a multivariate sparse polynomial to a univariate polynomial. The reduction works similarly to the classical and widely-used Kronecker substitution, except that we choose the degrees randomly based on the number of nonzero terms in the multivariate polynomial, that is, its sparsity. The resulting univariate polynomial often has a significantly lower degree than the Kronecker substitution polynomial, at the expense of a small number of term collisions. As an application, we give a new algorithm for multivariate interpolation which uses these new techniques along with any existing univariate interpolation algorithm.

Connected through hyperedge HE-1 (induced by source paper "essentially optimal sparse polynomial multiplication"):
  with members:
    - "nearly optimal sparse polynomial multiplication"
    - "what can and can t we do with sparse polynomials"
    - "revisit sparse polynomial interpolation based on randomized kronecker substitution"
    - "output sensitive algorithms for sumset and sparse polynomial multiplication"
    - "chunky and equal spaced polynomial multiplication"

Connected through hyperedge HE-2 (induced by source paper "sparse polynomial interpolation based on diversification"):
  with members:
    - "faster interpolation algorithms for sparse multivariate polynomials given by straight line programs"
    - "revisit sparse polynomial interpolation based on randomized kronecker substitution"
    - "faster sparse multivariate polynomial interpolation of straight line programs"
    - "faster sparse interpolation of straight line programs"
    - "diversification improves interpolation"

Connected through hyperedge HE-3 (induced by source paper "sparse interpolation in terms of multivariate chebyshev polynomials"):
  with members:
    - "sparse interpolation over finite fields via low order roots of unity"
    - "symmetric tensor decomposition"

Connected through hyperedge HE-4 (induced by source paper "on fast matrix inversion via fast matrix multiplication"):
  with members:
    - "powers of tensors and fast matrix multiplication"

Connected through hyperedge HE-5 (induced by source paper "what can and can t we do with sparse polynomials"):
  with members:
    - "bounded degree factors of lacunary multivariate polynomials"
    - "output sensitive algorithms for sumset and sparse polynomial multiplication"
    - "parallel sparse interpolation using small primes"
    - "sparse interpolation over finite fields via low order roots of unity"
    - "faster sparse multivariate polynomial interpolation of straight line programs"
    - "faster polynomial multiplication over finite fields"
    - "faster sparse interpolation of straight line programs"
    - "factoring bivariate lacunary polynomials without heights"

Connected through hyperedge HE-6 (induced by source paper "faster interpolation algorithms for sparse multivariate polynomials given by straight line programs"):
  with members:
    - "sparse interpolation over finite fields via low order roots of unity"
    - "faster sparse multivariate polynomial interpolation of straight line programs"
    - "faster sparse interpolation of straight line programs"
    - "diversification improves interpolation"

Connected through hyperedge HE-7 (induced by source paper "revisit sparse polynomial interpolation based on randomized kronecker substitution"):
  with members:
    - "faster sparse multivariate polynomial interpolation of straight line programs"
    - "faster sparse interpolation of straight line programs"
    - "diversification improves interpolation"
    - "interpolation of shifted lacunary polynomials"

Connected through hyperedge HE-8 (induced by source paper "sparse polynomial interpolation with finitely many values for the coefficients"):
  with members:
    - "sparse rational function interpolation with finitely many values for the coefficients"
    - "diversification improves interpolation"

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)