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 "certification of minimal approximant bases"):
  Abstract: Considering a given computational problem, a certificate is a piece of additional data that one attaches to the output in order to help verifying that this output is correct. Certificates are often used to make the verification phase significantly more efficient than the whole (re-)computation of the output. Here, we consider the minimal approximant basis problem, for which the fastest known algorithms compute a polynomial matrix of dimensions $m\times m$ and average degree $D/m$ using $O\tilde{~}(m^\omega \frac{D}{m})$ field operations. In the usual setting where the matrix to approximate has $n$ columns with $n\le m$, we provide a certificate of size $m n$, which can be computed in $O(m^\omega \frac{D}{m})$ operations and which allows us to verify an approximant basis by a Monte Carlo algorithm with cost bound $O(m^\omega + mD)$. #R##N#Besides theoretical interest, our motivation also comes from the fact that approximant bases arise in most of the fastest known algorithms for linear algebra over the univariate polynomials; thus, this work may help in designing certificates for other polynomial matrix computations. Furthermore, cryptographic challenges such as breaking records for discrete logarithm computations or for integer factorization rely in particular on computing minimal approximant bases for large instances: certificates can then be used to provide reliable computation on outsourced and error-prone clusters.

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 "fast computation of minimal interpolation bases in popov form for arbitrary shifts":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a divide and conquer algorithm for computing grobner bases of syzygies in finite dimension")
  Member "linear time interactive certificates for the minimal polynomial and the determinant of a sparse matrix":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "elimination based certificates for triangular equivalence and rank profiles")
  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")

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)