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 "lu factorization with errors"):
  Abstract: We present new algorithms to detect and correct errors in the lower-upper factorization of a matrix, or the triangular linear system solution, over an arbitrary field. Our main 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 dimension times the number of errors when there are few errors, smoothly growing to the cost of fast matrix multiplication as the number of errors increases. We also present applications to general linear system solving.

Includes members:
  Member "error correction in fast matrix multiplication and inverse":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on nondeterministic derandomization of freivalds algorithm consequences avenues and algorithmic progress")
  Member "what can and can t we do with sparse polynomials":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "essentially optimal sparse polynomial multiplication")
  Member "certificates for triangular equivalence and rank profiles":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "error correction in fast matrix multiplication and inverse")
  Member "linear time interactive certificates for the minimal polynomial and the determinant of a sparse matrix":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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-5 (induced by source paper "error correction in fast matrix multiplication and inverse")
  Member "essentially optimal interactive certificates in linear algebra":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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-7 (induced by source paper "new algorithms and hardness for incremental single source shortest paths in directed graphs")
  Member "parallel computation of echelon forms":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "fast computation of the rank profile matrix and the generalized bruhat decomposition")

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)