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 "fast computation of shifted popov forms of polynomial matrices via systems of modular polynomial equations"):
  Abstract: We give a Las Vegas algorithm which computes the shifted Popov form of an m x m nonsingular polynomial matrix of degree d in expected ~O(mω d) field operations, where ω is the exponent of matrix multiplication and ~O(·) indicates that logarithmic factors are omitted. This is the first algorithm in ~O(mω d) for shifted row reduction with arbitrary shifts.   Using partial linearization, we reduce the problem to the case d ≤ ⌈ σ/m ⌉ where σ is the generic determinant bound, with σ / m bounded from above by both the average row degree and the average column degree of the matrix. The cost above becomes ~O(mω ⌈ σ/m ⌉), improving upon the cost of the fastest previously known algorithm for row reduction, which is deterministic.   Our algorithm first builds a system of modular equations whose solution set is the row space of the input matrix, and then finds the basis in shifted Popov form of this set. We give a deterministic algorithm for this second step supporting arbitrary moduli in ~O(mω-1 σ) field operations, where m is the number of unknowns and σ is the sum of the degrees of the moduli. This extends previous results with the same cost bound in the specific cases of order basis computation and M-Pade approximation, in which the moduli are products of known linear factors.

Includes members:
  Member "a fast deterministic algorithm for computing a hermite normal form of a polynomial matrix":
    also connected through other hyperedges:
      (none)
  Member "fast computation of minimal interpolation bases in popov form for arbitrary shifts":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a divide and conquer algorithm for computing grobner bases of syzygies in finite dimension")
  Member "computing minimal interpolation bases":
    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 "faster algorithms for multivariate interpolation with multiplicities and simultaneous polynomial approximations":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "change of basis for m primary ideals in one and two variables")
  Member "powers of tensors and fast matrix multiplication":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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)