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: "revisit sparse polynomial interpolation based on randomized kronecker substitution"
  Abstract: In this paper, a new reduction based interpolation algorithm for black-box multivariate polynomials over finite fields is given. The method is based on two main ingredients. A new Monte Carlo method is given to reduce black-box multivariate polynomial interpolation to black-box univariate polynomial interpolation over any ring. The reduction algorithm leads to multivariate interpolation algorithms with better or the same complexities most cases when combining with various univariate interpolation algorithms. We also propose a modified univariate Ben-or and Tiwarri algorithm over the finite field, which has better total complexity than the Lagrange interpolation algorithm. Combining our reduction method and the modified univariate Ben-or and Tiwarri algorithm, we give a Monte Carlo multivariate interpolation algorithm, which has better total complexity in most cases for sparse interpolation of black-box polynomial over finite fields.

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"
    - "output sensitive algorithms for sumset and sparse polynomial multiplication"
    - "multivariate sparse interpolation using randomized kronecker substitutions"
    - "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"
    - "faster sparse multivariate polynomial interpolation of straight line programs"
    - "multivariate sparse interpolation using randomized kronecker substitutions"
    - "faster sparse interpolation of straight line programs"
    - "diversification improves interpolation"

Connected through hyperedge HE-3 (induced by source paper "sparse polynomial interpolation based on derivative"):
  with members:
    - "faster interpolation algorithms for sparse multivariate polynomials given by straight line programs"
    - "faster sparse multivariate polynomial interpolation of straight line programs"
    - "faster sparse interpolation of straight line programs"
    - "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)