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: "fast integer multiplication using modular arithmetic"
  Abstract: We give an $O(N\cdot \log N\cdot 2^{O(\log^*N)})$ algorithm for multiplying two $N$-bit integers that improves the $O(N\cdot \log N\cdot \log\log N)$ algorithm by Sch\"{o}nhage-Strassen. Both these algorithms use modular arithmetic. Recently, F\"{u}rer gave an $O(N\cdot \log N\cdot 2^{O(\log^*N)})$ algorithm which however uses arithmetic over complex numbers as opposed to modular arithmetic. In this paper, we use multivariate polynomial multiplication along with ideas from F\"{u}rer's algorithm to achieve this improvement in the modular setting. Our algorithm can also be viewed as a $p$-adic version of F\"{u}rer's algorithm. Thus, we show that the two seemingly different approaches to integer multiplication, modular and complex arithmetic, are similar.

Connected through hyperedge HE-1 (induced by source paper "faster integer multiplication using short lattice vectors"):
  with members:
    - "faster truncated integer multiplication"
    - "faster integer multiplication using plain vanilla fft primes"
    - "even faster integer multiplication"

Connected through hyperedge HE-2 (induced by source paper "faster integer and polynomial multiplication using cyclotomic coefficient rings"):
  with members:
    - "faster truncated integer multiplication"

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"
    - "highly scalable multiplication for distributed sparse multivariate polynomials on many core systems"
    - "faster polynomial multiplication via discrete fourier transforms"
    - "faster polynomial multiplication via multipoint kronecker substitution"

Connected through hyperedge HE-4 (induced by source paper "a near linear pseudopolynomial time algorithm for subset sum"):
  with members:
    - "on problems as hard as cnf sat"
    - "a faster pseudopolynomial time algorithm for subset sum"
    - "how fast can we multiply large integers on an actual computer"
    - "losing weight by gaining edges"

Connected through hyperedge HE-5 (induced by source paper "fast integer multiplication using generalized fermat primes"):
  with members:
    - "even faster integer multiplication"
    - "faster polynomial multiplication via multipoint kronecker substitution"

Connected through hyperedge HE-6 (induced by source paper "fast arithmetic for faster integer multiplication"):
  with members:
    - "even faster integer multiplication"
    - "faster polynomial multiplication via multipoint kronecker substitution"

Connected through hyperedge HE-7 (induced by source paper "on the complexity of computing prime tables"):
  with members:
    - "how fast can we multiply large integers on an actual computer"

Connected through hyperedge HE-8 (induced by source paper "on the complexity of computing with planar algebraic curves"):
  with members:
    - "improved algorithm for computing separating linear forms for bivariate systems"
    - "fast approximate polynomial multipoint evaluation and applications"
    - "a generic position based method for real root isolation of zero dimensional polynomial systems"
    - "rational univariate representations of bivariate systems and applications"
    - "from approximate factorization to root isolation with application to cylindrical algebraic decomposition"
    - "separating linear forms for bivariate systems"
    - "exact symbolic numeric computation of planar algebraic curves"
    - "a worst case bound for topology computation of algebraic curves"

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)