{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:4PWH5CA2EJ62HQFMJU5OCII2FZ","short_pith_number":"pith:4PWH5CA2","canonical_record":{"source":{"id":"1811.09334","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-11-23T01:03:24Z","cross_cats_sorted":[],"title_canon_sha256":"f3497f343b585282e6ae8af853297fe25c1c05c459d5c58d3f5bd43c07a88c2f","abstract_canon_sha256":"0a6532b88bf8c4f9da9853e13ab8c280789eddd027ba21a7d65082967703c4c1"},"schema_version":"1.0"},"canonical_sha256":"e3ec7e881a227da3c0ac4d3ae1211a2e7bee52307a15c041640f19d81cb247d3","source":{"kind":"arxiv","id":"1811.09334","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.09334","created_at":"2026-05-18T00:00:03Z"},{"alias_kind":"arxiv_version","alias_value":"1811.09334v1","created_at":"2026-05-18T00:00:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.09334","created_at":"2026-05-18T00:00:03Z"},{"alias_kind":"pith_short_12","alias_value":"4PWH5CA2EJ62","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4PWH5CA2EJ62HQFM","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4PWH5CA2","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:4PWH5CA2EJ62HQFMJU5OCII2FZ","target":"record","payload":{"canonical_record":{"source":{"id":"1811.09334","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-11-23T01:03:24Z","cross_cats_sorted":[],"title_canon_sha256":"f3497f343b585282e6ae8af853297fe25c1c05c459d5c58d3f5bd43c07a88c2f","abstract_canon_sha256":"0a6532b88bf8c4f9da9853e13ab8c280789eddd027ba21a7d65082967703c4c1"},"schema_version":"1.0"},"canonical_sha256":"e3ec7e881a227da3c0ac4d3ae1211a2e7bee52307a15c041640f19d81cb247d3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:03.663949Z","signature_b64":"8oK7WPzAtEa5Xr7u5z/o+weeu68wRHIuk56oe/BqTiC8JBLN42g5G0RKaUdmw0/s4leKnGcrluvHBho8FTJSBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3ec7e881a227da3c0ac4d3ae1211a2e7bee52307a15c041640f19d81cb247d3","last_reissued_at":"2026-05-18T00:00:03.663534Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:03.663534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.09334","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:00:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FzaA+U8pD3TWVKCkAdtKdM82C8c62CPZkea5elcjuIhltEPZWJhATvJzg9PVF9pWqP2Ij9oTNwWLbk4J1iLgAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:29:00.588705Z"},"content_sha256":"c59b08f36d8fb0f2747c45bfdcd186f174e28e9541b18eca4d40a5cf391f5b71","schema_version":"1.0","event_id":"sha256:c59b08f36d8fb0f2747c45bfdcd186f174e28e9541b18eca4d40a5cf391f5b71"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:4PWH5CA2EJ62HQFMJU5OCII2FZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Randomized QLP algorithm and error analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Hua Xiang, Nianci Wu","submitted_at":"2018-11-23T01:03:24Z","abstract_excerpt":"In this paper, we describe the randomized QLP (RQLP) algorithm and its enhanced version (ERQLP) for computing the low rank approximation to $A$ of size $m\\times n$ efficiently such that $A\\approx QLP$, where $L$ is the rank-$k$ lower-triangular matrix, $Q$ and $P$ are column orthogonal matrices. The theoretical cost of the implementation of RQLP and ERQLP only needs $\\mathcal{O}(mnk)$. Moreover, we derive the upper bounds of the expected approximation error $\\mathbb{E}\\left [ (\\sigma_{j}(A) - \\sigma_{j} (L))/ \\sigma_{j}(A) \\right] $ for $j=1,\\cdots, k$, and prove that the $L$-values of the pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.09334","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:00:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x0H8vr7FKzW88xLAuL7Jx9R4TTl5j3hwHX5iRHEWkXFCLY92VlIEHFJez8MVa6pLJoyUPjczKzsTInk2QuDsAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:29:00.589387Z"},"content_sha256":"45472f917c2b0f635a35dca4b9952952d1ba58725074adb368f5cf4aa8e4ae20","schema_version":"1.0","event_id":"sha256:45472f917c2b0f635a35dca4b9952952d1ba58725074adb368f5cf4aa8e4ae20"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4PWH5CA2EJ62HQFMJU5OCII2FZ/bundle.json","state_url":"https://pith.science/pith/4PWH5CA2EJ62HQFMJU5OCII2FZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4PWH5CA2EJ62HQFMJU5OCII2FZ/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-25T19:29:00Z","links":{"resolver":"https://pith.science/pith/4PWH5CA2EJ62HQFMJU5OCII2FZ","bundle":"https://pith.science/pith/4PWH5CA2EJ62HQFMJU5OCII2FZ/bundle.json","state":"https://pith.science/pith/4PWH5CA2EJ62HQFMJU5OCII2FZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4PWH5CA2EJ62HQFMJU5OCII2FZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:4PWH5CA2EJ62HQFMJU5OCII2FZ","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":"0a6532b88bf8c4f9da9853e13ab8c280789eddd027ba21a7d65082967703c4c1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-11-23T01:03:24Z","title_canon_sha256":"f3497f343b585282e6ae8af853297fe25c1c05c459d5c58d3f5bd43c07a88c2f"},"schema_version":"1.0","source":{"id":"1811.09334","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.09334","created_at":"2026-05-18T00:00:03Z"},{"alias_kind":"arxiv_version","alias_value":"1811.09334v1","created_at":"2026-05-18T00:00:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.09334","created_at":"2026-05-18T00:00:03Z"},{"alias_kind":"pith_short_12","alias_value":"4PWH5CA2EJ62","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4PWH5CA2EJ62HQFM","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4PWH5CA2","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:45472f917c2b0f635a35dca4b9952952d1ba58725074adb368f5cf4aa8e4ae20","target":"graph","created_at":"2026-05-18T00:00:03Z","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":"In this paper, we describe the randomized QLP (RQLP) algorithm and its enhanced version (ERQLP) for computing the low rank approximation to $A$ of size $m\\times n$ efficiently such that $A\\approx QLP$, where $L$ is the rank-$k$ lower-triangular matrix, $Q$ and $P$ are column orthogonal matrices. The theoretical cost of the implementation of RQLP and ERQLP only needs $\\mathcal{O}(mnk)$. Moreover, we derive the upper bounds of the expected approximation error $\\mathbb{E}\\left [ (\\sigma_{j}(A) - \\sigma_{j} (L))/ \\sigma_{j}(A) \\right] $ for $j=1,\\cdots, k$, and prove that the $L$-values of the pro","authors_text":"Hua Xiang, Nianci Wu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-11-23T01:03:24Z","title":"Randomized QLP algorithm and error analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.09334","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:c59b08f36d8fb0f2747c45bfdcd186f174e28e9541b18eca4d40a5cf391f5b71","target":"record","created_at":"2026-05-18T00:00:03Z","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":"0a6532b88bf8c4f9da9853e13ab8c280789eddd027ba21a7d65082967703c4c1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-11-23T01:03:24Z","title_canon_sha256":"f3497f343b585282e6ae8af853297fe25c1c05c459d5c58d3f5bd43c07a88c2f"},"schema_version":"1.0","source":{"id":"1811.09334","kind":"arxiv","version":1}},"canonical_sha256":"e3ec7e881a227da3c0ac4d3ae1211a2e7bee52307a15c041640f19d81cb247d3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e3ec7e881a227da3c0ac4d3ae1211a2e7bee52307a15c041640f19d81cb247d3","first_computed_at":"2026-05-18T00:00:03.663534Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:03.663534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8oK7WPzAtEa5Xr7u5z/o+weeu68wRHIuk56oe/BqTiC8JBLN42g5G0RKaUdmw0/s4leKnGcrluvHBho8FTJSBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:03.663949Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.09334","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c59b08f36d8fb0f2747c45bfdcd186f174e28e9541b18eca4d40a5cf391f5b71","sha256:45472f917c2b0f635a35dca4b9952952d1ba58725074adb368f5cf4aa8e4ae20"],"state_sha256":"75f27fcd4a42f858fca453e1ef211c53215cac0b66a75c9aaba560e14bfe68e2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fLo4th4r6Ic4eIfxoABRgO134RNw/EnVu1OLXGT40A/a/wAs7iqdigTA4/F98+1MxOwIk0/I5bG5QNU2NTqzBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:29:00.592898Z","bundle_sha256":"25e82d3177a639a5d6251abac2f33b2998b024137d696d14c2a6a3a0c4400e59"}}