{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:B3SFQYE5KNJ3QAYP5E6TFRCGVS","short_pith_number":"pith:B3SFQYE5","canonical_record":{"source":{"id":"1812.06007","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-12-14T16:22:18Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"73704b391ea3dbb298fd290ef64c18e2623d61096d28345bd89723ff7e151857","abstract_canon_sha256":"b3424d4d6177ca278271ecd85169fc0b482c86a2abc4e0bd51464a5f3a690efe"},"schema_version":"1.0"},"canonical_sha256":"0ee458609d5353b8030fe93d32c446acbbfe0fd9ea144355af78d866c0b6c894","source":{"kind":"arxiv","id":"1812.06007","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.06007","created_at":"2026-05-17T23:58:15Z"},{"alias_kind":"arxiv_version","alias_value":"1812.06007v1","created_at":"2026-05-17T23:58:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.06007","created_at":"2026-05-17T23:58:15Z"},{"alias_kind":"pith_short_12","alias_value":"B3SFQYE5KNJ3","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"B3SFQYE5KNJ3QAYP","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"B3SFQYE5","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:B3SFQYE5KNJ3QAYP5E6TFRCGVS","target":"record","payload":{"canonical_record":{"source":{"id":"1812.06007","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-12-14T16:22:18Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"73704b391ea3dbb298fd290ef64c18e2623d61096d28345bd89723ff7e151857","abstract_canon_sha256":"b3424d4d6177ca278271ecd85169fc0b482c86a2abc4e0bd51464a5f3a690efe"},"schema_version":"1.0"},"canonical_sha256":"0ee458609d5353b8030fe93d32c446acbbfe0fd9ea144355af78d866c0b6c894","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:15.794180Z","signature_b64":"kjzDycGu8Tdegh3uxhVtxyOqT38R4Uu6ZbaC6hE3t6eY7SiQe2VJytYP/2ODJZiOfkAzHESQkh9E2oVmPULCCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ee458609d5353b8030fe93d32c446acbbfe0fd9ea144355af78d866c0b6c894","last_reissued_at":"2026-05-17T23:58:15.793726Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:15.793726Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.06007","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-17T23:58:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ltafnEKnQTemzVF+5XHXXzOcpA0OoVnGDT88Uyvx0fbhxp5vkcfRHVuoKDE2oXdr5VBpGwjcGaRjzvO4KZA6CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:19:35.819028Z"},"content_sha256":"8aa48b195c5ab7f4f2ef385254496b4c69d75c75a1996af109dbfd8f720e47d5","schema_version":"1.0","event_id":"sha256:8aa48b195c5ab7f4f2ef385254496b4c69d75c75a1996af109dbfd8f720e47d5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:B3SFQYE5KNJ3QAYP5E6TFRCGVS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The PowerURV algorithm for computing rank-revealing full factorizations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Abinand Gopal, Per-Gunnar Martinsson","submitted_at":"2018-12-14T16:22:18Z","abstract_excerpt":"Many applications in scientific computing and data science require the computation of a rank-revealing factorization of a large matrix. In many of these instances the classical algorithms for computing the singular value decomposition are prohibitively computationally expensive. The randomized singular value decomposition can often be helpful, but is not effective unless the numerical rank of the matrix is substantially smaller than the dimensions of the matrix. We introduce a new randomized algorithm for producing rank-revealing factorizations based on existing work by Demmel, Dumitriu and Ho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.06007","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-17T23:58:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hwtQYrUVxqAushMey5HfWQMipRLhBsmyI+xt69vNFOephDZFG9O2heg2SN1DKGWtoiY3M/3+bym9ZyRUXo9zDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:19:35.819395Z"},"content_sha256":"5394c5fc4e6c269605c89b074e81cd70bf7c82c97ed10e98a782cfab7a7ecd05","schema_version":"1.0","event_id":"sha256:5394c5fc4e6c269605c89b074e81cd70bf7c82c97ed10e98a782cfab7a7ecd05"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B3SFQYE5KNJ3QAYP5E6TFRCGVS/bundle.json","state_url":"https://pith.science/pith/B3SFQYE5KNJ3QAYP5E6TFRCGVS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B3SFQYE5KNJ3QAYP5E6TFRCGVS/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-01T20:19:35Z","links":{"resolver":"https://pith.science/pith/B3SFQYE5KNJ3QAYP5E6TFRCGVS","bundle":"https://pith.science/pith/B3SFQYE5KNJ3QAYP5E6TFRCGVS/bundle.json","state":"https://pith.science/pith/B3SFQYE5KNJ3QAYP5E6TFRCGVS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B3SFQYE5KNJ3QAYP5E6TFRCGVS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:B3SFQYE5KNJ3QAYP5E6TFRCGVS","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":"b3424d4d6177ca278271ecd85169fc0b482c86a2abc4e0bd51464a5f3a690efe","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-12-14T16:22:18Z","title_canon_sha256":"73704b391ea3dbb298fd290ef64c18e2623d61096d28345bd89723ff7e151857"},"schema_version":"1.0","source":{"id":"1812.06007","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.06007","created_at":"2026-05-17T23:58:15Z"},{"alias_kind":"arxiv_version","alias_value":"1812.06007v1","created_at":"2026-05-17T23:58:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.06007","created_at":"2026-05-17T23:58:15Z"},{"alias_kind":"pith_short_12","alias_value":"B3SFQYE5KNJ3","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"B3SFQYE5KNJ3QAYP","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"B3SFQYE5","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:5394c5fc4e6c269605c89b074e81cd70bf7c82c97ed10e98a782cfab7a7ecd05","target":"graph","created_at":"2026-05-17T23:58:15Z","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":"Many applications in scientific computing and data science require the computation of a rank-revealing factorization of a large matrix. In many of these instances the classical algorithms for computing the singular value decomposition are prohibitively computationally expensive. The randomized singular value decomposition can often be helpful, but is not effective unless the numerical rank of the matrix is substantially smaller than the dimensions of the matrix. We introduce a new randomized algorithm for producing rank-revealing factorizations based on existing work by Demmel, Dumitriu and Ho","authors_text":"Abinand Gopal, Per-Gunnar Martinsson","cross_cats":["cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-12-14T16:22:18Z","title":"The PowerURV algorithm for computing rank-revealing full factorizations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.06007","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:8aa48b195c5ab7f4f2ef385254496b4c69d75c75a1996af109dbfd8f720e47d5","target":"record","created_at":"2026-05-17T23:58:15Z","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":"b3424d4d6177ca278271ecd85169fc0b482c86a2abc4e0bd51464a5f3a690efe","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-12-14T16:22:18Z","title_canon_sha256":"73704b391ea3dbb298fd290ef64c18e2623d61096d28345bd89723ff7e151857"},"schema_version":"1.0","source":{"id":"1812.06007","kind":"arxiv","version":1}},"canonical_sha256":"0ee458609d5353b8030fe93d32c446acbbfe0fd9ea144355af78d866c0b6c894","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0ee458609d5353b8030fe93d32c446acbbfe0fd9ea144355af78d866c0b6c894","first_computed_at":"2026-05-17T23:58:15.793726Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:15.793726Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kjzDycGu8Tdegh3uxhVtxyOqT38R4Uu6ZbaC6hE3t6eY7SiQe2VJytYP/2ODJZiOfkAzHESQkh9E2oVmPULCCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:15.794180Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.06007","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8aa48b195c5ab7f4f2ef385254496b4c69d75c75a1996af109dbfd8f720e47d5","sha256:5394c5fc4e6c269605c89b074e81cd70bf7c82c97ed10e98a782cfab7a7ecd05"],"state_sha256":"8383f0d574bb0fc3aeea153dad2c7279698c6d0e1a4ed1d4a9a0381b2ad71b6b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EC35pGhRgI/7SJerwhIhn/mEEqsZCxEjF05YXSOk7xiYEHxGeR8AVCMja5V6jSZyiaIh4qJiCmh9ZIQDV5O7Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T20:19:35.821333Z","bundle_sha256":"377007f2159a1cb45d9c8a5ca9a5ecdda21818953f8cada1247c6678fa8248bc"}}