{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:CQRMJKLYKUHTETQXNTNXQIXTVG","short_pith_number":"pith:CQRMJKLY","canonical_record":{"source":{"id":"1109.5981","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-27T18:06:44Z","cross_cats_sorted":["cs.MS","cs.NA"],"title_canon_sha256":"156f33aeb849eef86c44bec60fe3eab071d01eb8e5ae6760c41c340d9f52da00","abstract_canon_sha256":"6eba2ffc2524d386119bb28cd8b910c4628b17fe5d5d316a16b4a7c26b15c5d9"},"schema_version":"1.0"},"canonical_sha256":"1422c4a978550f324e176cdb7822f3a98fe602df9515188a4adcaa2bf08477ec","source":{"kind":"arxiv","id":"1109.5981","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.5981","created_at":"2026-05-18T04:02:01Z"},{"alias_kind":"arxiv_version","alias_value":"1109.5981v2","created_at":"2026-05-18T04:02:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.5981","created_at":"2026-05-18T04:02:01Z"},{"alias_kind":"pith_short_12","alias_value":"CQRMJKLYKUHT","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"CQRMJKLYKUHTETQX","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"CQRMJKLY","created_at":"2026-05-18T12:26:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:CQRMJKLYKUHTETQXNTNXQIXTVG","target":"record","payload":{"canonical_record":{"source":{"id":"1109.5981","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-27T18:06:44Z","cross_cats_sorted":["cs.MS","cs.NA"],"title_canon_sha256":"156f33aeb849eef86c44bec60fe3eab071d01eb8e5ae6760c41c340d9f52da00","abstract_canon_sha256":"6eba2ffc2524d386119bb28cd8b910c4628b17fe5d5d316a16b4a7c26b15c5d9"},"schema_version":"1.0"},"canonical_sha256":"1422c4a978550f324e176cdb7822f3a98fe602df9515188a4adcaa2bf08477ec","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:02:01.775758Z","signature_b64":"jqx9W+OH5X2o9+/FwAU3/Mu8aKYns3MZx+2hBN/yG6Ah0Fboc5UW0zIqnLP+HNcJMZRaX5kSttoi8g0/Y5GJBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1422c4a978550f324e176cdb7822f3a98fe602df9515188a4adcaa2bf08477ec","last_reissued_at":"2026-05-18T04:02:01.774810Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:02:01.774810Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.5981","source_version":2,"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-18T04:02:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x2NTAhrW5QGojRdIj1Dm5oqEUDIyhiSYyPGqZlsD8Xa8vMR7UPhmhQjF41YCak8dviuzedjhQzKZ+hm9wb3gDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T01:01:19.905943Z"},"content_sha256":"148a2e4533e9f81744933cd6d48cf3547b19a84970e8a9edf315dfdde29d50ef","schema_version":"1.0","event_id":"sha256:148a2e4533e9f81744933cd6d48cf3547b19a84970e8a9edf315dfdde29d50ef"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:CQRMJKLYKUHTETQXNTNXQIXTVG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"LSRN: A Parallel Iterative Solver for Strongly Over- or Under-Determined Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS","cs.NA"],"primary_cat":"cs.DS","authors_text":"Michael A. Saunders, Michael W. Mahoney, Xiangrui Meng","submitted_at":"2011-09-27T18:06:44Z","abstract_excerpt":"We describe a parallel iterative least squares solver named \\texttt{LSRN} that is based on random normal projection. \\texttt{LSRN} computes the min-length solution to $\\min_{x \\in \\mathbb{R}^n} \\|A x - b\\|_2$, where $A \\in \\mathbb{R}^{m \\times n}$ with $m \\gg n$ or $m \\ll n$, and where $A$ may be rank-deficient. Tikhonov regularization may also be included. Since $A$ is only involved in matrix-matrix and matrix-vector multiplications, it can be a dense or sparse matrix or a linear operator, and \\texttt{LSRN} automatically speeds up when $A$ is sparse or a fast linear operator. The precondition"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.5981","kind":"arxiv","version":2},"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-18T04:02:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bu0wCo2BL+aPf6581r99/F79tQJKUzwTx9Yb0NSGdXO+LGPbwnT8/T7lz2p1+HjaxgMmfRo9Ea27TY4+QY7uCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T01:01:19.906335Z"},"content_sha256":"a5c3a5702f5c2a0697a47dc93eff99641af422739acaa252fd61927dcafdc57b","schema_version":"1.0","event_id":"sha256:a5c3a5702f5c2a0697a47dc93eff99641af422739acaa252fd61927dcafdc57b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CQRMJKLYKUHTETQXNTNXQIXTVG/bundle.json","state_url":"https://pith.science/pith/CQRMJKLYKUHTETQXNTNXQIXTVG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CQRMJKLYKUHTETQXNTNXQIXTVG/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-25T01:01:19Z","links":{"resolver":"https://pith.science/pith/CQRMJKLYKUHTETQXNTNXQIXTVG","bundle":"https://pith.science/pith/CQRMJKLYKUHTETQXNTNXQIXTVG/bundle.json","state":"https://pith.science/pith/CQRMJKLYKUHTETQXNTNXQIXTVG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CQRMJKLYKUHTETQXNTNXQIXTVG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:CQRMJKLYKUHTETQXNTNXQIXTVG","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":"6eba2ffc2524d386119bb28cd8b910c4628b17fe5d5d316a16b4a7c26b15c5d9","cross_cats_sorted":["cs.MS","cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-27T18:06:44Z","title_canon_sha256":"156f33aeb849eef86c44bec60fe3eab071d01eb8e5ae6760c41c340d9f52da00"},"schema_version":"1.0","source":{"id":"1109.5981","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.5981","created_at":"2026-05-18T04:02:01Z"},{"alias_kind":"arxiv_version","alias_value":"1109.5981v2","created_at":"2026-05-18T04:02:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.5981","created_at":"2026-05-18T04:02:01Z"},{"alias_kind":"pith_short_12","alias_value":"CQRMJKLYKUHT","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"CQRMJKLYKUHTETQX","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"CQRMJKLY","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:a5c3a5702f5c2a0697a47dc93eff99641af422739acaa252fd61927dcafdc57b","target":"graph","created_at":"2026-05-18T04:02:01Z","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 describe a parallel iterative least squares solver named \\texttt{LSRN} that is based on random normal projection. \\texttt{LSRN} computes the min-length solution to $\\min_{x \\in \\mathbb{R}^n} \\|A x - b\\|_2$, where $A \\in \\mathbb{R}^{m \\times n}$ with $m \\gg n$ or $m \\ll n$, and where $A$ may be rank-deficient. Tikhonov regularization may also be included. Since $A$ is only involved in matrix-matrix and matrix-vector multiplications, it can be a dense or sparse matrix or a linear operator, and \\texttt{LSRN} automatically speeds up when $A$ is sparse or a fast linear operator. The precondition","authors_text":"Michael A. Saunders, Michael W. Mahoney, Xiangrui Meng","cross_cats":["cs.MS","cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-27T18:06:44Z","title":"LSRN: A Parallel Iterative Solver for Strongly Over- or Under-Determined Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.5981","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:148a2e4533e9f81744933cd6d48cf3547b19a84970e8a9edf315dfdde29d50ef","target":"record","created_at":"2026-05-18T04:02:01Z","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":"6eba2ffc2524d386119bb28cd8b910c4628b17fe5d5d316a16b4a7c26b15c5d9","cross_cats_sorted":["cs.MS","cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-27T18:06:44Z","title_canon_sha256":"156f33aeb849eef86c44bec60fe3eab071d01eb8e5ae6760c41c340d9f52da00"},"schema_version":"1.0","source":{"id":"1109.5981","kind":"arxiv","version":2}},"canonical_sha256":"1422c4a978550f324e176cdb7822f3a98fe602df9515188a4adcaa2bf08477ec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1422c4a978550f324e176cdb7822f3a98fe602df9515188a4adcaa2bf08477ec","first_computed_at":"2026-05-18T04:02:01.774810Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:02:01.774810Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jqx9W+OH5X2o9+/FwAU3/Mu8aKYns3MZx+2hBN/yG6Ah0Fboc5UW0zIqnLP+HNcJMZRaX5kSttoi8g0/Y5GJBg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:02:01.775758Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.5981","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:148a2e4533e9f81744933cd6d48cf3547b19a84970e8a9edf315dfdde29d50ef","sha256:a5c3a5702f5c2a0697a47dc93eff99641af422739acaa252fd61927dcafdc57b"],"state_sha256":"1e6923e37d70dd2d082376d5b1d44e99521657b4ee2b9552e7b2306a382ed3f7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+ei/xcWJJZQsp3cKVjoLEljmIUq7TWYsHZwG+CnD1CkhtH8tlNICPKBFGHSVHUthPXRR8QJanAJ6p0iX+8WqBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T01:01:19.909004Z","bundle_sha256":"ac539a17aa9c4fac70b48997e24a08f8273667be10c12aa81f0df864239656c7"}}