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 "parallel integer polynomial multiplication"):
  Abstract: We propose a new algorithm for multiplying dense polynomials with integer coefficients in a parallel fashion, targeting multi-core processor architectures. Complexity estimates and experimental comparisons demonstrate the advantages of this new approach.

Includes members:
  Member "fast integer multiplication using generalized fermat primes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the i o complexity of hybrid algorithms for integer multiplication")
  Member "even faster integer multiplication":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the i o complexity of hybrid algorithms for integer multiplication")
  Member "highly scalable multiplication for distributed sparse multivariate polynomials on many core systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the parallelization of triangular decomposition of polynomial systems")
  Member "faster polynomial multiplication via discrete fourier transforms":
    also connected through other hyperedges:
      (none)
  Member "fast integer multiplication using modular arithmetic":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "faster integer multiplication using short lattice vectors")
  Member "faster polynomial multiplication via multipoint kronecker substitution":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "computing isomorphisms and embeddings of finite fields")

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)