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: "interpolation of shifted lacunary polynomials"
  Abstract: Given a “black box” function to evaluate an unknown rational polynomial $$f \in {\mathbb{Q}}[x]$$at points modulo a prime p, we exhibit algorithms to compute the representation of the polynomial in the sparsest shifted power basis. That is, we determine the sparsity $$t \in {\mathbb{Z}}_{>0}$$, the shift $$\alpha \in {\mathbb{Q}}$$, the exponents $${0 \leq e_{1} < e_{2} < \cdots < e_{t}}$$, and the coefficients $$c_{1}, \ldots , c_{t} \in {\mathbb{Q}} \setminus \{0\}$$ such that $$f(x) = c_{1}(x-\alpha)^{e_{1}}+c_{2}(x-\alpha)^{e_{2}}+ \cdots +c_{t}(x-\alpha)^{e_{t}}$$.#R##N##R##N#The computed sparsity t is absolutely minimal over any shifted power basis. The novelty of our algorithm is that the complexity is polynomial in the (sparse) representation size, which may be logarithmic in the degree of f. Our method combines previous celebrated results on sparse interpolation and computing sparsest shifts, and provides a way to handle polynomials with extremely high degree which are, in some sense, sparse in information.

Connected through hyperedge HE-1 (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-2 (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"
    - "diversification improves interpolation"

Connected through hyperedge HE-3 (induced by source paper "reconstruction algorithms for sums of affine powers"):
  with members:
    - "a nearly optimal algorithm to decompose binary forms"
    - "lower bounds by birkhoff interpolation"
    - "symmetric tensor decomposition"

Connected through hyperedge HE-4 (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 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"

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)