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: "sparse interpolation over finite fields via low order roots of unity"
  Abstract: We present a new Monte Carlo algorithm for the interpolation of a straight-line program as a sparse polynomial $f$ over an arbitrary finite field of size $q$. We assume a priori bounds $D$ and $T$ are given on the degree and number of terms of $f$. The approach presented in this paper is a hybrid of the diversified and recursive interpolation algorithms, the two previous fastest known probabilistic methods for this problem. By making effective use of the information contained in the coefficients themselves, this new algorithm improves on the bit complexity of previous methods by a "soft-Oh" factor of $T$, $\log D$, or $\log q$.

Connected through hyperedge HE-1 (induced by source paper "sparse interpolation in terms of multivariate chebyshev polynomials"):
  with members:
    - "multivariate sparse interpolation using randomized kronecker substitutions"
    - "symmetric tensor decomposition"

Connected through hyperedge HE-2 (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"
    - "faster sparse multivariate polynomial interpolation of straight line programs"
    - "faster polynomial multiplication over finite fields"
    - "multivariate sparse interpolation using randomized kronecker substitutions"
    - "faster sparse interpolation of straight line programs"
    - "factoring bivariate lacunary polynomials without heights"

Connected through hyperedge HE-3 (induced by source paper "faster interpolation algorithms for sparse multivariate polynomials given by straight line programs"):
  with members:
    - "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-4 (induced by source paper "output sensitive algorithms for sumset and sparse polynomial multiplication"):
  with members:
    - "faster sparse multivariate polynomial interpolation of straight line programs"
    - "faster polynomial multiplication over finite fields"
    - "even faster integer multiplication"
    - "highly scalable multiplication for distributed sparse multivariate polynomials on many core systems"
    - "chunky and equal spaced polynomial multiplication"
    - "interpolation of shifted lacunary polynomials"

Connected through hyperedge HE-5 (induced by source paper "parallel sparse interpolation using small primes"):
  with members:
    - "faster sparse multivariate polynomial interpolation of straight line programs"
    - "faster sparse interpolation of straight line programs"
    - "diversification improves interpolation"

Connected through hyperedge HE-6 (induced by source paper "faster sparse multivariate polynomial interpolation of straight line programs"):
  with members:
    - "powers of tensors and fast matrix multiplication"
    - "multivariate sparse interpolation using randomized kronecker substitutions"
    - "faster sparse interpolation of straight line programs"
    - "nearly optimal sparse fourier transform"
    - "diversification improves interpolation"

Connected through hyperedge HE-7 (induced by source paper "multivariate sparse interpolation using randomized kronecker substitutions"):
  with members:
    - "diversification improves interpolation"
    - "faster polynomial multiplication via multipoint kronecker substitution"

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)