{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:TTGMYKYWOGYCN52T2PXUFULWIB","short_pith_number":"pith:TTGMYKYW","canonical_record":{"source":{"id":"1006.0758","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2010-06-04T00:16:09Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"5fcb1af3ba5332575a93306642999d1daf23c859c5e32db7f15633d7d1976291","abstract_canon_sha256":"ec5ab98761b7ad20534f2785bcaf9fe55ffb4cfe46887d4198eb70dfe2f97645"},"schema_version":"1.0"},"canonical_sha256":"9ccccc2b1671b026f753d3ef42d1764077458cc9a3ed502399a5fa34bff45165","source":{"kind":"arxiv","id":"1006.0758","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1006.0758","created_at":"2026-05-18T04:03:57Z"},{"alias_kind":"arxiv_version","alias_value":"1006.0758v2","created_at":"2026-05-18T04:03:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.0758","created_at":"2026-05-18T04:03:57Z"},{"alias_kind":"pith_short_12","alias_value":"TTGMYKYWOGYC","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"TTGMYKYWOGYCN52T","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"TTGMYKYW","created_at":"2026-05-18T12:26:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:TTGMYKYWOGYCN52T2PXUFULWIB","target":"record","payload":{"canonical_record":{"source":{"id":"1006.0758","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2010-06-04T00:16:09Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"5fcb1af3ba5332575a93306642999d1daf23c859c5e32db7f15633d7d1976291","abstract_canon_sha256":"ec5ab98761b7ad20534f2785bcaf9fe55ffb4cfe46887d4198eb70dfe2f97645"},"schema_version":"1.0"},"canonical_sha256":"9ccccc2b1671b026f753d3ef42d1764077458cc9a3ed502399a5fa34bff45165","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:03:57.077476Z","signature_b64":"IhoaFMV6Lyl806zM2IIG9Mu+8pvwQIGaNxbrHFrDfaXy98Z5S1wjPchecIsTc+RSIYJTJ+6ywgSN9F7xAhxdAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ccccc2b1671b026f753d3ef42d1764077458cc9a3ed502399a5fa34bff45165","last_reissued_at":"2026-05-18T04:03:57.076912Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:03:57.076912Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1006.0758","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:03:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w8B8HfzMZyikSLUFSArR9RhnWIK0QP9UC/o3a6KABC6Qc4hsTdYkKWOKSzvkGC6DP6g1gxRsBz+QfJ0P7XGbCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T14:01:35.265741Z"},"content_sha256":"1ab3d144955fa167a9bfd025534293fd8bda704f692586e54fa19f2ac2fcd3c4","schema_version":"1.0","event_id":"sha256:1ab3d144955fa167a9bfd025534293fd8bda704f692586e54fa19f2ac2fcd3c4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:TTGMYKYWOGYCN52T2PXUFULWIB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"LSMR: An iterative algorithm for sparse least-squares problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"cs.MS","authors_text":"David Fong, Michael Saunders","submitted_at":"2010-06-04T00:16:09Z","abstract_excerpt":"An iterative method LSMR is presented for solving linear systems $Ax=b$ and least-squares problem $\\min \\norm{Ax-b}_2$, with $A$ being sparse or a fast linear operator. LSMR is based on the Golub-Kahan bidiagonalization process. It is analytically equivalent to the MINRES method applied to the normal equation $A\\T Ax = A\\T b$, so that the quantities $\\norm{A\\T r_k}$ are monotonically decreasing (where $r_k = b - Ax_k$ is the residual for the current iterate $x_k$). In practice we observe that $\\norm{r_k}$ also decreases monotonically. Compared to LSQR, for which only $\\norm{r_k}$ is monotonic,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.0758","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:03:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zWnU90kI7wiApEQqu/rT5xtl4B/v5u3jXMveR+OahldouyNaOsSshNCdOc05dJea7j+OTKpLiUm1dhnMESiMAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T14:01:35.266098Z"},"content_sha256":"b55b3992512734643f28af25ffbe9fd6b759abadcfb9fac2affaf1c7f8c2d1d9","schema_version":"1.0","event_id":"sha256:b55b3992512734643f28af25ffbe9fd6b759abadcfb9fac2affaf1c7f8c2d1d9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TTGMYKYWOGYCN52T2PXUFULWIB/bundle.json","state_url":"https://pith.science/pith/TTGMYKYWOGYCN52T2PXUFULWIB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TTGMYKYWOGYCN52T2PXUFULWIB/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-04T14:01:35Z","links":{"resolver":"https://pith.science/pith/TTGMYKYWOGYCN52T2PXUFULWIB","bundle":"https://pith.science/pith/TTGMYKYWOGYCN52T2PXUFULWIB/bundle.json","state":"https://pith.science/pith/TTGMYKYWOGYCN52T2PXUFULWIB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TTGMYKYWOGYCN52T2PXUFULWIB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:TTGMYKYWOGYCN52T2PXUFULWIB","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":"ec5ab98761b7ad20534f2785bcaf9fe55ffb4cfe46887d4198eb70dfe2f97645","cross_cats_sorted":["math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2010-06-04T00:16:09Z","title_canon_sha256":"5fcb1af3ba5332575a93306642999d1daf23c859c5e32db7f15633d7d1976291"},"schema_version":"1.0","source":{"id":"1006.0758","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1006.0758","created_at":"2026-05-18T04:03:57Z"},{"alias_kind":"arxiv_version","alias_value":"1006.0758v2","created_at":"2026-05-18T04:03:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.0758","created_at":"2026-05-18T04:03:57Z"},{"alias_kind":"pith_short_12","alias_value":"TTGMYKYWOGYC","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"TTGMYKYWOGYCN52T","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"TTGMYKYW","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:b55b3992512734643f28af25ffbe9fd6b759abadcfb9fac2affaf1c7f8c2d1d9","target":"graph","created_at":"2026-05-18T04:03:57Z","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":"An iterative method LSMR is presented for solving linear systems $Ax=b$ and least-squares problem $\\min \\norm{Ax-b}_2$, with $A$ being sparse or a fast linear operator. LSMR is based on the Golub-Kahan bidiagonalization process. It is analytically equivalent to the MINRES method applied to the normal equation $A\\T Ax = A\\T b$, so that the quantities $\\norm{A\\T r_k}$ are monotonically decreasing (where $r_k = b - Ax_k$ is the residual for the current iterate $x_k$). In practice we observe that $\\norm{r_k}$ also decreases monotonically. Compared to LSQR, for which only $\\norm{r_k}$ is monotonic,","authors_text":"David Fong, Michael Saunders","cross_cats":["math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2010-06-04T00:16:09Z","title":"LSMR: An iterative algorithm for sparse least-squares problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.0758","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:1ab3d144955fa167a9bfd025534293fd8bda704f692586e54fa19f2ac2fcd3c4","target":"record","created_at":"2026-05-18T04:03:57Z","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":"ec5ab98761b7ad20534f2785bcaf9fe55ffb4cfe46887d4198eb70dfe2f97645","cross_cats_sorted":["math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2010-06-04T00:16:09Z","title_canon_sha256":"5fcb1af3ba5332575a93306642999d1daf23c859c5e32db7f15633d7d1976291"},"schema_version":"1.0","source":{"id":"1006.0758","kind":"arxiv","version":2}},"canonical_sha256":"9ccccc2b1671b026f753d3ef42d1764077458cc9a3ed502399a5fa34bff45165","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9ccccc2b1671b026f753d3ef42d1764077458cc9a3ed502399a5fa34bff45165","first_computed_at":"2026-05-18T04:03:57.076912Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:03:57.076912Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IhoaFMV6Lyl806zM2IIG9Mu+8pvwQIGaNxbrHFrDfaXy98Z5S1wjPchecIsTc+RSIYJTJ+6ywgSN9F7xAhxdAw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:03:57.077476Z","signed_message":"canonical_sha256_bytes"},"source_id":"1006.0758","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1ab3d144955fa167a9bfd025534293fd8bda704f692586e54fa19f2ac2fcd3c4","sha256:b55b3992512734643f28af25ffbe9fd6b759abadcfb9fac2affaf1c7f8c2d1d9"],"state_sha256":"a002550c442e4a33eeae7850e665ed4dacdda26a3c97eb0d14847076da617ba5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oYzfnfHENf5IqGdP1gICySzQQzcl2+bFbA7j1yp9uwXGJ7LdsdT0aubAxaAedYqfQJZ3dFW/DE2bUuF/SDMOBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T14:01:35.268285Z","bundle_sha256":"3378b736722836f4ec20e48207945c18e1c720f0718350cb6ee16627217fc3f3"}}