{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:KRXO2EHNF4TPU64W2Y37KNL6OP","short_pith_number":"pith:KRXO2EHN","canonical_record":{"source":{"id":"1301.4438","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2013-01-18T17:23:01Z","cross_cats_sorted":["cs.MS"],"title_canon_sha256":"d66a19c97072220d4afd3c6b7c4b43802f2b938ad60b30297765fa929105062d","abstract_canon_sha256":"bcb361c6d15fedf3f79efb5d89b6ca1bcb6a475317c5e8ea9f9a5c9d16984e61"},"schema_version":"1.0"},"canonical_sha256":"546eed10ed2f26fa7b96d637f5357e73f640a88aab1a5fd55fc107f4b0e33ff9","source":{"kind":"arxiv","id":"1301.4438","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.4438","created_at":"2026-05-18T03:25:25Z"},{"alias_kind":"arxiv_version","alias_value":"1301.4438v1","created_at":"2026-05-18T03:25:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.4438","created_at":"2026-05-18T03:25:25Z"},{"alias_kind":"pith_short_12","alias_value":"KRXO2EHNF4TP","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"KRXO2EHNF4TPU64W","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"KRXO2EHN","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:KRXO2EHNF4TPU64W2Y37KNL6OP","target":"record","payload":{"canonical_record":{"source":{"id":"1301.4438","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2013-01-18T17:23:01Z","cross_cats_sorted":["cs.MS"],"title_canon_sha256":"d66a19c97072220d4afd3c6b7c4b43802f2b938ad60b30297765fa929105062d","abstract_canon_sha256":"bcb361c6d15fedf3f79efb5d89b6ca1bcb6a475317c5e8ea9f9a5c9d16984e61"},"schema_version":"1.0"},"canonical_sha256":"546eed10ed2f26fa7b96d637f5357e73f640a88aab1a5fd55fc107f4b0e33ff9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:25.283030Z","signature_b64":"ZI7NY81ww0Zt58HIjc8dKFrNplQqUZonDGEmNX2vgdo9jmYb9BDDUO8ahq+q667xgKVd5zc3UDcoDPX0TKKkAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"546eed10ed2f26fa7b96d637f5357e73f640a88aab1a5fd55fc107f4b0e33ff9","last_reissued_at":"2026-05-18T03:25:25.282422Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:25.282422Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.4438","source_version":1,"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-18T03:25:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cCrUH4RnNkvksiPdQWBxx8ZsnLJSjQfYbfIxLbLAOUrCAlg36CaFLZptlvEXJvE7q3NbKlCzgPY5iOyIam/8CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:32:39.415139Z"},"content_sha256":"29bb1c4716248835c5360bd6e55824c9d3b0e37084d2598ff44c547446464a58","schema_version":"1.0","event_id":"sha256:29bb1c4716248835c5360bd6e55824c9d3b0e37084d2598ff44c547446464a58"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:KRXO2EHNF4TPU64W2Y37KNL6OP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simultaneous computation of the row and column rank profiles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS"],"primary_cat":"cs.NA","authors_text":"Cl\\'ement Pernet (INRIA Grenoble Rh\\^one-Alpes / LIG Laboratoire d'Informatique de Grenoble), INRIA Grenoble Rh\\^one-Alpes / LIG Laboratoire d'Informatique de Grenoble), Jean-Guillaume Dumas (LJK), Ziad Sultan (LJK","submitted_at":"2013-01-18T17:23:01Z","abstract_excerpt":"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 o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.4438","kind":"arxiv","version":1},"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-18T03:25:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lBdgbhZfQ+B765ym9/BtGcOKq4dtspPbAOmgF6JDB38lkWe7Vv3J1xs5kS2DtqGxZHQasHqBW7QxqnBj0ScDCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:32:39.415504Z"},"content_sha256":"05fd311638d3fb381dd2b91e73716db01102b8fd0fef9a65a0ffa921d630bb98","schema_version":"1.0","event_id":"sha256:05fd311638d3fb381dd2b91e73716db01102b8fd0fef9a65a0ffa921d630bb98"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KRXO2EHNF4TPU64W2Y37KNL6OP/bundle.json","state_url":"https://pith.science/pith/KRXO2EHNF4TPU64W2Y37KNL6OP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KRXO2EHNF4TPU64W2Y37KNL6OP/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-03T05:32:39Z","links":{"resolver":"https://pith.science/pith/KRXO2EHNF4TPU64W2Y37KNL6OP","bundle":"https://pith.science/pith/KRXO2EHNF4TPU64W2Y37KNL6OP/bundle.json","state":"https://pith.science/pith/KRXO2EHNF4TPU64W2Y37KNL6OP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KRXO2EHNF4TPU64W2Y37KNL6OP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:KRXO2EHNF4TPU64W2Y37KNL6OP","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":"bcb361c6d15fedf3f79efb5d89b6ca1bcb6a475317c5e8ea9f9a5c9d16984e61","cross_cats_sorted":["cs.MS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2013-01-18T17:23:01Z","title_canon_sha256":"d66a19c97072220d4afd3c6b7c4b43802f2b938ad60b30297765fa929105062d"},"schema_version":"1.0","source":{"id":"1301.4438","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.4438","created_at":"2026-05-18T03:25:25Z"},{"alias_kind":"arxiv_version","alias_value":"1301.4438v1","created_at":"2026-05-18T03:25:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.4438","created_at":"2026-05-18T03:25:25Z"},{"alias_kind":"pith_short_12","alias_value":"KRXO2EHNF4TP","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"KRXO2EHNF4TPU64W","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"KRXO2EHN","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:05fd311638d3fb381dd2b91e73716db01102b8fd0fef9a65a0ffa921d630bb98","target":"graph","created_at":"2026-05-18T03:25:25Z","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":"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 o","authors_text":"Cl\\'ement Pernet (INRIA Grenoble Rh\\^one-Alpes / LIG Laboratoire d'Informatique de Grenoble), INRIA Grenoble Rh\\^one-Alpes / LIG Laboratoire d'Informatique de Grenoble), Jean-Guillaume Dumas (LJK), Ziad Sultan (LJK","cross_cats":["cs.MS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2013-01-18T17:23:01Z","title":"Simultaneous computation of the row and column rank profiles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.4438","kind":"arxiv","version":1},"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:29bb1c4716248835c5360bd6e55824c9d3b0e37084d2598ff44c547446464a58","target":"record","created_at":"2026-05-18T03:25:25Z","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":"bcb361c6d15fedf3f79efb5d89b6ca1bcb6a475317c5e8ea9f9a5c9d16984e61","cross_cats_sorted":["cs.MS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2013-01-18T17:23:01Z","title_canon_sha256":"d66a19c97072220d4afd3c6b7c4b43802f2b938ad60b30297765fa929105062d"},"schema_version":"1.0","source":{"id":"1301.4438","kind":"arxiv","version":1}},"canonical_sha256":"546eed10ed2f26fa7b96d637f5357e73f640a88aab1a5fd55fc107f4b0e33ff9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"546eed10ed2f26fa7b96d637f5357e73f640a88aab1a5fd55fc107f4b0e33ff9","first_computed_at":"2026-05-18T03:25:25.282422Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:25:25.282422Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZI7NY81ww0Zt58HIjc8dKFrNplQqUZonDGEmNX2vgdo9jmYb9BDDUO8ahq+q667xgKVd5zc3UDcoDPX0TKKkAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:25:25.283030Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.4438","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:29bb1c4716248835c5360bd6e55824c9d3b0e37084d2598ff44c547446464a58","sha256:05fd311638d3fb381dd2b91e73716db01102b8fd0fef9a65a0ffa921d630bb98"],"state_sha256":"4e72a3a36566c1857123d9e7873acc92d7a648edd1c5cd9dcbf7dd5143725ee7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iJOLviGLr88Lq6LvhZrOwFWssNxZLA8pPUU9EGm/r4oavmsvUQQIzeqttGGmUReJKz3e1gPh7TCC4Y3HHehRAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T05:32:39.417481Z","bundle_sha256":"6e57179271f85a7d414bd65a2d0e4331079e7aa0708a9f99d7700267476ba445"}}