{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:V5VYZ2X7GDBJY5BXBPUOJK6SWV","short_pith_number":"pith:V5VYZ2X7","canonical_record":{"source":{"id":"1310.7202","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-10-27T14:55:29Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"c7c837f6400d74ba733dc119662276c70e8e0af0b6d38ffd7d398fb916e596dc","abstract_canon_sha256":"b44411eb8906f462c8ae3c5bd717019ec73fdade3bd76b61185835bfb6281f00"},"schema_version":"1.0"},"canonical_sha256":"af6b8ceaff30c29c74370be8e4abd2b56f7749a96705414a1f0161bc56d72ec8","source":{"kind":"arxiv","id":"1310.7202","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.7202","created_at":"2026-05-18T01:21:38Z"},{"alias_kind":"arxiv_version","alias_value":"1310.7202v4","created_at":"2026-05-18T01:21:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.7202","created_at":"2026-05-18T01:21:38Z"},{"alias_kind":"pith_short_12","alias_value":"V5VYZ2X7GDBJ","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"V5VYZ2X7GDBJY5BX","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"V5VYZ2X7","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:V5VYZ2X7GDBJY5BXBPUOJK6SWV","target":"record","payload":{"canonical_record":{"source":{"id":"1310.7202","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-10-27T14:55:29Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"c7c837f6400d74ba733dc119662276c70e8e0af0b6d38ffd7d398fb916e596dc","abstract_canon_sha256":"b44411eb8906f462c8ae3c5bd717019ec73fdade3bd76b61185835bfb6281f00"},"schema_version":"1.0"},"canonical_sha256":"af6b8ceaff30c29c74370be8e4abd2b56f7749a96705414a1f0161bc56d72ec8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:38.233298Z","signature_b64":"tj38G1aO7b//R/PsbOGrcSeckGVV0Y7IgZ8NUH9hScxy7+IOWVla5nNF6oHVvrk+cHTdfdO1mDfHA5Yn6j/VDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af6b8ceaff30c29c74370be8e4abd2b56f7749a96705414a1f0161bc56d72ec8","last_reissued_at":"2026-05-18T01:21:38.232739Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:38.232739Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.7202","source_version":4,"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:21:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0FW6tK0BA3rse15tcnydv9miJSI6CZ6O6YDFTJMdc4si6EOMqxEazP2NSLB7dJXHMDTTyxHUmLvs0INmLSHLAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T12:23:25.045935Z"},"content_sha256":"5945cc98526c0cb68828eb3dcfced919369e855dce527f5e27655c4fdf31793e","schema_version":"1.0","event_id":"sha256:5945cc98526c0cb68828eb3dcfced919369e855dce527f5e27655c4fdf31793e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:V5VYZ2X7GDBJY5BXBPUOJK6SWV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Randomized LU Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Amir Averbuch, Gil Shabat, Yaniv Shmueli, Yariv Aizenbud","submitted_at":"2013-10-27T14:55:29Z","abstract_excerpt":"We present a fast randomized algorithm that computes a low rank LU decomposition. Our algorithm uses random projections type techniques to efficiently compute a low rank approximation of large matrices. The randomized LU algorithm can be parallelized and further accelerated by using sparse random matrices in its projection step. Several different error bounds are proven for the algorithm approximations. To prove these bounds, recent results from random matrix theory related to subgaussian matrices are used. As an application, we also show how the algorithm can be utilized to solve problems suc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.7202","kind":"arxiv","version":4},"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:21:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gfRodrtkUr5ZGXAYQ+jnP+zWoHQFcH4jkY2pkedMNSyhwkhYsCDO+pqRloB58R4Ru2cp2VnhYT31meT1dj+FBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T12:23:25.046680Z"},"content_sha256":"f25cce862c0679e829d100177b0c84cb942e0289bc48ee567d5500428b5d2def","schema_version":"1.0","event_id":"sha256:f25cce862c0679e829d100177b0c84cb942e0289bc48ee567d5500428b5d2def"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V5VYZ2X7GDBJY5BXBPUOJK6SWV/bundle.json","state_url":"https://pith.science/pith/V5VYZ2X7GDBJY5BXBPUOJK6SWV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V5VYZ2X7GDBJY5BXBPUOJK6SWV/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-06T12:23:25Z","links":{"resolver":"https://pith.science/pith/V5VYZ2X7GDBJY5BXBPUOJK6SWV","bundle":"https://pith.science/pith/V5VYZ2X7GDBJY5BXBPUOJK6SWV/bundle.json","state":"https://pith.science/pith/V5VYZ2X7GDBJY5BXBPUOJK6SWV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V5VYZ2X7GDBJY5BXBPUOJK6SWV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:V5VYZ2X7GDBJY5BXBPUOJK6SWV","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":"b44411eb8906f462c8ae3c5bd717019ec73fdade3bd76b61185835bfb6281f00","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-10-27T14:55:29Z","title_canon_sha256":"c7c837f6400d74ba733dc119662276c70e8e0af0b6d38ffd7d398fb916e596dc"},"schema_version":"1.0","source":{"id":"1310.7202","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.7202","created_at":"2026-05-18T01:21:38Z"},{"alias_kind":"arxiv_version","alias_value":"1310.7202v4","created_at":"2026-05-18T01:21:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.7202","created_at":"2026-05-18T01:21:38Z"},{"alias_kind":"pith_short_12","alias_value":"V5VYZ2X7GDBJ","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"V5VYZ2X7GDBJY5BX","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"V5VYZ2X7","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:f25cce862c0679e829d100177b0c84cb942e0289bc48ee567d5500428b5d2def","target":"graph","created_at":"2026-05-18T01:21:38Z","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":"We present a fast randomized algorithm that computes a low rank LU decomposition. Our algorithm uses random projections type techniques to efficiently compute a low rank approximation of large matrices. The randomized LU algorithm can be parallelized and further accelerated by using sparse random matrices in its projection step. Several different error bounds are proven for the algorithm approximations. To prove these bounds, recent results from random matrix theory related to subgaussian matrices are used. As an application, we also show how the algorithm can be utilized to solve problems suc","authors_text":"Amir Averbuch, Gil Shabat, Yaniv Shmueli, Yariv Aizenbud","cross_cats":["cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-10-27T14:55:29Z","title":"Randomized LU Decomposition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.7202","kind":"arxiv","version":4},"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:5945cc98526c0cb68828eb3dcfced919369e855dce527f5e27655c4fdf31793e","target":"record","created_at":"2026-05-18T01:21:38Z","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":"b44411eb8906f462c8ae3c5bd717019ec73fdade3bd76b61185835bfb6281f00","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-10-27T14:55:29Z","title_canon_sha256":"c7c837f6400d74ba733dc119662276c70e8e0af0b6d38ffd7d398fb916e596dc"},"schema_version":"1.0","source":{"id":"1310.7202","kind":"arxiv","version":4}},"canonical_sha256":"af6b8ceaff30c29c74370be8e4abd2b56f7749a96705414a1f0161bc56d72ec8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"af6b8ceaff30c29c74370be8e4abd2b56f7749a96705414a1f0161bc56d72ec8","first_computed_at":"2026-05-18T01:21:38.232739Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:38.232739Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tj38G1aO7b//R/PsbOGrcSeckGVV0Y7IgZ8NUH9hScxy7+IOWVla5nNF6oHVvrk+cHTdfdO1mDfHA5Yn6j/VDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:38.233298Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.7202","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5945cc98526c0cb68828eb3dcfced919369e855dce527f5e27655c4fdf31793e","sha256:f25cce862c0679e829d100177b0c84cb942e0289bc48ee567d5500428b5d2def"],"state_sha256":"43a929632ee2f4db5c8132a4e69c5a785b62e471ec070b40da1adbd3d8af7e9e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pxjsUlcs5T0KK8GO2V7mu2XqMwRmRC8BimRsZVXsniY8QgW/ZKN0mlSRekvOai4pnRHpb6N+JZUR03wuhA/1Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T12:23:25.051156Z","bundle_sha256":"55a1c63f494ca4136ff5e8fd065cc2611ec44053bf65ff8d0c6fb4104f2fb920"}}