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: "simultaneous computation of the row and column rank profiles"
  Abstract: Gaussian elimination with full pivoting generates a PLUQ matrix decomposition. Depending on the strategy used in the search for pivots, the permutation matrices can reveal some information about the row or the column rank profiles of the matrix. We propose a new pivoting strategy that makes it possible to recover at the same time both row and column rank profiles of the input matrix and of any of its leading sub-matrices. We propose a rank-sensitive and quad-recursive algorithm that computes the latter PLUQ triangular decomposition of an m \times n matrix of rank r in O(mnr^{\omega-2}) field operations, with \omega the exponent of matrix multiplication. Compared to the LEU decomposition by Malashonock, sharing a similar recursive structure, its time complexity is rank sensitive and has a lower leading constant. Over a word size finite field, this algorithm also improveLs the practical efficiency of previously known implementations.

Connected through hyperedge HE-1 (induced by source paper "elimination based certificates for triangular equivalence and rank profiles"):
  with members:
    - "fast computation of the rank profile matrix and the generalized bruhat decomposition"
    - "linear time interactive certificates for the minimal polynomial and the determinant of a sparse matrix"
    - "essentially optimal interactive certificates in linear algebra"
    - "fast matrix rank algorithms and applications"
    - "rank profile revealing gaussian elimination and the cup matrix decomposition"

Connected through hyperedge HE-2 (induced by source paper "lu factorization with errors"):
  with members:
    - "error correction in fast matrix multiplication and inverse"
    - "what can and can t we do with sparse polynomials"
    - "certificates for triangular equivalence and rank profiles"
    - "linear time interactive certificates for the minimal polynomial and the determinant of a sparse matrix"
    - "efficiently correcting matrix products"
    - "essentially optimal interactive certificates in linear algebra"
    - "powers of tensors and fast matrix multiplication"
    - "parallel computation of echelon forms"

Connected through hyperedge HE-3 (induced by source paper "recursive matrix algorithms in commutative domain for cluster with distributed memory"):
  with members:
    - "recursive method for the solution of systems of linear equations"
    - "time and space efficient generators for quasiseparable matrices"
    - "triangular decomposition of matrices in a domain"
    - "generalized bruhat decomposition in commutative domains"
    - "fast generalized bruhat decomposition"
    - "algorithms for the solution of systems of linear equations in commutative rings"

Connected through hyperedge HE-4 (induced by source paper "certificates for triangular equivalence and rank profiles"):
  with members:
    - "fast computation of the rank profile matrix and the generalized bruhat decomposition"
    - "linear time interactive certificates for the minimal polynomial and the determinant of a sparse matrix"
    - "computing the rank profile matrix"
    - "essentially optimal interactive certificates in linear algebra"
    - "fast matrix rank algorithms and applications"
    - "rank profile revealing gaussian elimination and the cup matrix decomposition"

Connected through hyperedge HE-5 (induced by source paper "fast computation of the rank profile matrix and the generalized bruhat decomposition"):
  with members:
    - "computing the rank profile matrix"
    - "parallel computation of echelon forms"
    - "generalized bruhat decomposition in commutative domains"
    - "fast matrix rank algorithms and applications"
    - "rank profile revealing gaussian elimination and the cup matrix decomposition"
    - "fast generalized bruhat decomposition"

Connected through hyperedge HE-6 (induced by source paper "time and space efficient generators for quasiseparable matrices"):
  with members:
    - "fast computation of the rank profile matrix and the generalized bruhat decomposition"
    - "computing with quasiseparable matrices"
    - "computing the rank profile matrix"
    - "powers of tensors and fast matrix multiplication"
    - "rank profile revealing gaussian elimination and the cup matrix decomposition"
    - "fast generalized bruhat decomposition"

Connected through hyperedge HE-7 (induced by source paper "computing with quasiseparable matrices"):
  with members:
    - "fast computation of the rank profile matrix and the generalized bruhat decomposition"
    - "computing the rank profile matrix"
    - "fast generalized bruhat decomposition"

Connected through hyperedge HE-8 (induced by source paper "computing the rank profile matrix"):
  with members:
    - "parallel computation of echelon forms"
    - "rank profile revealing gaussian elimination and the cup matrix decomposition"
    - "fast generalized bruhat decomposition"

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.NA(Numerical Analysis)