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: "diversification improves interpolation"
  Abstract: We consider the problem of interpolating an unknown multivariate polynomial with coefficients taken from a finite field or as numerical approximations of complex numbers. Building on the recent work of Garg and Schost, we improve on the best-known algorithm for interpolation over large finite fields by presenting a Las Vegas randomized algorithm that uses fewer black box evaluations. Using related techniques, we also address numerical interpolation of sparse polynomials with complex coefficients, and provide the first provably stable algorithm (in the sense of relative error) for this problem, at the cost of modestly more evaluations. A key new technique is a randomization which makes all coefficients of the unknown polynomial distinguishable, producing what we call a diverse polynomial. Another departure from most previous approaches is that our algorithms do not rely on root finding as a subroutine. We show how these improvements affect the practical performance with trial implementations.

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"
    - "faster sparse interpolation of straight line programs"

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"
    - "faster sparse interpolation of straight line programs"

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"
    - "faster sparse interpolation of straight line programs"

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"
    - "faster sparse interpolation of straight line programs"

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"
    - "faster sparse interpolation of straight line programs"
    - "interpolation of shifted lacunary polynomials"

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

Connected through hyperedge HE-7 (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"
    - "faster sparse interpolation of straight line programs"

Connected through hyperedge HE-8 (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"
    - "faster sparse interpolation of straight line programs"
    - "nearly optimal sparse fourier transform"

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)