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 deterministic computation of the hermite normal form and determinant of a polynomial matrix"
  Abstract: Given a nonsingular $n \times n$ matrix of univariate polynomials over a field $\mathbb{K}$, we give fast and deterministic algorithms to compute its determinant and its Hermite normal form. Our algorithms use $\widetilde{\mathcal{O}}(n^\omega \lceil s \rceil)$ operations in $\mathbb{K}$, where $s$ is bounded from above by both the average of the degrees of the rows and that of the columns of the matrix and $\omega$ is the exponent of matrix multiplication. The soft-$O$ notation indicates that logarithmic factors in the big-$O$ are omitted while the ceiling function indicates that the cost is $\widetilde{\mathcal{O}}(n^\omega)$ when $s = o(1)$. Our algorithms are based on a fast and deterministic triangularization method for computing the diagonal entries of the Hermite form of a nonsingular matrix.

Connected through hyperedge HE-1 (induced by source paper "implementations of efficient univariate polynomial matrix algorithms and application to bivariate resultants"):
  with members:
    - "computing popov and hermite forms of rectangular polynomial matrices"
    - "fast computation of approximant bases in canonical form"
    - "block krylov techniques in the context of sparse fglm algorithms"
    - "improved rectangular matrix multiplication using powers of the coppersmith winograd tensor"
    - "fast computation of minimal interpolation bases in popov form for arbitrary shifts"
    - "sub quadratic decoding of one point hermitian codes"
    - "computing minimal interpolation bases"
    - "faster arithmetic for number theoretic transforms"

Connected through hyperedge HE-2 (induced by source paper "sensitive distance and reachability oracles for large batch updates"):
  with members:
    - "dynamic matrix inverse improved algorithms and matching conditional lower bounds"
    - "deterministic combinatorial replacement paths and distance sensitivity oracles"
    - "dynamic approximate shortest paths and beyond subquadratic and worst case update time"
    - "conditional hardness for sensitivity problems"
    - "connectivity oracles for graphs subject to vertex failures"
    - "incremental and fully dynamic subgraph connectivity for emergency planning"
    - "powers of tensors and fast matrix multiplication"
    - "popular conjectures imply strong lower bounds for dynamic problems"

Connected through hyperedge HE-3 (induced by source paper "computing the characteristic polynomial of a finite rank two drinfeld module"):
  with members:
    - "fast multiplication for skew polynomials"
    - "improved rectangular matrix multiplication using powers of the coppersmith winograd tensor"
    - "drinfeld modules with complex multiplication hasse invariants and factoring polynomials over finite fields"
    - "fast operations on linearized polynomials and their applications in coding theory"
    - "polynomial factorization over finite fields by computing euler poincare characteristics of drinfeld modules"
    - "powers of tensors and fast matrix multiplication"

Connected through hyperedge HE-4 (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 computation of shifted popov forms of polynomial matrices via systems of modular polynomial equations"

Connected through hyperedge HE-5 (induced by source paper "interactive certificates for polynomial matrices with sub linear communication"):
  with members:
    - "computing popov and hermite forms of rectangular polynomial matrices"
    - "computing canonical bases of modules of univariate relations"
    - "powers of tensors and fast matrix multiplication"

Connected through hyperedge HE-6 (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 computation of shifted popov forms of polynomial matrices via systems of modular polynomial equations"
    - "algorithms for simultaneous pade approximations"
    - "computing minimal interpolation bases"
    - "powers of tensors and fast matrix multiplication"

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)