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: "efficient computation of the characteristic polynomial"
  Abstract: This article deals with the computation of the characteristic polynomial of dense matrices over small finite fields and over the integers. We first present two algorithms for the finite fields: one is based on Krylov iterates and Gaussian elimination. We compare it to an improvement of the second algorithm of Keller-Gehrig. Then we show that a generalization of Keller-Gehrig's third algorithm could improve both complexity and computational time. We use these results as a basis for the computation of the characteristic polynomial of integer matrices. We first use early termination and Chinese remaindering for dense matrices. Then a probabilistic approach, based on integer minimal polynomial and Hensel factorization, is particularly well suited to sparse and/or structured matrices.

Connected through hyperedge HE-1 (induced by source paper "computational linear algebra over finite fields"):
  with members:
    - "simultaneous modular reduction and kronecker substitution for small finite fields"
    - "bitslicing and the method of four russians over larger finite fields"
    - "q adic transform revisited"
    - "faster inversion and other black box matrix computations using efficient block projections"

Connected through hyperedge HE-2 (induced by source paper "generic design of chinese remaindering schemes"):
  with members:
    - "bounds on the coefficients of the characteristic and minimal polynomials"

Connected through hyperedge HE-3 (induced by source paper "on finding multiplicities of characteristic polynomial factors of black box matrices"):
  with members:
    - "faster inversion and other black box matrix computations using efficient block projections"
    - "bounds on the coefficients of the characteristic and minimal polynomials"
    - "an introspective algorithm for the integer determinant"

Connected through hyperedge HE-4 (induced by source paper "dense linear algebra over finite fields the fflas and ffpack packages"):
  with members:
    - "q adic transform revisited"
    - "memory efficient scheduling of strassen winograd s matrix multiplication algorithm"
    - "fast computation of moore penrose inverse matrices"

Connected through hyperedge HE-5 (induced by source paper "an introspective algorithm for the integer determinant"):
  with members:
    - "solving sparse integer linear systems"

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)