{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:64GHVYDNW6H3GGDGLYPUQRSCND","short_pith_number":"pith:64GHVYDN","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"},"canonical_sha256":"f70c7ae06db78fb318665e1f48464268cd6a1cd0589beb54beab467e9bc0f5b8","source":{"kind":"arxiv","id":"1501.05239","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.05239","created_at":"2026-05-18T01:35:00Z"},{"alias_kind":"arxiv_version","alias_value":"1501.05239v2","created_at":"2026-05-18T01:35:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.05239","created_at":"2026-05-18T01:35:00Z"},{"alias_kind":"pith_short_12","alias_value":"64GHVYDNW6H3","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"64GHVYDNW6H3GGDG","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"64GHVYDN","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:64GHVYDNW6H3GGDGLYPUQRSCND","target":"record","payload":{"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"},"canonical_sha256":"f70c7ae06db78fb318665e1f48464268cd6a1cd0589beb54beab467e9bc0f5b8","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"},"source_kind":"arxiv","source_id":"1501.05239","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:35:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o0QqICUtx1qa00LvJ3MmPM1qxrL9rC3BPfz6C+V12Ol0aueNeRlXa+CTWmzel5cyM6Q0L06YF9DGPjh9FxzGAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:49:20.875163Z"},"content_sha256":"95c4e5da2053278eec9190ec02ffb1d70be14a4c6fa8edbdbea956036f4462e1","schema_version":"1.0","event_id":"sha256:95c4e5da2053278eec9190ec02ffb1d70be14a4c6fa8edbdbea956036f4462e1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:64GHVYDNW6H3GGDGLYPUQRSCND","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:35:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zTN1PzXPv5Yjss9bMXniiSxCKYoU5zZYoyh7uO3ien/BMF36hXAiQZ8QSig0dVsKCPgVrKBy/IxcguOoT/1NAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:49:20.875517Z"},"content_sha256":"b04eb2341111ecf8aad3d13a255958aa22b20c11bba215baa0ec602a44b3e18f","schema_version":"1.0","event_id":"sha256:b04eb2341111ecf8aad3d13a255958aa22b20c11bba215baa0ec602a44b3e18f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/64GHVYDNW6H3GGDGLYPUQRSCND/bundle.json","state_url":"https://pith.science/pith/64GHVYDNW6H3GGDGLYPUQRSCND/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/64GHVYDNW6H3GGDGLYPUQRSCND/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-03T06:49:20Z","links":{"resolver":"https://pith.science/pith/64GHVYDNW6H3GGDGLYPUQRSCND","bundle":"https://pith.science/pith/64GHVYDNW6H3GGDGLYPUQRSCND/bundle.json","state":"https://pith.science/pith/64GHVYDNW6H3GGDGLYPUQRSCND/state.json","well_known_bundle":"https://pith.science/.well-known/pith/64GHVYDNW6H3GGDGLYPUQRSCND/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:64GHVYDNW6H3GGDGLYPUQRSCND","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"95596ba93aedbb220f4e16b8e29c031ee91b57e4a51b2fe09cd573d0946f8340","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2015-01-21T17:31:13Z","title_canon_sha256":"9198b39ee6aeceba085cd01a300d19fcc4b0ad9b82eaf206f81554abd2d4be18"},"schema_version":"1.0","source":{"id":"1501.05239","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.05239","created_at":"2026-05-18T01:35:00Z"},{"alias_kind":"arxiv_version","alias_value":"1501.05239v2","created_at":"2026-05-18T01:35:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.05239","created_at":"2026-05-18T01:35:00Z"},{"alias_kind":"pith_short_12","alias_value":"64GHVYDNW6H3","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"64GHVYDNW6H3GGDG","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"64GHVYDN","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:b04eb2341111ecf8aad3d13a255958aa22b20c11bba215baa0ec602a44b3e18f","target":"graph","created_at":"2026-05-18T01:35:00Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"ARIC), Cl\\'ement Pernet (MOAIS, Jean-Guillaume Dumas (LJK), LJK), Ziad Sultan (MOAIS","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2015-01-21T17:31:13Z","title":"Computing the Rank Profile Matrix"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.05239","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:95c4e5da2053278eec9190ec02ffb1d70be14a4c6fa8edbdbea956036f4462e1","target":"record","created_at":"2026-05-18T01:35:00Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"95596ba93aedbb220f4e16b8e29c031ee91b57e4a51b2fe09cd573d0946f8340","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2015-01-21T17:31:13Z","title_canon_sha256":"9198b39ee6aeceba085cd01a300d19fcc4b0ad9b82eaf206f81554abd2d4be18"},"schema_version":"1.0","source":{"id":"1501.05239","kind":"arxiv","version":2}},"canonical_sha256":"f70c7ae06db78fb318665e1f48464268cd6a1cd0589beb54beab467e9bc0f5b8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f70c7ae06db78fb318665e1f48464268cd6a1cd0589beb54beab467e9bc0f5b8","first_computed_at":"2026-05-18T01:35:00.770866Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:00.770866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"A58WbJzYm9W/HeIVNrWet97Y24SGdkF4LlVkCQQggIq5FyUxbpjD7IILmaxLAxMlChNe6BjaxomIPm7VlOPPAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:00.771561Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.05239","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:95c4e5da2053278eec9190ec02ffb1d70be14a4c6fa8edbdbea956036f4462e1","sha256:b04eb2341111ecf8aad3d13a255958aa22b20c11bba215baa0ec602a44b3e18f"],"state_sha256":"17ff19713c336a41e5f326b2a211b4d009e91c955fee7c7d1027b757fef65a30"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jb1IwKBOb2Sw/rVzPutVv2AdbX+GPEtkRnLIL5/uvmSvmHiSqUmNSQ44T5YR/9Cjv3PkRYVF8w47E5lFjSFpDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T06:49:20.877451Z","bundle_sha256":"ceaca056c6d035727177fc61bfd6d4299c8186cecf9015523a278e2d31e1bc13"}}