{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:64GHVYDNW6H3GGDGLYPUQRSCND","short_pith_number":"pith:64GHVYDN","schema_version":"1.0","canonical_sha256":"f70c7ae06db78fb318665e1f48464268cd6a1cd0589beb54beab467e9bc0f5b8","source":{"kind":"arxiv","id":"1501.05239","version":2},"attestation_state":"computed","paper":{"title":"Computing the Rank Profile Matrix","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"ARIC), Cl\\'ement Pernet (MOAIS, Jean-Guillaume Dumas (LJK), LJK), Ziad Sultan (MOAIS","submitted_at":"2015-01-21T17:31:13Z","abstract_excerpt":"The row (resp. column) rank profile of a matrix describes the staircase shape of its row (resp. column) echelon form. In an ISSAC'13 paper, we proposed a recursive Gaussian elimination that can compute simultaneously the row and column rank profiles of a matrix as well as those of all of its leading sub-matrices, in the same time as state of the art Gaussian elimination algorithms. Here we first study the conditions making a Gaus-sian elimination algorithm reveal this information. Therefore, we propose the definition of a new matrix invariant, the rank profile matrix, summarizing all informati"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1501.05239","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2015-01-21T17:31:13Z","cross_cats_sorted":[],"title_canon_sha256":"9198b39ee6aeceba085cd01a300d19fcc4b0ad9b82eaf206f81554abd2d4be18","abstract_canon_sha256":"95596ba93aedbb220f4e16b8e29c031ee91b57e4a51b2fe09cd573d0946f8340"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:00.771561Z","signature_b64":"A58WbJzYm9W/HeIVNrWet97Y24SGdkF4LlVkCQQggIq5FyUxbpjD7IILmaxLAxMlChNe6BjaxomIPm7VlOPPAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f70c7ae06db78fb318665e1f48464268cd6a1cd0589beb54beab467e9bc0f5b8","last_reissued_at":"2026-05-18T01:35:00.770866Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:00.770866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing the Rank Profile Matrix","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"ARIC), Cl\\'ement Pernet (MOAIS, Jean-Guillaume Dumas (LJK), LJK), Ziad Sultan (MOAIS","submitted_at":"2015-01-21T17:31:13Z","abstract_excerpt":"The row (resp. column) rank profile of a matrix describes the staircase shape of its row (resp. column) echelon form. In an ISSAC'13 paper, we proposed a recursive Gaussian elimination that can compute simultaneously the row and column rank profiles of a matrix as well as those of all of its leading sub-matrices, in the same time as state of the art Gaussian elimination algorithms. Here we first study the conditions making a Gaus-sian elimination algorithm reveal this information. Therefore, we propose the definition of a new matrix invariant, the rank profile matrix, summarizing all informati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.05239","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1501.05239","created_at":"2026-05-18T01:35:00.770964+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.05239v2","created_at":"2026-05-18T01:35:00.770964+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.05239","created_at":"2026-05-18T01:35:00.770964+00:00"},{"alias_kind":"pith_short_12","alias_value":"64GHVYDNW6H3","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"64GHVYDNW6H3GGDG","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"64GHVYDN","created_at":"2026-05-18T12:29:07.941421+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/64GHVYDNW6H3GGDGLYPUQRSCND","json":"https://pith.science/pith/64GHVYDNW6H3GGDGLYPUQRSCND.json","graph_json":"https://pith.science/api/pith-number/64GHVYDNW6H3GGDGLYPUQRSCND/graph.json","events_json":"https://pith.science/api/pith-number/64GHVYDNW6H3GGDGLYPUQRSCND/events.json","paper":"https://pith.science/paper/64GHVYDN"},"agent_actions":{"view_html":"https://pith.science/pith/64GHVYDNW6H3GGDGLYPUQRSCND","download_json":"https://pith.science/pith/64GHVYDNW6H3GGDGLYPUQRSCND.json","view_paper":"https://pith.science/paper/64GHVYDN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.05239&json=true","fetch_graph":"https://pith.science/api/pith-number/64GHVYDNW6H3GGDGLYPUQRSCND/graph.json","fetch_events":"https://pith.science/api/pith-number/64GHVYDNW6H3GGDGLYPUQRSCND/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/64GHVYDNW6H3GGDGLYPUQRSCND/action/timestamp_anchor","attest_storage":"https://pith.science/pith/64GHVYDNW6H3GGDGLYPUQRSCND/action/storage_attestation","attest_author":"https://pith.science/pith/64GHVYDNW6H3GGDGLYPUQRSCND/action/author_attestation","sign_citation":"https://pith.science/pith/64GHVYDNW6H3GGDGLYPUQRSCND/action/citation_signature","submit_replication":"https://pith.science/pith/64GHVYDNW6H3GGDGLYPUQRSCND/action/replication_record"}},"created_at":"2026-05-18T01:35:00.770964+00:00","updated_at":"2026-05-18T01:35:00.770964+00:00"}