{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:DYXGVQZIYZ5E7SQHT7QIDH7RDO","short_pith_number":"pith:DYXGVQZI","canonical_record":{"source":{"id":"1505.04340","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2015-05-16T23:55:25Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"3ca8bfa4d5af953d151d09d3ff1bee8bbbea0bde0c8e29d1687499705450e824","abstract_canon_sha256":"7888ffff5162ba3d18ee1351ba42774b0f13601758348f55778b5e1cebbd420e"},"schema_version":"1.0"},"canonical_sha256":"1e2e6ac328c67a4fca079fe0819ff11b87444e93fa4b849ca7a2d6aa3aa78825","source":{"kind":"arxiv","id":"1505.04340","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.04340","created_at":"2026-05-18T02:07:25Z"},{"alias_kind":"arxiv_version","alias_value":"1505.04340v1","created_at":"2026-05-18T02:07:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.04340","created_at":"2026-05-18T02:07:25Z"},{"alias_kind":"pith_short_12","alias_value":"DYXGVQZIYZ5E","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DYXGVQZIYZ5E7SQH","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DYXGVQZI","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:DYXGVQZIYZ5E7SQHT7QIDH7RDO","target":"record","payload":{"canonical_record":{"source":{"id":"1505.04340","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2015-05-16T23:55:25Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"3ca8bfa4d5af953d151d09d3ff1bee8bbbea0bde0c8e29d1687499705450e824","abstract_canon_sha256":"7888ffff5162ba3d18ee1351ba42774b0f13601758348f55778b5e1cebbd420e"},"schema_version":"1.0"},"canonical_sha256":"1e2e6ac328c67a4fca079fe0819ff11b87444e93fa4b849ca7a2d6aa3aa78825","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:07:25.635746Z","signature_b64":"48KPP4U/HDp9o+c0cLTwdSkA9bqNLX5bKvPiQx6Uri4/vctfSJ1obv1IBWK9Q1guhcsTki/ERNJQk6C9QkClAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1e2e6ac328c67a4fca079fe0819ff11b87444e93fa4b849ca7a2d6aa3aa78825","last_reissued_at":"2026-05-18T02:07:25.635014Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:07:25.635014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.04340","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-18T02:07:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p37oRkxR0D5ISfjAn4wbEni8IRp1bbzNYn2VC8c78xjL88AfL+gEUV3pfXOUSjzKTwsgwKxZo9cAMCb2xgWCBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T01:21:56.192453Z"},"content_sha256":"73532c739a0031ad53056c3b51009ad1e2d9f3149b2e06512bd63f1b7be06803","schema_version":"1.0","event_id":"sha256:73532c739a0031ad53056c3b51009ad1e2d9f3149b2e06512bd63f1b7be06803"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:DYXGVQZIYZ5E7SQHT7QIDH7RDO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Schur Complement based domain decomposition preconditioners with Low-rank corrections","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"cs.NA","authors_text":"Ruipeng Li, Yousef Saad, Yuanzhe Xi","submitted_at":"2015-05-16T23:55:25Z","abstract_excerpt":"This paper introduces a robust preconditioner for general sparse symmetric matrices, that is based on low-rank approximations of the Schur complement in a Domain Decomposition (DD) framework. In this \"Schur Low Rank\" (SLR) preconditioning approach, the coefficient matrix is first decoupled by DD, and then a low-rank correction is exploited to compute an approximate inverse of the Schur complement associated with the interface points. The method avoids explicit formation of the Schur complement matrix. We show the feasibility of this strategy for a model problem, and conduct a detailed spectral"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.04340","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-18T02:07:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hSQsKttpmi0OfKFIdV//53Hm78JVQVPnmGrH+/lLjtUupjp3xl4aF0eZobCu+Q4uPqLNv9LJeopxrBnS4ylbDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T01:21:56.193005Z"},"content_sha256":"d661a731778df1761e3f6174be0a6054e94fd16fba48ed3e7dc3ef28fcf06cae","schema_version":"1.0","event_id":"sha256:d661a731778df1761e3f6174be0a6054e94fd16fba48ed3e7dc3ef28fcf06cae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DYXGVQZIYZ5E7SQHT7QIDH7RDO/bundle.json","state_url":"https://pith.science/pith/DYXGVQZIYZ5E7SQHT7QIDH7RDO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DYXGVQZIYZ5E7SQHT7QIDH7RDO/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-30T01:21:56Z","links":{"resolver":"https://pith.science/pith/DYXGVQZIYZ5E7SQHT7QIDH7RDO","bundle":"https://pith.science/pith/DYXGVQZIYZ5E7SQHT7QIDH7RDO/bundle.json","state":"https://pith.science/pith/DYXGVQZIYZ5E7SQHT7QIDH7RDO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DYXGVQZIYZ5E7SQHT7QIDH7RDO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:DYXGVQZIYZ5E7SQHT7QIDH7RDO","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":"7888ffff5162ba3d18ee1351ba42774b0f13601758348f55778b5e1cebbd420e","cross_cats_sorted":["math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2015-05-16T23:55:25Z","title_canon_sha256":"3ca8bfa4d5af953d151d09d3ff1bee8bbbea0bde0c8e29d1687499705450e824"},"schema_version":"1.0","source":{"id":"1505.04340","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.04340","created_at":"2026-05-18T02:07:25Z"},{"alias_kind":"arxiv_version","alias_value":"1505.04340v1","created_at":"2026-05-18T02:07:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.04340","created_at":"2026-05-18T02:07:25Z"},{"alias_kind":"pith_short_12","alias_value":"DYXGVQZIYZ5E","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DYXGVQZIYZ5E7SQH","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DYXGVQZI","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:d661a731778df1761e3f6174be0a6054e94fd16fba48ed3e7dc3ef28fcf06cae","target":"graph","created_at":"2026-05-18T02:07:25Z","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 introduces a robust preconditioner for general sparse symmetric matrices, that is based on low-rank approximations of the Schur complement in a Domain Decomposition (DD) framework. In this \"Schur Low Rank\" (SLR) preconditioning approach, the coefficient matrix is first decoupled by DD, and then a low-rank correction is exploited to compute an approximate inverse of the Schur complement associated with the interface points. The method avoids explicit formation of the Schur complement matrix. We show the feasibility of this strategy for a model problem, and conduct a detailed spectral","authors_text":"Ruipeng Li, Yousef Saad, Yuanzhe Xi","cross_cats":["math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2015-05-16T23:55:25Z","title":"Schur Complement based domain decomposition preconditioners with Low-rank corrections"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.04340","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:73532c739a0031ad53056c3b51009ad1e2d9f3149b2e06512bd63f1b7be06803","target":"record","created_at":"2026-05-18T02:07:25Z","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":"7888ffff5162ba3d18ee1351ba42774b0f13601758348f55778b5e1cebbd420e","cross_cats_sorted":["math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2015-05-16T23:55:25Z","title_canon_sha256":"3ca8bfa4d5af953d151d09d3ff1bee8bbbea0bde0c8e29d1687499705450e824"},"schema_version":"1.0","source":{"id":"1505.04340","kind":"arxiv","version":1}},"canonical_sha256":"1e2e6ac328c67a4fca079fe0819ff11b87444e93fa4b849ca7a2d6aa3aa78825","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1e2e6ac328c67a4fca079fe0819ff11b87444e93fa4b849ca7a2d6aa3aa78825","first_computed_at":"2026-05-18T02:07:25.635014Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:07:25.635014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"48KPP4U/HDp9o+c0cLTwdSkA9bqNLX5bKvPiQx6Uri4/vctfSJ1obv1IBWK9Q1guhcsTki/ERNJQk6C9QkClAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:07:25.635746Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.04340","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:73532c739a0031ad53056c3b51009ad1e2d9f3149b2e06512bd63f1b7be06803","sha256:d661a731778df1761e3f6174be0a6054e94fd16fba48ed3e7dc3ef28fcf06cae"],"state_sha256":"117ef9c1b047262e4e45e125ed212687b7fc0608dd8531db25293967c93e8b47"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IHtIpRzaYTZIjowXVdMBHnO3vpaWddg5mPTDETrPWngXL4DZ/amv4s8lQecErNDPqkQmJ5k+WPtG1Tw0Eq2mAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T01:21:56.196564Z","bundle_sha256":"714aa50d3bf51a6ecc812bbfeb3c38e444b0cf7ef37a12ea81426c8f46426ad7"}}