{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:JLNWBO6NYL3P6JKIKKDZ3WTAKF","short_pith_number":"pith:JLNWBO6N","canonical_record":{"source":{"id":"1408.2208","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-08-10T10:23:53Z","cross_cats_sorted":[],"title_canon_sha256":"f6b1f1c8732aa2fac82c477db42156440328b8527fd524a145235fcfaa275042","abstract_canon_sha256":"c0bd566a11facb86e963a0cfa8ea7d83a159b9a0923fb7a4bf0eb849e60bb76c"},"schema_version":"1.0"},"canonical_sha256":"4adb60bbcdc2f6ff254852879dda60515c2177c4f407674bbeb1f58b5b8149c9","source":{"kind":"arxiv","id":"1408.2208","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.2208","created_at":"2026-05-18T02:45:30Z"},{"alias_kind":"arxiv_version","alias_value":"1408.2208v1","created_at":"2026-05-18T02:45:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.2208","created_at":"2026-05-18T02:45:30Z"},{"alias_kind":"pith_short_12","alias_value":"JLNWBO6NYL3P","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"JLNWBO6NYL3P6JKI","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"JLNWBO6N","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:JLNWBO6NYL3P6JKIKKDZ3WTAKF","target":"record","payload":{"canonical_record":{"source":{"id":"1408.2208","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-08-10T10:23:53Z","cross_cats_sorted":[],"title_canon_sha256":"f6b1f1c8732aa2fac82c477db42156440328b8527fd524a145235fcfaa275042","abstract_canon_sha256":"c0bd566a11facb86e963a0cfa8ea7d83a159b9a0923fb7a4bf0eb849e60bb76c"},"schema_version":"1.0"},"canonical_sha256":"4adb60bbcdc2f6ff254852879dda60515c2177c4f407674bbeb1f58b5b8149c9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:30.043561Z","signature_b64":"fPXiCP1jchsZ5mVv6nm9co+JmrQqBX962DMLXdYM/W04jvn7HO1NKmz2Dgm4/PFGK2++dAeBEPm20ZS4F7gPAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4adb60bbcdc2f6ff254852879dda60515c2177c4f407674bbeb1f58b5b8149c9","last_reissued_at":"2026-05-18T02:45:30.042999Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:30.042999Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.2208","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-18T02:45:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"huFRWrGJluHRQfkificg512TgEjPsQ1u7w3UdT8t/urAkFWJLsiRk9I7Yx5rkWOrUCjK/Qu2r6M+fJZN3+lwDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:14:34.699877Z"},"content_sha256":"d47425d2140e2b2059f0c903c151b21cb87218cd65559a3b6210abf3c0f3c59b","schema_version":"1.0","event_id":"sha256:d47425d2140e2b2059f0c903c151b21cb87218cd65559a3b6210abf3c0f3c59b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:JLNWBO6NYL3P6JKIKKDZ3WTAKF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Subspace Iteration Randomization and Singular Value Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Ming Gu","submitted_at":"2014-08-10T10:23:53Z","abstract_excerpt":"A classical problem in matrix computations is the efficient and reliable approximation of a given matrix by a matrix of lower rank. The truncated singular value decomposition (SVD) is known to provide the best such approximation for any given fixed rank. However, the SVD is also known to be very costly to compute. Among the different approaches in the literature for computing low-rank approximations, randomized algorithms have attracted researchers' recent attention due to their surprising reliability and computational efficiency in different application areas. Typically, such algorithms are s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.2208","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-18T02:45:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VWQ2XNrKycMRuBuBE5W+lHnTcWPAVO9Fzbdubc8Ie4lNTtLLFMsYpEcQqLc/UbhvI7diQrKePT3BMdnRz77AAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:14:34.700417Z"},"content_sha256":"f2285e9fc1be4ef6b04fb8c57a272a7dcdd3ec318c2523fe2a9b6227bedd1b56","schema_version":"1.0","event_id":"sha256:f2285e9fc1be4ef6b04fb8c57a272a7dcdd3ec318c2523fe2a9b6227bedd1b56"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JLNWBO6NYL3P6JKIKKDZ3WTAKF/bundle.json","state_url":"https://pith.science/pith/JLNWBO6NYL3P6JKIKKDZ3WTAKF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JLNWBO6NYL3P6JKIKKDZ3WTAKF/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-30T13:14:34Z","links":{"resolver":"https://pith.science/pith/JLNWBO6NYL3P6JKIKKDZ3WTAKF","bundle":"https://pith.science/pith/JLNWBO6NYL3P6JKIKKDZ3WTAKF/bundle.json","state":"https://pith.science/pith/JLNWBO6NYL3P6JKIKKDZ3WTAKF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JLNWBO6NYL3P6JKIKKDZ3WTAKF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:JLNWBO6NYL3P6JKIKKDZ3WTAKF","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":"c0bd566a11facb86e963a0cfa8ea7d83a159b9a0923fb7a4bf0eb849e60bb76c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-08-10T10:23:53Z","title_canon_sha256":"f6b1f1c8732aa2fac82c477db42156440328b8527fd524a145235fcfaa275042"},"schema_version":"1.0","source":{"id":"1408.2208","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.2208","created_at":"2026-05-18T02:45:30Z"},{"alias_kind":"arxiv_version","alias_value":"1408.2208v1","created_at":"2026-05-18T02:45:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.2208","created_at":"2026-05-18T02:45:30Z"},{"alias_kind":"pith_short_12","alias_value":"JLNWBO6NYL3P","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"JLNWBO6NYL3P6JKI","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"JLNWBO6N","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:f2285e9fc1be4ef6b04fb8c57a272a7dcdd3ec318c2523fe2a9b6227bedd1b56","target":"graph","created_at":"2026-05-18T02:45:30Z","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":"A classical problem in matrix computations is the efficient and reliable approximation of a given matrix by a matrix of lower rank. The truncated singular value decomposition (SVD) is known to provide the best such approximation for any given fixed rank. However, the SVD is also known to be very costly to compute. Among the different approaches in the literature for computing low-rank approximations, randomized algorithms have attracted researchers' recent attention due to their surprising reliability and computational efficiency in different application areas. Typically, such algorithms are s","authors_text":"Ming Gu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-08-10T10:23:53Z","title":"Subspace Iteration Randomization and Singular Value Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.2208","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:d47425d2140e2b2059f0c903c151b21cb87218cd65559a3b6210abf3c0f3c59b","target":"record","created_at":"2026-05-18T02:45:30Z","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":"c0bd566a11facb86e963a0cfa8ea7d83a159b9a0923fb7a4bf0eb849e60bb76c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-08-10T10:23:53Z","title_canon_sha256":"f6b1f1c8732aa2fac82c477db42156440328b8527fd524a145235fcfaa275042"},"schema_version":"1.0","source":{"id":"1408.2208","kind":"arxiv","version":1}},"canonical_sha256":"4adb60bbcdc2f6ff254852879dda60515c2177c4f407674bbeb1f58b5b8149c9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4adb60bbcdc2f6ff254852879dda60515c2177c4f407674bbeb1f58b5b8149c9","first_computed_at":"2026-05-18T02:45:30.042999Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:30.042999Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fPXiCP1jchsZ5mVv6nm9co+JmrQqBX962DMLXdYM/W04jvn7HO1NKmz2Dgm4/PFGK2++dAeBEPm20ZS4F7gPAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:30.043561Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.2208","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d47425d2140e2b2059f0c903c151b21cb87218cd65559a3b6210abf3c0f3c59b","sha256:f2285e9fc1be4ef6b04fb8c57a272a7dcdd3ec318c2523fe2a9b6227bedd1b56"],"state_sha256":"f58de8eb4b1c6d70f5990d7c5bdbc763cba3203a58ee158ed7df152b73e04f02"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dD0Bwkuu/3oErmY6BjL1FDYh8ZwHc7wttTRJZt01xR2lgVNtP64lZ+QqS6ctvGe2SbNiAWYcBxvjuGNKrxa9Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T13:14:34.706313Z","bundle_sha256":"a0f8879126d7db27d1c8c966d2e7e77abf64f41a292ab41f53be119fe8e88df1"}}