{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:QAK27G25SWHORY63KCHUNNRH2Y","short_pith_number":"pith:QAK27G25","canonical_record":{"source":{"id":"1308.5697","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2013-08-26T21:00:35Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"a5b2439ddf3e3304a82c786bc8a489dd40ebeb9dcc86950eec6e90f9266a87c9","abstract_canon_sha256":"4d6a12fbfc09f21711af3cc922ee88436f0d17e4112c7376dd61d88abbee86cc"},"schema_version":"1.0"},"canonical_sha256":"8015af9b5d958ee8e3db508f46b627d615712c108236a3ae33fe84faaa967de4","source":{"kind":"arxiv","id":"1308.5697","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.5697","created_at":"2026-05-18T03:14:51Z"},{"alias_kind":"arxiv_version","alias_value":"1308.5697v1","created_at":"2026-05-18T03:14:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.5697","created_at":"2026-05-18T03:14:51Z"},{"alias_kind":"pith_short_12","alias_value":"QAK27G25SWHO","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QAK27G25SWHORY63","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QAK27G25","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:QAK27G25SWHORY63KCHUNNRH2Y","target":"record","payload":{"canonical_record":{"source":{"id":"1308.5697","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2013-08-26T21:00:35Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"a5b2439ddf3e3304a82c786bc8a489dd40ebeb9dcc86950eec6e90f9266a87c9","abstract_canon_sha256":"4d6a12fbfc09f21711af3cc922ee88436f0d17e4112c7376dd61d88abbee86cc"},"schema_version":"1.0"},"canonical_sha256":"8015af9b5d958ee8e3db508f46b627d615712c108236a3ae33fe84faaa967de4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:14:51.542503Z","signature_b64":"6B9+Vkx4H0OQU9nhchsFzHuS4nIAMaHTzFCQ2W6vXjVkz9dlUN9SKaOvA1pbSacm21Vm5W2hUv9QWbViV5lxDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8015af9b5d958ee8e3db508f46b627d615712c108236a3ae33fe84faaa967de4","last_reissued_at":"2026-05-18T03:14:51.541634Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:14:51.541634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.5697","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:14:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ccpr3AcVItpvz5Z0a+GGXpac/DJ79mJFCP8pgNcGHme42ym6QqBCAn/xQe5uGvVYCurztT2IISSkk15JBAybBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T23:42:52.771133Z"},"content_sha256":"152abdc33863714a1c787c6067161b27dae650e3403108f47071fa2a1b9e3856","schema_version":"1.0","event_id":"sha256:152abdc33863714a1c787c6067161b27dae650e3403108f47071fa2a1b9e3856"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:QAK27G25SWHORY63KCHUNNRH2Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Randomized algorithms for low-rank matrix factorizations: sharp performance bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"cs.NA","authors_text":"Emmanuel Candes, Rafi Witten","submitted_at":"2013-08-26T21:00:35Z","abstract_excerpt":"The development of randomized algorithms for numerical linear algebra, e.g. for computing approximate QR and SVD factorizations, has recently become an intense area of research. This paper studies one of the most frequently discussed algorithms in the literature for dimensionality reduction---specifically for approximating an input matrix with a low-rank element. We introduce a novel and rather intuitive analysis of the algorithm in Martinsson et al. (2008), which allows us to derive sharp estimates and give new insights about its performance. This analysis yields theoretical guarantees about "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.5697","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:14:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JfX6dK7+63pqW05Qb2Nh3TyzUaaKgTeqjfE+89azgC890l6KI+/N6TWUS1GffAcK/Ug+iWY6IUctNGt9Mx5gBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T23:42:52.771896Z"},"content_sha256":"2bfaaf61c7b076b7dd50cc526ce89f48fd97fe4b8806995e39098af1110e6999","schema_version":"1.0","event_id":"sha256:2bfaaf61c7b076b7dd50cc526ce89f48fd97fe4b8806995e39098af1110e6999"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QAK27G25SWHORY63KCHUNNRH2Y/bundle.json","state_url":"https://pith.science/pith/QAK27G25SWHORY63KCHUNNRH2Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QAK27G25SWHORY63KCHUNNRH2Y/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-10T23:42:52Z","links":{"resolver":"https://pith.science/pith/QAK27G25SWHORY63KCHUNNRH2Y","bundle":"https://pith.science/pith/QAK27G25SWHORY63KCHUNNRH2Y/bundle.json","state":"https://pith.science/pith/QAK27G25SWHORY63KCHUNNRH2Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QAK27G25SWHORY63KCHUNNRH2Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:QAK27G25SWHORY63KCHUNNRH2Y","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":"4d6a12fbfc09f21711af3cc922ee88436f0d17e4112c7376dd61d88abbee86cc","cross_cats_sorted":["stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2013-08-26T21:00:35Z","title_canon_sha256":"a5b2439ddf3e3304a82c786bc8a489dd40ebeb9dcc86950eec6e90f9266a87c9"},"schema_version":"1.0","source":{"id":"1308.5697","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.5697","created_at":"2026-05-18T03:14:51Z"},{"alias_kind":"arxiv_version","alias_value":"1308.5697v1","created_at":"2026-05-18T03:14:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.5697","created_at":"2026-05-18T03:14:51Z"},{"alias_kind":"pith_short_12","alias_value":"QAK27G25SWHO","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QAK27G25SWHORY63","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QAK27G25","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:2bfaaf61c7b076b7dd50cc526ce89f48fd97fe4b8806995e39098af1110e6999","target":"graph","created_at":"2026-05-18T03:14:51Z","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 development of randomized algorithms for numerical linear algebra, e.g. for computing approximate QR and SVD factorizations, has recently become an intense area of research. This paper studies one of the most frequently discussed algorithms in the literature for dimensionality reduction---specifically for approximating an input matrix with a low-rank element. We introduce a novel and rather intuitive analysis of the algorithm in Martinsson et al. (2008), which allows us to derive sharp estimates and give new insights about its performance. This analysis yields theoretical guarantees about ","authors_text":"Emmanuel Candes, Rafi Witten","cross_cats":["stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2013-08-26T21:00:35Z","title":"Randomized algorithms for low-rank matrix factorizations: sharp performance bounds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.5697","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:152abdc33863714a1c787c6067161b27dae650e3403108f47071fa2a1b9e3856","target":"record","created_at":"2026-05-18T03:14:51Z","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":"4d6a12fbfc09f21711af3cc922ee88436f0d17e4112c7376dd61d88abbee86cc","cross_cats_sorted":["stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2013-08-26T21:00:35Z","title_canon_sha256":"a5b2439ddf3e3304a82c786bc8a489dd40ebeb9dcc86950eec6e90f9266a87c9"},"schema_version":"1.0","source":{"id":"1308.5697","kind":"arxiv","version":1}},"canonical_sha256":"8015af9b5d958ee8e3db508f46b627d615712c108236a3ae33fe84faaa967de4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8015af9b5d958ee8e3db508f46b627d615712c108236a3ae33fe84faaa967de4","first_computed_at":"2026-05-18T03:14:51.541634Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:14:51.541634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6B9+Vkx4H0OQU9nhchsFzHuS4nIAMaHTzFCQ2W6vXjVkz9dlUN9SKaOvA1pbSacm21Vm5W2hUv9QWbViV5lxDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:14:51.542503Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.5697","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:152abdc33863714a1c787c6067161b27dae650e3403108f47071fa2a1b9e3856","sha256:2bfaaf61c7b076b7dd50cc526ce89f48fd97fe4b8806995e39098af1110e6999"],"state_sha256":"1225c142c438e5e331e846def24420fd22c4be022063693e59038884a016d543"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wJe7z3iaZJan1sx/53sNFNrP/qAqnHyTzavscaWSf4k6Gk5cswEvYxubtsZg+8m2SONPVeM9BYl7QdqtoCa9DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T23:42:52.776042Z","bundle_sha256":"d07b75695c080d14090614bb6facedd0dde43ad76fe7d3e0ebd5bff6ca8c4f41"}}