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 "elimination based certificates for triangular equivalence and rank profiles"):
  Abstract: Abstract   In this paper, we give novel certificates for triangular equivalence and rank profiles. These certificates enable somebody to verify the row or column rank profiles or the whole rank profile matrix faster than recomputing them, with a negligible overall overhead. We first provide quadratic time and space non-interactive certificates saving the logarithmic factors of previously known ones. Then we propose interactive certificates for the same problems whose Monte Carlo verification complexity requires a small constant number of matrix-vector multiplications, a linear space, and a linear number of extra field operations, with a linear number of interactions. As an application we also give an interactive protocol, certifying the determinant or the signature of dense matrices, faster for the Prover than the best previously known one. Finally we give linear space and constant round certificates for the row or column rank profiles.

Includes members:
  Member "fast computation of the rank profile matrix and the generalized bruhat decomposition":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "symmetric indefinite triangular factorization revealing the rank profile matrix")
  Member "linear time interactive certificates for the minimal polynomial and the determinant of a sparse matrix":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "lu factorization with errors")
  Member "essentially optimal interactive certificates in linear algebra":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "lu factorization with errors")
  Member "simultaneous computation of the row and column rank profiles":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "lu factorization with errors")
  Member "fast matrix rank algorithms and applications":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "an efficient algorithm for 1 dimensional persistent path homology")
  Member "rank profile revealing gaussian elimination and the cup matrix decomposition":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "certificates for triangular equivalence and rank profiles")

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)