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 "computational linear algebra over finite fields"):
  Abstract: We present here algorithms for efficient computation of linear algebra problems over finite fields.

Includes members:
  Member "simultaneous modular reduction and kronecker substitution for small finite fields":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the m4rie library for dense linear algebra over small fields with even characteristic")
  Member "bitslicing and the method of four russians over larger finite fields":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "fast matrix multiplication and symbolic computation")
  Member "q adic transform revisited":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "simultaneous modular reduction and kronecker substitution for small finite fields")
  Member "faster inversion and other black box matrix computations using efficient block projections":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "minimal representations and algebraic relations for single nested products")
  Member "efficient computation of the characteristic polynomial":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "generic design of chinese remaindering schemes")

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)