{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:PG54GSRKWCH7WHIY26HCKXUSKL","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":"74df654700db49389e7918c3acdca42e822d165fa4d12d4e0202f55ce86aaca5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-04-20T10:10:10Z","title_canon_sha256":"7c7de85082b67c3fd8d469cbf1519f3132b19305dc9f290e87c1e1a31ac32cc3"},"schema_version":"1.0","source":{"id":"1804.07531","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.07531","created_at":"2026-05-18T00:15:04Z"},{"alias_kind":"arxiv_version","alias_value":"1804.07531v2","created_at":"2026-05-18T00:15:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.07531","created_at":"2026-05-18T00:15:04Z"},{"alias_kind":"pith_short_12","alias_value":"PG54GSRKWCH7","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"PG54GSRKWCH7WHIY","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"PG54GSRK","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:045c5c95afdbe7b8493c423f6ce8f3443215b71cf8313497351ef785c2ea17a2","target":"graph","created_at":"2026-05-18T00:15:04Z","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":"This paper describes practical randomized algorithms for low-rank matrix approximation that accommodate any budget for the number of views of the matrix. The presented algorithms, which are aimed at being as pass efficient as needed, expand and improve on popular randomized algorithms targeting efficient low-rank reconstructions. First, a more flexible subspace iteration algorithm is presented that works for any views $v \\geq 2$, instead of only allowing an even $v$. Secondly, we propose more general and more accurate single-pass algorithms. In particular, we propose a more accurate memory eff","authors_text":"Elvar K. Bjarkason","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-04-20T10:10:10Z","title":"Pass-Efficient Randomized Algorithms for Low-Rank Matrix Approximation Using Any Number of Views"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.07531","kind":"arxiv","version":2},"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:0538c702c4a9dbd8977cd8848400ccbab6c24d7c7369b0190a4ae2c61feb457c","target":"record","created_at":"2026-05-18T00:15:04Z","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":"74df654700db49389e7918c3acdca42e822d165fa4d12d4e0202f55ce86aaca5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-04-20T10:10:10Z","title_canon_sha256":"7c7de85082b67c3fd8d469cbf1519f3132b19305dc9f290e87c1e1a31ac32cc3"},"schema_version":"1.0","source":{"id":"1804.07531","kind":"arxiv","version":2}},"canonical_sha256":"79bbc34a2ab08ffb1d18d78e255e9252f0a582a42992c26956451baa301f1ebc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"79bbc34a2ab08ffb1d18d78e255e9252f0a582a42992c26956451baa301f1ebc","first_computed_at":"2026-05-18T00:15:04.673275Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:04.673275Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qfY6PQKtUWR/E/opfpPwKm2gVP2HuKxJ4wtEOTGHee2J9biGpMlUlqoZ44uolXl5BZ3u5x2iUCVVwc0LJLLEDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:04.673924Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.07531","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0538c702c4a9dbd8977cd8848400ccbab6c24d7c7369b0190a4ae2c61feb457c","sha256:045c5c95afdbe7b8493c423f6ce8f3443215b71cf8313497351ef785c2ea17a2"],"state_sha256":"9e9028eb98e9d6b0d583a0c9752387e39f44515d811efedb794a848d7a3a9bd9"}