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 polynomial multiplication via multipoint kronecker substitution"
  Abstract: We give several new algorithms for dense polynomial multiplication based on the Kronecker substitution method. For moderately sized input polynomials, the new algorithms improve on the performance of the standard Kronecker substitution by a sizeable constant, both in theory and in empirical tests.

Connected through hyperedge HE-1 (induced by source paper "computing isomorphisms and embeddings of finite fields"):
  with members:
    - "fast computation of isomorphisms between finite fields using elliptic curves"
    - "powers of tensors and fast matrix multiplication"
    - "taking roots over high extensions of finite fields"

Connected through hyperedge HE-2 (induced by source paper "parallel integer polynomial multiplication"):
  with members:
    - "fast integer multiplication using generalized fermat primes"
    - "even faster integer multiplication"
    - "highly scalable multiplication for distributed sparse multivariate polynomials on many core systems"
    - "faster polynomial multiplication via discrete fourier transforms"
    - "fast integer multiplication using modular arithmetic"

Connected through hyperedge HE-3 (induced by source paper "fast integer multiplication using generalized fermat primes"):
  with members:
    - "even faster integer multiplication"
    - "fast integer multiplication using modular arithmetic"

Connected through hyperedge HE-4 (induced by source paper "fast arithmetic for faster integer multiplication"):
  with members:
    - "even faster integer multiplication"
    - "fast integer multiplication using modular arithmetic"

Connected through hyperedge HE-5 (induced by source paper "multivariate sparse interpolation using randomized kronecker substitutions"):
  with members:
    - "sparse interpolation over finite fields via low order roots of unity"
    - "diversification improves interpolation"

Connected through hyperedge HE-6 (induced by source paper "simultaneous modular reduction and kronecker substitution for small finite fields"):
  with members:
    - "bitslicing and the method of four russians over larger finite fields"
    - "compressed modular matrix multiplication"
    - "formal proof for delayed finite field arithmetic using floating point operators"
    - "q adic transform revisited"

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)