human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "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.

Includes members:
  Member "sparse interpolation over finite fields via low order roots of unity":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "sparse interpolation in terms of multivariate chebyshev polynomials")
  Member "powers of tensors and fast matrix multiplication":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "new algorithms and hardness for incremental single source shortest paths in directed graphs")
  Member "multivariate sparse interpolation using randomized kronecker substitutions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "essentially optimal sparse polynomial multiplication")
  Member "faster sparse interpolation of straight line programs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "sparse polynomial interpolation based on diversification")
  Member "nearly optimal sparse fourier transform":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "privacy preserving learning via deep net pruning")
  Member "diversification improves interpolation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "sparse polynomial interpolation based on diversification")

Question: Please tell me which class the source paper 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)