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 "error correction in fast matrix multiplication and inverse"):
  Abstract: We present new algorithms to detect and correct errors in the product of two matrices, or the inverse of a matrix, over an arbitrary field. Our algorithms do not require any additional information or encoding other than the original inputs and the erroneous output. Their running time is softly linear in the number of nonzero entries in these matrices when the number of errors is sufficiently small, and they also incorporate fast matrix multiplication so that the cost scales well when the number of errors is large. These algorithms build on the recent result of Gasieniec et al (2017) on correcting matrix products, as well as existing work on verification algorithms, sparse low-rank linear algebra, and sparse polynomial interpolation.

Includes members:
  Member "certificates for triangular equivalence and rank profiles":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "lu factorization with errors")
  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 "elimination based certificates for triangular equivalence and rank profiles")
  Member "efficiently correcting matrix products":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "lu factorization with errors")
  Member "essentially optimal interactive certificates in linear algebra":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "elimination based certificates for triangular equivalence and rank profiles")
  Member "powers of tensors and fast matrix multiplication":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "new algorithms and hardness for incremental single source shortest paths in directed graphs")
  Member "faster sparse multivariate polynomial interpolation of straight line programs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "sparse polynomial interpolation based on diversification")
  Member "faster polynomial multiplication over finite fields":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "generic reductions for in place polynomial multiplication")
  Member "faster algorithms for rectangular matrix multiplication":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "deterministic algorithms for decremental approximate shortest paths faster and simpler")

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)