human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "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.

Connected through hyperedge HE-1 (induced by source paper "fast computation of approximant bases in canonical form"):
  with members:
    - "fast computation of minimal interpolation bases in popov form for arbitrary shifts"
    - "algorithms for simultaneous pade approximations"
    - "computing minimal interpolation bases"
    - "powers of tensors and fast matrix multiplication"
    - "faster polynomial multiplication over finite fields"

Connected through hyperedge HE-2 (induced by source paper "computing popov and hermite forms of rectangular polynomial matrices"):
  with members:
    - "computing canonical bases of modules of univariate relations"
    - "fast computation of minimal interpolation bases in popov form for arbitrary shifts"
    - "fast deterministic computation of the hermite normal form and determinant of a polynomial matrix"

Connected through hyperedge HE-3 (induced by source paper "computing canonical bases of modules of univariate relations"):
  with members:
    - "fast computation of minimal interpolation bases in popov form for arbitrary shifts"
    - "fast deterministic computation of the hermite normal form and determinant of a polynomial matrix"
    - "algorithms for simultaneous pade approximations"
    - "computing minimal interpolation bases"
    - "powers of tensors and fast matrix multiplication"

Connected through hyperedge HE-4 (induced by source paper "algorithms for simultaneous pade approximations"):
  with members:
    - "fast computation of minimal interpolation bases in popov form for arbitrary shifts"
    - "faster algorithms for multivariate interpolation with multiplicities and simultaneous polynomial approximations"
    - "powers of tensors and fast matrix multiplication"
    - "generalised multi sequence shift register synthesis using module minimisation"
    - "collaborative decoding of interleaved reed solomon codes and concatenated code designs"

Connected through hyperedge HE-5 (induced by source paper "fast deterministic computation of the hermite normal form and determinant of a polynomial matrix"):
  with members:
    - "fast computation of minimal interpolation bases in popov form for arbitrary shifts"
    - "computing the rank and a small nullspace basis of a polynomial matrix"

Connected through hyperedge HE-6 (induced by source paper "power decoding reed solomon codes up to the johnson radius"):
  with members:
    - "algorithms for simultaneous pade approximations"
    - "sub quadratic decoding of one point hermitian codes"
    - "faster algorithms for multivariate interpolation with multiplicities and simultaneous polynomial approximations"
    - "coding for combined block symbol error correction"
    - "power decoding of reed solomon codes revisited"
    - "generalised multi sequence shift register synthesis using module minimisation"
    - "on rational interpolation based list decoding and list decoding binary goppa codes"
    - "an interpolation procedure for list decoding reed solomon codes based on generalized key equations"

Question: Please tell me which class the center node 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)