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 multivariate polynomial interpolation of straight line programs"
  Abstract: Given a straight-line program whose output is a polynomial function of the inputs, we present a new algorithm to compute a concise representation of that unknown function. Our algorithm can handle any case where the unknown function is a multivariate polynomial, with coefficients in an arbitrary finite field, and with a reasonable number of nonzero terms but possibly very large degree. It is competitive with previously known sparse interpolation algorithms that work over an arbitrary finite field, and provides an improvement when there are a large number of variables.

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"
    - "multivariate sparse interpolation using randomized kronecker substitutions"
    - "faster sparse interpolation of straight line programs"
    - "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 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 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-4 (induced by source paper "error correction in fast matrix multiplication and inverse"):
  with members:
    - "certificates for triangular equivalence and rank profiles"
    - "linear time interactive certificates for the minimal polynomial and the determinant of a sparse matrix"
    - "efficiently correcting matrix products"
    - "essentially optimal interactive certificates in linear algebra"
    - "powers of tensors and fast matrix multiplication"
    - "faster polynomial multiplication over finite fields"
    - "faster algorithms for rectangular matrix multiplication"
    - "fast matrix rank algorithms and applications"

Connected through hyperedge HE-5 (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"
    - "multivariate sparse interpolation using randomized kronecker substitutions"
    - "faster sparse interpolation of straight line programs"
    - "diversification improves interpolation"

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

Connected through hyperedge HE-7 (induced by source paper "output sensitive algorithms for sumset and sparse polynomial multiplication"):
  with members:
    - "sparse interpolation over finite fields via low order roots of unity"
    - "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-8 (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 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)