{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:R5AD6CFO3NWRIHXOEVGBIJSUHP","short_pith_number":"pith:R5AD6CFO","canonical_record":{"source":{"id":"0909.4061","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2009-09-22T18:35:27Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"254a38aee7c5a5a80dbddc80fa23f54538e4ef6c2cc400d9270e514cf8ee60b3","abstract_canon_sha256":"3faaaf15e6c883c5396f9fb0c7ad88c909ac5ccf04341ec6d4bef41417aa357b"},"schema_version":"1.0"},"canonical_sha256":"8f403f08aedb6d141eee254c1426543bf8f2b6c8fe2cf6640e321d82884f2945","source":{"kind":"arxiv","id":"0909.4061","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0909.4061","created_at":"2026-05-18T02:53:16Z"},{"alias_kind":"arxiv_version","alias_value":"0909.4061v2","created_at":"2026-05-18T02:53:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0909.4061","created_at":"2026-05-18T02:53:16Z"},{"alias_kind":"pith_short_12","alias_value":"R5AD6CFO3NWR","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"R5AD6CFO3NWRIHXO","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"R5AD6CFO","created_at":"2026-05-18T12:26:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:R5AD6CFO3NWRIHXOEVGBIJSUHP","target":"record","payload":{"canonical_record":{"source":{"id":"0909.4061","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2009-09-22T18:35:27Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"254a38aee7c5a5a80dbddc80fa23f54538e4ef6c2cc400d9270e514cf8ee60b3","abstract_canon_sha256":"3faaaf15e6c883c5396f9fb0c7ad88c909ac5ccf04341ec6d4bef41417aa357b"},"schema_version":"1.0"},"canonical_sha256":"8f403f08aedb6d141eee254c1426543bf8f2b6c8fe2cf6640e321d82884f2945","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:16.020758Z","signature_b64":"MFHUxuox7AYAYWWu6tB582lzA5VaUmYnPQJ1Am2UObdZMIXKwo+OMljRSAy8dec82SuSjjGL1AGQKnTLgloSBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f403f08aedb6d141eee254c1426543bf8f2b6c8fe2cf6640e321d82884f2945","last_reissued_at":"2026-05-18T02:53:16.020144Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:16.020144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0909.4061","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-18T02:53:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DiGznJwO8wA9DNpt7tgoDw/jXLT7IQrD24up+F2yRLUnwOrpJZ01iLANret5VKvWHsXvunds1B5bEBp8GF9GDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:43:10.868044Z"},"content_sha256":"2d2d14b85f705f1aa0c39aa61b0144b8ffdc9db6977d03a2a24255bff7fdf618","schema_version":"1.0","event_id":"sha256:2d2d14b85f705f1aa0c39aa61b0144b8ffdc9db6977d03a2a24255bff7fdf618"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:R5AD6CFO3NWRIHXOEVGBIJSUHP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.NA","authors_text":"Joel A. Tropp, Nathan Halko, Per-Gunnar Martinsson","submitted_at":"2009-09-22T18:35:27Z","abstract_excerpt":"Low-rank matrix approximations, such as the truncated singular value decomposition and the rank-revealing QR decomposition, play a central role in data analysis and scientific computing. This work surveys and extends recent research which demonstrates that randomization offers a powerful tool for performing low-rank matrix approximation. These techniques exploit modern computational architectures more fully than classical methods and open the possibility of dealing with truly massive data sets.\n  This paper presents a modular framework for constructing randomized algorithms that compute partia"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0909.4061","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-18T02:53:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EefTIughfzMWYA9obZDJRlPmTuwhgeAjlRT0+dTnu5QcBqHgHnfUg6oKAmT1xWDs85nuoTcO11B2aFqTeh4ZBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:43:10.868713Z"},"content_sha256":"d7608c6bfa2fbcd2ea4239888fb4e8f177d77a0a6978b0ca5ad581c822db1e7d","schema_version":"1.0","event_id":"sha256:d7608c6bfa2fbcd2ea4239888fb4e8f177d77a0a6978b0ca5ad581c822db1e7d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R5AD6CFO3NWRIHXOEVGBIJSUHP/bundle.json","state_url":"https://pith.science/pith/R5AD6CFO3NWRIHXOEVGBIJSUHP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R5AD6CFO3NWRIHXOEVGBIJSUHP/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-27T09:43:10Z","links":{"resolver":"https://pith.science/pith/R5AD6CFO3NWRIHXOEVGBIJSUHP","bundle":"https://pith.science/pith/R5AD6CFO3NWRIHXOEVGBIJSUHP/bundle.json","state":"https://pith.science/pith/R5AD6CFO3NWRIHXOEVGBIJSUHP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R5AD6CFO3NWRIHXOEVGBIJSUHP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:R5AD6CFO3NWRIHXOEVGBIJSUHP","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":"3faaaf15e6c883c5396f9fb0c7ad88c909ac5ccf04341ec6d4bef41417aa357b","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2009-09-22T18:35:27Z","title_canon_sha256":"254a38aee7c5a5a80dbddc80fa23f54538e4ef6c2cc400d9270e514cf8ee60b3"},"schema_version":"1.0","source":{"id":"0909.4061","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0909.4061","created_at":"2026-05-18T02:53:16Z"},{"alias_kind":"arxiv_version","alias_value":"0909.4061v2","created_at":"2026-05-18T02:53:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0909.4061","created_at":"2026-05-18T02:53:16Z"},{"alias_kind":"pith_short_12","alias_value":"R5AD6CFO3NWR","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"R5AD6CFO3NWRIHXO","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"R5AD6CFO","created_at":"2026-05-18T12:26:01Z"}],"graph_snapshots":[{"event_id":"sha256:d7608c6bfa2fbcd2ea4239888fb4e8f177d77a0a6978b0ca5ad581c822db1e7d","target":"graph","created_at":"2026-05-18T02:53:16Z","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":"Low-rank matrix approximations, such as the truncated singular value decomposition and the rank-revealing QR decomposition, play a central role in data analysis and scientific computing. This work surveys and extends recent research which demonstrates that randomization offers a powerful tool for performing low-rank matrix approximation. These techniques exploit modern computational architectures more fully than classical methods and open the possibility of dealing with truly massive data sets.\n  This paper presents a modular framework for constructing randomized algorithms that compute partia","authors_text":"Joel A. Tropp, Nathan Halko, Per-Gunnar Martinsson","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2009-09-22T18:35:27Z","title":"Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0909.4061","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:2d2d14b85f705f1aa0c39aa61b0144b8ffdc9db6977d03a2a24255bff7fdf618","target":"record","created_at":"2026-05-18T02:53:16Z","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":"3faaaf15e6c883c5396f9fb0c7ad88c909ac5ccf04341ec6d4bef41417aa357b","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2009-09-22T18:35:27Z","title_canon_sha256":"254a38aee7c5a5a80dbddc80fa23f54538e4ef6c2cc400d9270e514cf8ee60b3"},"schema_version":"1.0","source":{"id":"0909.4061","kind":"arxiv","version":2}},"canonical_sha256":"8f403f08aedb6d141eee254c1426543bf8f2b6c8fe2cf6640e321d82884f2945","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8f403f08aedb6d141eee254c1426543bf8f2b6c8fe2cf6640e321d82884f2945","first_computed_at":"2026-05-18T02:53:16.020144Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:53:16.020144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MFHUxuox7AYAYWWu6tB582lzA5VaUmYnPQJ1Am2UObdZMIXKwo+OMljRSAy8dec82SuSjjGL1AGQKnTLgloSBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:53:16.020758Z","signed_message":"canonical_sha256_bytes"},"source_id":"0909.4061","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2d2d14b85f705f1aa0c39aa61b0144b8ffdc9db6977d03a2a24255bff7fdf618","sha256:d7608c6bfa2fbcd2ea4239888fb4e8f177d77a0a6978b0ca5ad581c822db1e7d"],"state_sha256":"e3341a0f965f53aa1cc5a4ec859a667da84286b98e36cc83a03ccd676b0195a4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dB1QgC0BPWjdOo0J7jWgoA/e2YPMYr+HI9mi+88dCXtrMdkGUzmBJ0G0qHlqu+XSGl+V+i05bKjXwR4mITUvDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T09:43:10.871520Z","bundle_sha256":"d78125183aae1c85a91f434a9a1a15595121cacdb6bedb53458a6b630059cd6c"}}