{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:PHTMVDF35WPGCKVIG4MTJQB4GS","short_pith_number":"pith:PHTMVDF3","canonical_record":{"source":{"id":"1505.04341","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2015-05-16T23:56:32Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"08e4c5f9f827ecd6fd32198045473fa6339f583534124afa472a9b7f216ae6de","abstract_canon_sha256":"ef53f308c8713e25ffce66eeb058f5745e8c7c9ad043ae9783ed76d6af0be4b3"},"schema_version":"1.0"},"canonical_sha256":"79e6ca8cbbed9e612aa8371934c03c34866165edc4ec77540ae820698fcc21f3","source":{"kind":"arxiv","id":"1505.04341","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.04341","created_at":"2026-05-18T01:59:57Z"},{"alias_kind":"arxiv_version","alias_value":"1505.04341v2","created_at":"2026-05-18T01:59:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.04341","created_at":"2026-05-18T01:59:57Z"},{"alias_kind":"pith_short_12","alias_value":"PHTMVDF35WPG","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PHTMVDF35WPGCKVI","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PHTMVDF3","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:PHTMVDF35WPGCKVIG4MTJQB4GS","target":"record","payload":{"canonical_record":{"source":{"id":"1505.04341","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2015-05-16T23:56:32Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"08e4c5f9f827ecd6fd32198045473fa6339f583534124afa472a9b7f216ae6de","abstract_canon_sha256":"ef53f308c8713e25ffce66eeb058f5745e8c7c9ad043ae9783ed76d6af0be4b3"},"schema_version":"1.0"},"canonical_sha256":"79e6ca8cbbed9e612aa8371934c03c34866165edc4ec77540ae820698fcc21f3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:59:57.278114Z","signature_b64":"l3RKc5VRlB83rpAI280OyNkrd+r+biEvEOze59vqZp6fQxkTPTVFizQQ9ZF0wECWxp7hR1fS5djV9BdRkcBVCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79e6ca8cbbed9e612aa8371934c03c34866165edc4ec77540ae820698fcc21f3","last_reissued_at":"2026-05-18T01:59:57.277614Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:59:57.277614Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.04341","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-18T01:59:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3ZsEvGYon/wuiIIjv6IzciH1sFLWnlRSmaXpDk0nLCVDFcA9MoljynWnDZJjMXqDICHJPEcPofIPy0BzeKgKDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:13:26.640713Z"},"content_sha256":"33c27e69c893c0c5e59d786ce7c2e0ecb4ccbeacbcba78e63982cb61eb5c3fc3","schema_version":"1.0","event_id":"sha256:33c27e69c893c0c5e59d786ce7c2e0ecb4ccbeacbcba78e63982cb61eb5c3fc3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:PHTMVDF35WPGCKVIG4MTJQB4GS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Low-rank correction methods for algebraic domain decomposition preconditioners","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"cs.NA","authors_text":"Ruipeng Li, Yousef Saad","submitted_at":"2015-05-16T23:56:32Z","abstract_excerpt":"This paper presents a parallel preconditioning method for distributed sparse linear systems, based on an approximate inverse of the original matrix, that adopts a general framework of distributed sparse matrices and exploits the domain decomposition method and low-rank corrections. The domain decomposition approach decouples the matrix and once inverted, a low-rank approximation is applied by exploiting the Sherman-Morrison-Woodbury formula, which yields two variants of the preconditioning methods. The low-rank expansion is computed by the Lanczos procedure with reorthogonalizations. Numerical"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.04341","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-18T01:59:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W9Laz4lHY8RUD3u1AlZ9+DB34Fh8pkoReeBkxjGtz+FYFQT7PKvttFI+h4sXh97IYIrfsHxXwlruunM8NKYQAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:13:26.641058Z"},"content_sha256":"363dad0a9d6456b8b91c5b1e7523148fcf9022d5c8d0d86abe8a69fe9f2c4305","schema_version":"1.0","event_id":"sha256:363dad0a9d6456b8b91c5b1e7523148fcf9022d5c8d0d86abe8a69fe9f2c4305"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PHTMVDF35WPGCKVIG4MTJQB4GS/bundle.json","state_url":"https://pith.science/pith/PHTMVDF35WPGCKVIG4MTJQB4GS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PHTMVDF35WPGCKVIG4MTJQB4GS/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-30T06:13:26Z","links":{"resolver":"https://pith.science/pith/PHTMVDF35WPGCKVIG4MTJQB4GS","bundle":"https://pith.science/pith/PHTMVDF35WPGCKVIG4MTJQB4GS/bundle.json","state":"https://pith.science/pith/PHTMVDF35WPGCKVIG4MTJQB4GS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PHTMVDF35WPGCKVIG4MTJQB4GS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:PHTMVDF35WPGCKVIG4MTJQB4GS","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":"ef53f308c8713e25ffce66eeb058f5745e8c7c9ad043ae9783ed76d6af0be4b3","cross_cats_sorted":["math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2015-05-16T23:56:32Z","title_canon_sha256":"08e4c5f9f827ecd6fd32198045473fa6339f583534124afa472a9b7f216ae6de"},"schema_version":"1.0","source":{"id":"1505.04341","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.04341","created_at":"2026-05-18T01:59:57Z"},{"alias_kind":"arxiv_version","alias_value":"1505.04341v2","created_at":"2026-05-18T01:59:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.04341","created_at":"2026-05-18T01:59:57Z"},{"alias_kind":"pith_short_12","alias_value":"PHTMVDF35WPG","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PHTMVDF35WPGCKVI","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PHTMVDF3","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:363dad0a9d6456b8b91c5b1e7523148fcf9022d5c8d0d86abe8a69fe9f2c4305","target":"graph","created_at":"2026-05-18T01:59: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":"This paper presents a parallel preconditioning method for distributed sparse linear systems, based on an approximate inverse of the original matrix, that adopts a general framework of distributed sparse matrices and exploits the domain decomposition method and low-rank corrections. The domain decomposition approach decouples the matrix and once inverted, a low-rank approximation is applied by exploiting the Sherman-Morrison-Woodbury formula, which yields two variants of the preconditioning methods. The low-rank expansion is computed by the Lanczos procedure with reorthogonalizations. Numerical","authors_text":"Ruipeng Li, Yousef Saad","cross_cats":["math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2015-05-16T23:56:32Z","title":"Low-rank correction methods for algebraic domain decomposition preconditioners"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.04341","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:33c27e69c893c0c5e59d786ce7c2e0ecb4ccbeacbcba78e63982cb61eb5c3fc3","target":"record","created_at":"2026-05-18T01:59: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":"ef53f308c8713e25ffce66eeb058f5745e8c7c9ad043ae9783ed76d6af0be4b3","cross_cats_sorted":["math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2015-05-16T23:56:32Z","title_canon_sha256":"08e4c5f9f827ecd6fd32198045473fa6339f583534124afa472a9b7f216ae6de"},"schema_version":"1.0","source":{"id":"1505.04341","kind":"arxiv","version":2}},"canonical_sha256":"79e6ca8cbbed9e612aa8371934c03c34866165edc4ec77540ae820698fcc21f3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"79e6ca8cbbed9e612aa8371934c03c34866165edc4ec77540ae820698fcc21f3","first_computed_at":"2026-05-18T01:59:57.277614Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:59:57.277614Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"l3RKc5VRlB83rpAI280OyNkrd+r+biEvEOze59vqZp6fQxkTPTVFizQQ9ZF0wECWxp7hR1fS5djV9BdRkcBVCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:59:57.278114Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.04341","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:33c27e69c893c0c5e59d786ce7c2e0ecb4ccbeacbcba78e63982cb61eb5c3fc3","sha256:363dad0a9d6456b8b91c5b1e7523148fcf9022d5c8d0d86abe8a69fe9f2c4305"],"state_sha256":"885cc41c2e595c2c873cb9906220eb74abb003175ebd290892148bf46f80f6b9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DsJR12fGciNiroa1pdXoBW48uj3IqWLgAxf1wO/WZNhWY5KQDairnG7j6BeWlWbSQYWEba49T7W/C9hItKCFAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T06:13:26.643021Z","bundle_sha256":"0235f57656ab3a4d3d60507b1b044f79600576d5252ee2ebf9cd8dd1e1ce5b2b"}}