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: "highly scalable multiplication for distributed sparse multivariate polynomials on many core systems"
  Abstract: We present a highly scalable algorithm for multiplying sparse multivariate polynomials represented in a distributed format. This algo- rithm targets not only the shared memory multicore computers, but also computers clusters or specialized hardware attached to a host computer, such as graphics processing units or many-core coprocessors. The scal- ability on the large number of cores is ensured by the lacks of synchro- nizations, locks and false-sharing during the main parallel step.

Connected through hyperedge HE-1 (induced by source paper "on the parallelization of triangular decomposition of polynomial systems"):
  with members:
    - "parallel integer polynomial multiplication"

Connected through hyperedge HE-2 (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-3 (induced by source paper "parallel integer polynomial multiplication"):
  with members:
    - "fast integer multiplication using generalized fermat primes"
    - "even faster integer multiplication"
    - "faster polynomial multiplication via discrete fourier transforms"
    - "fast integer multiplication using modular arithmetic"
    - "faster polynomial multiplication via multipoint kronecker substitution"

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"
    - "chunky and equal spaced polynomial multiplication"
    - "interpolation of shifted lacunary polynomials"

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)