{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:4EMZCIK5PTRAR4TLYTRNJEX3HO","short_pith_number":"pith:4EMZCIK5","canonical_record":{"source":{"id":"1210.6266","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2012-10-23T15:19:13Z","cross_cats_sorted":["cs.DC","cs.NA"],"title_canon_sha256":"76c81cac5c2531bedf332391b9d0fbe63056dfe71ab3a4693415c55f71453634","abstract_canon_sha256":"f755323918e60ef5793763bdc4b9556830d1e393ab255a2073055b39db962829"},"schema_version":"1.0"},"canonical_sha256":"e11991215d7ce208f26bc4e2d492fb3bbb72563f24e378ceaaa665de7f82d2cc","source":{"kind":"arxiv","id":"1210.6266","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.6266","created_at":"2026-05-18T03:42:32Z"},{"alias_kind":"arxiv_version","alias_value":"1210.6266v1","created_at":"2026-05-18T03:42:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.6266","created_at":"2026-05-18T03:42:32Z"},{"alias_kind":"pith_short_12","alias_value":"4EMZCIK5PTRA","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4EMZCIK5PTRAR4TL","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4EMZCIK5","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:4EMZCIK5PTRAR4TLYTRNJEX3HO","target":"record","payload":{"canonical_record":{"source":{"id":"1210.6266","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2012-10-23T15:19:13Z","cross_cats_sorted":["cs.DC","cs.NA"],"title_canon_sha256":"76c81cac5c2531bedf332391b9d0fbe63056dfe71ab3a4693415c55f71453634","abstract_canon_sha256":"f755323918e60ef5793763bdc4b9556830d1e393ab255a2073055b39db962829"},"schema_version":"1.0"},"canonical_sha256":"e11991215d7ce208f26bc4e2d492fb3bbb72563f24e378ceaaa665de7f82d2cc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:32.793383Z","signature_b64":"fWWUMdHpz0+lyprJYBFu6f3+buinQtwiZfjwgBEPaoglJKGomKTu+GQXgEh/+PXQ8kTe5K+82/KEHtspmH3zBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e11991215d7ce208f26bc4e2d492fb3bbb72563f24e378ceaaa665de7f82d2cc","last_reissued_at":"2026-05-18T03:42:32.792909Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:32.792909Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.6266","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-18T03:42:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gFR2lE2dE2wZfBTEGGZT/OM7H0nRlUxecVy83PQnDY2sGEOuPDdZXdD9TbXq7SzMMLd1slLMLccN03ptcNnhAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:32:09.205668Z"},"content_sha256":"76addc69c02528be7322fe5d8121512894a06b247b3a235b8a964c67cdcd48c6","schema_version":"1.0","event_id":"sha256:76addc69c02528be7322fe5d8121512894a06b247b3a235b8a964c67cdcd48c6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:4EMZCIK5PTRAR4TLYTRNJEX3HO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Recursive Schur Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.NA"],"primary_cat":"math.NA","authors_text":"Bobby Philip, Rahul S. Sampath, Srdjan Simunovic, Srikanth Allu","submitted_at":"2012-10-23T15:19:13Z","abstract_excerpt":"In this article, we present a parallel recursive algorithm based on multi-level domain decomposition that can be used as a precondtioner to a Krylov subspace method to solve sparse linear systems of equations arising from the discretization of partial differential equations (PDEs). We tested the effectiveness of the algorithm on several PDEs using different number of sub-domains (ranging from 8 to 32768) and various problem sizes (ranging from about 2000 to over a billion degrees of freedom). We report the results from these tests; the results show that the algorithm scales very well with the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.6266","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-18T03:42:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cSFKcyCVHxDhdgv5ZRqbMhjyKr+7xRO99+lyDg3lcDs1GTImyxxmSD5Wq+eiDhJBdkn7dbQLvkq772+CeY3FDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:32:09.206387Z"},"content_sha256":"eae9f4970c71b4d78c66d60b2c04dd352abd512817d2f4c4ce12a7ca07f7efc7","schema_version":"1.0","event_id":"sha256:eae9f4970c71b4d78c66d60b2c04dd352abd512817d2f4c4ce12a7ca07f7efc7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4EMZCIK5PTRAR4TLYTRNJEX3HO/bundle.json","state_url":"https://pith.science/pith/4EMZCIK5PTRAR4TLYTRNJEX3HO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4EMZCIK5PTRAR4TLYTRNJEX3HO/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-31T01:32:09Z","links":{"resolver":"https://pith.science/pith/4EMZCIK5PTRAR4TLYTRNJEX3HO","bundle":"https://pith.science/pith/4EMZCIK5PTRAR4TLYTRNJEX3HO/bundle.json","state":"https://pith.science/pith/4EMZCIK5PTRAR4TLYTRNJEX3HO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4EMZCIK5PTRAR4TLYTRNJEX3HO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:4EMZCIK5PTRAR4TLYTRNJEX3HO","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":"f755323918e60ef5793763bdc4b9556830d1e393ab255a2073055b39db962829","cross_cats_sorted":["cs.DC","cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2012-10-23T15:19:13Z","title_canon_sha256":"76c81cac5c2531bedf332391b9d0fbe63056dfe71ab3a4693415c55f71453634"},"schema_version":"1.0","source":{"id":"1210.6266","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.6266","created_at":"2026-05-18T03:42:32Z"},{"alias_kind":"arxiv_version","alias_value":"1210.6266v1","created_at":"2026-05-18T03:42:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.6266","created_at":"2026-05-18T03:42:32Z"},{"alias_kind":"pith_short_12","alias_value":"4EMZCIK5PTRA","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4EMZCIK5PTRAR4TL","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4EMZCIK5","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:eae9f4970c71b4d78c66d60b2c04dd352abd512817d2f4c4ce12a7ca07f7efc7","target":"graph","created_at":"2026-05-18T03:42:32Z","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":"In this article, we present a parallel recursive algorithm based on multi-level domain decomposition that can be used as a precondtioner to a Krylov subspace method to solve sparse linear systems of equations arising from the discretization of partial differential equations (PDEs). We tested the effectiveness of the algorithm on several PDEs using different number of sub-domains (ranging from 8 to 32768) and various problem sizes (ranging from about 2000 to over a billion degrees of freedom). We report the results from these tests; the results show that the algorithm scales very well with the ","authors_text":"Bobby Philip, Rahul S. Sampath, Srdjan Simunovic, Srikanth Allu","cross_cats":["cs.DC","cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2012-10-23T15:19:13Z","title":"Recursive Schur Decomposition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.6266","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:76addc69c02528be7322fe5d8121512894a06b247b3a235b8a964c67cdcd48c6","target":"record","created_at":"2026-05-18T03:42:32Z","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":"f755323918e60ef5793763bdc4b9556830d1e393ab255a2073055b39db962829","cross_cats_sorted":["cs.DC","cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2012-10-23T15:19:13Z","title_canon_sha256":"76c81cac5c2531bedf332391b9d0fbe63056dfe71ab3a4693415c55f71453634"},"schema_version":"1.0","source":{"id":"1210.6266","kind":"arxiv","version":1}},"canonical_sha256":"e11991215d7ce208f26bc4e2d492fb3bbb72563f24e378ceaaa665de7f82d2cc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e11991215d7ce208f26bc4e2d492fb3bbb72563f24e378ceaaa665de7f82d2cc","first_computed_at":"2026-05-18T03:42:32.792909Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:42:32.792909Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fWWUMdHpz0+lyprJYBFu6f3+buinQtwiZfjwgBEPaoglJKGomKTu+GQXgEh/+PXQ8kTe5K+82/KEHtspmH3zBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:42:32.793383Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.6266","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:76addc69c02528be7322fe5d8121512894a06b247b3a235b8a964c67cdcd48c6","sha256:eae9f4970c71b4d78c66d60b2c04dd352abd512817d2f4c4ce12a7ca07f7efc7"],"state_sha256":"acb932b29efa8042efd52e1c9eec1781bd8ff91ac73895db4b9365019a736630"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xL/nsH07/HHLYp/95UOhwLUyHosQvMslMvAPZIrkA4srKjlfeJbpltfNqFXyX1sYKo1ChKzpQA8zkWP2xpvxDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T01:32:09.210806Z","bundle_sha256":"4e34e76de63dae82d930247ba59e97ed6c5557f857ba5f5b5efa73458d91a56a"}}