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: "rank profile revealing gaussian elimination and the cup matrix decomposition"
  Abstract: Transforming a matrix over a field to echelon form, or decomposing the matrix as a product of structured matrices that reveal the rank profile, is a fundamental building block of computational exact linear algebra. This paper surveys the well known variations of such decompositions and transformations that have been proposed in the literature. We present an algorithm to compute the CUP decomposition of a matrix, adapted from the LSP algorithm of Ibarra, Moran and Hui (1982), and show reductions from the other most common Gaussian elimination based matrix transformations and decompositions to the CUP decomposition. We discuss the advantages of the CUP algorithm over other existing algorithms by studying time and space complexities: the asymptotic time complexity is rank sensitive, and comparing the constants of the leading terms, the algorithms for computing matrix invariants based on the CUP decomposition are always at least as good except in one case. We also show that the CUP algorithm, as well as the computation of other invariants such as transformation to reduced column echelon form using the CUP algorithm, all work in place, allowing for example to compute the inverse of a matrix on the same storage as the input matrix.

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"
    - "simultaneous computation of the row and column rank profiles"
    - "fast matrix rank algorithms and applications"

Connected through hyperedge HE-2 (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"
    - "simultaneous computation of the row and column rank profiles"
    - "fast matrix rank algorithms and applications"

Connected through hyperedge HE-3 (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"
    - "simultaneous computation of the row and column rank profiles"
    - "fast matrix rank algorithms and applications"
    - "fast generalized bruhat decomposition"

Connected through hyperedge HE-4 (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"
    - "simultaneous computation of the row and column rank profiles"
    - "fast generalized bruhat decomposition"

Connected through hyperedge HE-5 (induced by source paper "solving equations and optimization problems with uncertainty"):
  with members:
    - "robust satisfiability of systems of equations"
    - "extendability of continuous maps is undecidable"
    - "quasi decidability of a fragment of the first order theory of real numbers"
    - "polynomial time homology for simplicial eilenberg maclane spaces"
    - "effective topological degree computation based on interval arithmetic"
    - "computing all maps into a sphere"
    - "homology and robustness of level and interlevel sets"

Connected through hyperedge HE-6 (induced by source paper "computing the rank profile matrix"):
  with members:
    - "parallel computation of echelon forms"
    - "simultaneous computation of the row and column rank profiles"
    - "fast generalized bruhat decomposition"

Connected through hyperedge HE-7 (induced by source paper "parallel computation of echelon forms"):
  with members:
    - "simultaneous computation of the row and column rank profiles"
    - "a class of parallel tiled linear algebra algorithms for multicore architectures"

Connected through hyperedge HE-8 (induced by source paper "simultaneous computation of the row and column rank profiles"):
  with members:
    - "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.MS(Mathematical Software)