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 "fast arithmetic for faster integer multiplication"):
  Abstract: For almost 35 years, Schonhage-Strassen's algorithm has been the fastest algorithm known for multiplying integers, with a time complexity O(n · log n · log log n) for multi-plying n-bit inputs. In 2007, Furer proved that there ex-ists K > 1 and an algorithm performing this operation in O(n · log n · K log * n). Recent work showed that this com-plexity estimate can be made more precise with K = 8, and conjecturally K = 4. We obtain here the same result K = 4 using simple modular arithmetic as a building block, and a careful complexity analysis. We rely on a conjecture about the existence of sufficiently many primes of a certain form.

Includes members:
  Member "even faster integer multiplication":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the i o complexity of hybrid algorithms for integer multiplication")
  Member "fast integer multiplication using modular arithmetic":
    also connected through other hyperedges:
      - Hyperedge HE-2 (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-3 (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)