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: "faster sparse interpolation of straight line programs"
  Abstract: We give a new probabilistic algorithm for interpolating a "sparse" polynomial f given by a straight-line program. Our algorithm constructs an approximation f * of f, such that f '—' f * probably has at most half the number of terms of f, then recurses on the difference f '—' f *. Our approach builds on previous work by Garg and Schost (2009), and Giesbrecht and Roche (2011), and is asymptotically more efficient in terms of the total cost of the probes required than previous methods, in many cases.

Connected through hyperedge HE-1 (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"
    - "multivariate sparse interpolation using randomized kronecker substitutions"
    - "diversification improves interpolation"

Connected through hyperedge HE-2 (induced by source paper "sparse polynomial interpolation based on derivative"):
  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"
    - "diversification improves interpolation"

Connected through hyperedge HE-3 (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"
    - "multivariate sparse interpolation using randomized kronecker substitutions"
    - "factoring bivariate lacunary polynomials without heights"

Connected through hyperedge HE-4 (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"
    - "multivariate sparse interpolation using randomized kronecker substitutions"
    - "diversification improves interpolation"

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

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

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

Connected through hyperedge HE-8 (induced by source paper "sparse interpolation over finite fields via low order roots of unity"):
  with members:
    - "multivariate sparse interpolation using randomized kronecker substitutions"
    - "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)