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 "computing popov and hermite forms of rectangular polynomial matrices"):
  Abstract: We consider the computation of two normal forms for matrices over the univariate polynomials: the Popov form and the Hermite form. For matrices which are square and nonsingular, deterministic algorithms with satisfactory cost bounds are known. Here, we present deterministic, fast algorithms for rectangular input matrices. The obtained cost bound for the Popov form matches the previous best known randomized algorithm, while the cost bound for the Hermite form improves on the previous best known ones by a factor which is at least the largest dimension of the input matrix.

Includes members:
  Member "computing canonical bases of modules of univariate relations":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "interactive certificates for polynomial matrices with sub linear communication")
  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 "fast deterministic computation of the hermite normal form and determinant of a polynomial matrix":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "implementations of efficient univariate polynomial matrix algorithms and application to bivariate resultants")
  Member "fast computation of shifted popov forms of polynomial matrices via systems of modular polynomial equations":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "fast computation of approximant bases in canonical form")

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)