{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:5Z47O3GH5HNM5EI432TQJRI7YQ","short_pith_number":"pith:5Z47O3GH","canonical_record":{"source":{"id":"1808.06287","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-08-20T02:30:48Z","cross_cats_sorted":[],"title_canon_sha256":"e7d73e4e75ea364d8c2846a561062ef666d9a0f60d70fff3a0ea6a8233741e30","abstract_canon_sha256":"231fad70cf399b554db95c2e4c31996ca930d9c928c0d716f369da0b37e6759d"},"schema_version":"1.0"},"canonical_sha256":"ee79f76cc7e9dace911cdea704c51fc43a01cf46e3231e6e7936a9a296c547f8","source":{"kind":"arxiv","id":"1808.06287","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.06287","created_at":"2026-05-18T00:07:45Z"},{"alias_kind":"arxiv_version","alias_value":"1808.06287v1","created_at":"2026-05-18T00:07:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.06287","created_at":"2026-05-18T00:07:45Z"},{"alias_kind":"pith_short_12","alias_value":"5Z47O3GH5HNM","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5Z47O3GH5HNM5EI4","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5Z47O3GH","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:5Z47O3GH5HNM5EI432TQJRI7YQ","target":"record","payload":{"canonical_record":{"source":{"id":"1808.06287","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-08-20T02:30:48Z","cross_cats_sorted":[],"title_canon_sha256":"e7d73e4e75ea364d8c2846a561062ef666d9a0f60d70fff3a0ea6a8233741e30","abstract_canon_sha256":"231fad70cf399b554db95c2e4c31996ca930d9c928c0d716f369da0b37e6759d"},"schema_version":"1.0"},"canonical_sha256":"ee79f76cc7e9dace911cdea704c51fc43a01cf46e3231e6e7936a9a296c547f8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:45.459087Z","signature_b64":"z4zm4F3l8xSzE59A3ZJLHEQxijHDXgdr4bcdwT3/OAxHlLKDHjKR9pOBT/YkHIuYUpfXpMq6BYnNNB2OLmjHAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee79f76cc7e9dace911cdea704c51fc43a01cf46e3231e6e7936a9a296c547f8","last_reissued_at":"2026-05-18T00:07:45.458624Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:45.458624Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.06287","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-18T00:07:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jBL8y+kJ105NlmI1v1Pc3yWJ31wAIfrUFLZiMcAAu4kQzXCP4kMAEAmJfLm6Y/h7lZYdJJSsEHUrerPCgJbRAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T08:36:04.864527Z"},"content_sha256":"5e224fbfac8a5880b98cb67266957688f8a3f95e0f20921ac3fcd093f83ec61a","schema_version":"1.0","event_id":"sha256:5e224fbfac8a5880b98cb67266957688f8a3f95e0f20921ac3fcd093f83ec61a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:5Z47O3GH5HNM5EI432TQJRI7YQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Superlinear Convergence of Randomized Block Lanczos Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Bo Li, Ming Gu, Qiaochu Yuan","submitted_at":"2018-08-20T02:30:48Z","abstract_excerpt":"The low rank approximation of matrices is a crucial component in many data mining applications today. A competitive algorithm for this class of problems is the randomized block Lanczos algorithm - an amalgamation of the traditional block Lanczos algorithm with a randomized starting matrix. While empirically this algorithm performs quite well, there has been scant new theoretical results on its convergence behavior and approximation accuracy, and past results have been restricted to certain parameter settings. In this paper, we present a unified singular value convergence analysis for this algo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.06287","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-18T00:07:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dK9J/+OGeUwZ1lqQIAiMSBvQylJbjPCFYHXVE6jeBI5FkAiuCOVRptVoNRQ1JPkR9Ji37jjo4mACLwKgbtIRDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T08:36:04.864870Z"},"content_sha256":"73347e38e928539b06f41bdd0125748ccfabd3474ffc690b12b0c8a6ab16a07a","schema_version":"1.0","event_id":"sha256:73347e38e928539b06f41bdd0125748ccfabd3474ffc690b12b0c8a6ab16a07a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5Z47O3GH5HNM5EI432TQJRI7YQ/bundle.json","state_url":"https://pith.science/pith/5Z47O3GH5HNM5EI432TQJRI7YQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5Z47O3GH5HNM5EI432TQJRI7YQ/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-27T08:36:04Z","links":{"resolver":"https://pith.science/pith/5Z47O3GH5HNM5EI432TQJRI7YQ","bundle":"https://pith.science/pith/5Z47O3GH5HNM5EI432TQJRI7YQ/bundle.json","state":"https://pith.science/pith/5Z47O3GH5HNM5EI432TQJRI7YQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5Z47O3GH5HNM5EI432TQJRI7YQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:5Z47O3GH5HNM5EI432TQJRI7YQ","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":"231fad70cf399b554db95c2e4c31996ca930d9c928c0d716f369da0b37e6759d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-08-20T02:30:48Z","title_canon_sha256":"e7d73e4e75ea364d8c2846a561062ef666d9a0f60d70fff3a0ea6a8233741e30"},"schema_version":"1.0","source":{"id":"1808.06287","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.06287","created_at":"2026-05-18T00:07:45Z"},{"alias_kind":"arxiv_version","alias_value":"1808.06287v1","created_at":"2026-05-18T00:07:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.06287","created_at":"2026-05-18T00:07:45Z"},{"alias_kind":"pith_short_12","alias_value":"5Z47O3GH5HNM","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5Z47O3GH5HNM5EI4","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5Z47O3GH","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:73347e38e928539b06f41bdd0125748ccfabd3474ffc690b12b0c8a6ab16a07a","target":"graph","created_at":"2026-05-18T00:07:45Z","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 low rank approximation of matrices is a crucial component in many data mining applications today. A competitive algorithm for this class of problems is the randomized block Lanczos algorithm - an amalgamation of the traditional block Lanczos algorithm with a randomized starting matrix. While empirically this algorithm performs quite well, there has been scant new theoretical results on its convergence behavior and approximation accuracy, and past results have been restricted to certain parameter settings. In this paper, we present a unified singular value convergence analysis for this algo","authors_text":"Bo Li, Ming Gu, Qiaochu Yuan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-08-20T02:30:48Z","title":"Superlinear Convergence of Randomized Block Lanczos Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.06287","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:5e224fbfac8a5880b98cb67266957688f8a3f95e0f20921ac3fcd093f83ec61a","target":"record","created_at":"2026-05-18T00:07:45Z","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":"231fad70cf399b554db95c2e4c31996ca930d9c928c0d716f369da0b37e6759d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-08-20T02:30:48Z","title_canon_sha256":"e7d73e4e75ea364d8c2846a561062ef666d9a0f60d70fff3a0ea6a8233741e30"},"schema_version":"1.0","source":{"id":"1808.06287","kind":"arxiv","version":1}},"canonical_sha256":"ee79f76cc7e9dace911cdea704c51fc43a01cf46e3231e6e7936a9a296c547f8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee79f76cc7e9dace911cdea704c51fc43a01cf46e3231e6e7936a9a296c547f8","first_computed_at":"2026-05-18T00:07:45.458624Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:45.458624Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"z4zm4F3l8xSzE59A3ZJLHEQxijHDXgdr4bcdwT3/OAxHlLKDHjKR9pOBT/YkHIuYUpfXpMq6BYnNNB2OLmjHAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:45.459087Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.06287","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5e224fbfac8a5880b98cb67266957688f8a3f95e0f20921ac3fcd093f83ec61a","sha256:73347e38e928539b06f41bdd0125748ccfabd3474ffc690b12b0c8a6ab16a07a"],"state_sha256":"46f55cc87633b0fa467e3e846cdc4a41ebe9470de493cb89b963dc4aef61d743"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gdHtXTJr7NmqLyNSG/r5YXPqw+O9mRdKITQB49EnwxcBnVgh0hqQIF2e2eBzZ2xiJ/gXw/Z/wvDODfiu4vcnAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T08:36:04.866701Z","bundle_sha256":"952c1d3ec43d6c2d1f921ef17586c9f5f81bf726d552aec2c93ea8012db0ffb1"}}