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: "computing the rank and a small nullspace basis of a polynomial matrix"
  Abstract: We reduce the problem of computing the rank and a nullspace basis of a univariate polynomial matrix to polynomial matrix multiplication. For an input n x n matrix of degree d over a field K we give a rank and nullspace algorithm using about the same number of operations as for multiplying two matrices of dimension n and degree d. If the latter multiplication is done in MM(n,d)=softO(n^omega d) operations, with omega the exponent of matrix multiplication over K, then the algorithm uses softO(MM(n,d)) operations in K. The softO notation indicates some missing logarithmic factors. The method is randomized with Las Vegas certification. We achieve our results in part through a combination of matrix Hensel high-order lifting and matrix minimal fraction reconstruction, and through the computation of minimal or small degree vectors in the nullspace seen as a K[x]-module

Connected through hyperedge HE-1 (induced by source paper "computing lower rank approximations of matrix polynomials"):
  with members:
    - "computing gcrds of approximate differential polynomials"
    - "a quadratically convergent algorithm for structured low rank approximation"

Connected through hyperedge HE-2 (induced by source paper "efficient algorithms for mixed creative telscoping"):
  with members:
    - "computing periods of rational integrals"
    - "a modified abramov petkovsek reduction and creative telescoping for hypergeometric terms"
    - "hermite reduction and creative telescoping for hyperexponential functions"
    - "creative telescoping for rational functions using the griffiths dwork method"
    - "complexity of creative telescoping for bivariate rational functions"
    - "creative telescoping for holonomic functions"
    - "on the length of integers in telescopers for proper hypergeometric terms"
    - "order degree curves for hypergeometric creative telescoping"

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

Connected through hyperedge HE-4 (induced by source paper "hermite reduction and creative telescoping for hyperexponential functions"):
  with members:
    - "complexity of creative telescoping for bivariate rational functions"
    - "trading order for degree in creative telescoping"

Connected through hyperedge HE-5 (induced by source paper "complexity of creative telescoping for bivariate rational functions"):
  with members:
    - "differential equations for algebraic functions"

Connected through hyperedge HE-6 (induced by source paper "order degree curves for hypergeometric creative telescoping"):
  with members:
    - "complexity of creative telescoping for bivariate rational functions"
    - "trading order for degree in creative telescoping"
    - "a fast approach to creative telescoping"
    - "differential equations for algebraic functions"

Connected through hyperedge HE-7 (induced by source paper "fast computation of common left multiples of linear ordinary differential operators"):
  with members:
    - "products of ordinary differential operators by evaluation and interpolation"
    - "differential equations for algebraic functions"

Connected through hyperedge HE-8 (induced by source paper "trading order for degree in creative telescoping"):
  with members:
    - "complexity of creative telescoping for bivariate rational functions"
    - "a fast approach to creative telescoping"
    - "a non holonomic systems approach to special function identities"
    - "differential equations for algebraic functions"

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)