{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:HFASEPD7U3NODDLUXKZTZFQHU6","short_pith_number":"pith:HFASEPD7","canonical_record":{"source":{"id":"1505.08115","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-05-29T17:31:35Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"7c63624bfe21b03514b89f8f677a8ae9ce42bb568879cc586e8d4d0e2b350754","abstract_canon_sha256":"c9ef6809454a70f5f6afea33e4e30feffde7bb0a5187f3e3018de9cbd2ba2ccb"},"schema_version":"1.0"},"canonical_sha256":"3941223c7fa6dae18d74bab33c9607a7ada91aee3e4546ea57964664dc71370c","source":{"kind":"arxiv","id":"1505.08115","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.08115","created_at":"2026-05-18T01:59:59Z"},{"alias_kind":"arxiv_version","alias_value":"1505.08115v1","created_at":"2026-05-18T01:59:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.08115","created_at":"2026-05-18T01:59:59Z"},{"alias_kind":"pith_short_12","alias_value":"HFASEPD7U3NO","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HFASEPD7U3NODDLU","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HFASEPD7","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:HFASEPD7U3NODDLUXKZTZFQHU6","target":"record","payload":{"canonical_record":{"source":{"id":"1505.08115","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-05-29T17:31:35Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"7c63624bfe21b03514b89f8f677a8ae9ce42bb568879cc586e8d4d0e2b350754","abstract_canon_sha256":"c9ef6809454a70f5f6afea33e4e30feffde7bb0a5187f3e3018de9cbd2ba2ccb"},"schema_version":"1.0"},"canonical_sha256":"3941223c7fa6dae18d74bab33c9607a7ada91aee3e4546ea57964664dc71370c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:59:59.653598Z","signature_b64":"ME0Tsk3UCmKGc1az86636qIqobtB6G4DJq1pB1TEVkeZlExwVzHsAkagM3MxiDd/mZLclfWFVE/gtANRstrYBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3941223c7fa6dae18d74bab33c9607a7ada91aee3e4546ea57964664dc71370c","last_reissued_at":"2026-05-18T01:59:59.653090Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:59:59.653090Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.08115","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-18T01:59:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q3MtuIw6soFcECzx22lrtOmLfcRhUn1GybGAhmHxlxDn2yC9U9+R15Y4BLn4FDFftOSMyDCArKd8mMY5tkXvCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:24:21.484057Z"},"content_sha256":"567dd9d9940ca05ba55db133a32335dcc0a96f6f2500b9c4fdcd296ff6431152","schema_version":"1.0","event_id":"sha256:567dd9d9940ca05ba55db133a32335dcc0a96f6f2500b9c4fdcd296ff6431152"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:HFASEPD7U3NODDLUXKZTZFQHU6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Blocked rank-revealing QR factorizations: How randomized sampling can be used to avoid single-vector pivoting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"P.G. Martinsson","submitted_at":"2015-05-29T17:31:35Z","abstract_excerpt":"Given a matrix $A$ of size $m\\times n$, the manuscript describes a algorithm for computing a QR factorization $AP=QR$ where $P$ is a permutation matrix, $Q$ is orthonormal, and $R$ is upper triangular. The algorithm is blocked, to allow it to be implemented efficiently. The need for single vector pivoting in classical algorithms for computing QR factorizations is avoided by the use of randomized sampling to find blocks of pivot vectors at once. The advantage of blocking becomes particularly pronounced when $A$ is very large, and possibly stored out-of-core, or on a distributed memory machine. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.08115","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-18T01:59:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TXFDswvGSUUUMn/9akFhKiqWROrcyF3BxmtIj7bQMP8n3UWTbynWFh9TOE6VNbOt3fci7Fuxg92Zp7QNorMeAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:24:21.484757Z"},"content_sha256":"e7c93e630c5c1acba0876ad2e9ee740737db6c76b47098be4129f3da6d94aadd","schema_version":"1.0","event_id":"sha256:e7c93e630c5c1acba0876ad2e9ee740737db6c76b47098be4129f3da6d94aadd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HFASEPD7U3NODDLUXKZTZFQHU6/bundle.json","state_url":"https://pith.science/pith/HFASEPD7U3NODDLUXKZTZFQHU6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HFASEPD7U3NODDLUXKZTZFQHU6/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-05-30T14:24:21Z","links":{"resolver":"https://pith.science/pith/HFASEPD7U3NODDLUXKZTZFQHU6","bundle":"https://pith.science/pith/HFASEPD7U3NODDLUXKZTZFQHU6/bundle.json","state":"https://pith.science/pith/HFASEPD7U3NODDLUXKZTZFQHU6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HFASEPD7U3NODDLUXKZTZFQHU6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:HFASEPD7U3NODDLUXKZTZFQHU6","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":"c9ef6809454a70f5f6afea33e4e30feffde7bb0a5187f3e3018de9cbd2ba2ccb","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-05-29T17:31:35Z","title_canon_sha256":"7c63624bfe21b03514b89f8f677a8ae9ce42bb568879cc586e8d4d0e2b350754"},"schema_version":"1.0","source":{"id":"1505.08115","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.08115","created_at":"2026-05-18T01:59:59Z"},{"alias_kind":"arxiv_version","alias_value":"1505.08115v1","created_at":"2026-05-18T01:59:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.08115","created_at":"2026-05-18T01:59:59Z"},{"alias_kind":"pith_short_12","alias_value":"HFASEPD7U3NO","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HFASEPD7U3NODDLU","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HFASEPD7","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:e7c93e630c5c1acba0876ad2e9ee740737db6c76b47098be4129f3da6d94aadd","target":"graph","created_at":"2026-05-18T01:59:59Z","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":"Given a matrix $A$ of size $m\\times n$, the manuscript describes a algorithm for computing a QR factorization $AP=QR$ where $P$ is a permutation matrix, $Q$ is orthonormal, and $R$ is upper triangular. The algorithm is blocked, to allow it to be implemented efficiently. The need for single vector pivoting in classical algorithms for computing QR factorizations is avoided by the use of randomized sampling to find blocks of pivot vectors at once. The advantage of blocking becomes particularly pronounced when $A$ is very large, and possibly stored out-of-core, or on a distributed memory machine. ","authors_text":"P.G. Martinsson","cross_cats":["cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-05-29T17:31:35Z","title":"Blocked rank-revealing QR factorizations: How randomized sampling can be used to avoid single-vector pivoting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.08115","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:567dd9d9940ca05ba55db133a32335dcc0a96f6f2500b9c4fdcd296ff6431152","target":"record","created_at":"2026-05-18T01:59:59Z","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":"c9ef6809454a70f5f6afea33e4e30feffde7bb0a5187f3e3018de9cbd2ba2ccb","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-05-29T17:31:35Z","title_canon_sha256":"7c63624bfe21b03514b89f8f677a8ae9ce42bb568879cc586e8d4d0e2b350754"},"schema_version":"1.0","source":{"id":"1505.08115","kind":"arxiv","version":1}},"canonical_sha256":"3941223c7fa6dae18d74bab33c9607a7ada91aee3e4546ea57964664dc71370c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3941223c7fa6dae18d74bab33c9607a7ada91aee3e4546ea57964664dc71370c","first_computed_at":"2026-05-18T01:59:59.653090Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:59:59.653090Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ME0Tsk3UCmKGc1az86636qIqobtB6G4DJq1pB1TEVkeZlExwVzHsAkagM3MxiDd/mZLclfWFVE/gtANRstrYBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:59:59.653598Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.08115","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:567dd9d9940ca05ba55db133a32335dcc0a96f6f2500b9c4fdcd296ff6431152","sha256:e7c93e630c5c1acba0876ad2e9ee740737db6c76b47098be4129f3da6d94aadd"],"state_sha256":"0f167a54adb41304b88e0ce1f005080f02005e3d3ea408ec159dfe16df2305d0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dENUYXN0L91r8U5SYCipjK8j+dGFjm3qwM0Zj7GmXreh6ttaKLjMBgYpSAhwruKs1GZKQG9Bl1tx6fZj+DqoAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T14:24:21.488156Z","bundle_sha256":"af4b58efb9a75daa31cce3d81fd727764ec6ffbaad4bc3bd889f9db97e8bf960"}}