{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:BLGISIJOZKBPLIOREELIENZ4VS","short_pith_number":"pith:BLGISIJO","canonical_record":{"source":{"id":"1008.1700","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2010-08-10T12:14:09Z","cross_cats_sorted":["cs.MS"],"title_canon_sha256":"a5cdc74e325caaa7bfc91e9ae043e70ff54a33551ebbf2c2165bf070cfa7c3e6","abstract_canon_sha256":"36a2162755c853870c97e32c60c2c2adfea1d75d5aa62de4ce846169504f00da"},"schema_version":"1.0"},"canonical_sha256":"0acc89212eca82f5a1d1211682373cacb63d1c3acdc4772caab2c81acbd6b565","source":{"kind":"arxiv","id":"1008.1700","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.1700","created_at":"2026-05-18T04:12:54Z"},{"alias_kind":"arxiv_version","alias_value":"1008.1700v2","created_at":"2026-05-18T04:12:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.1700","created_at":"2026-05-18T04:12:54Z"},{"alias_kind":"pith_short_12","alias_value":"BLGISIJOZKBP","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"BLGISIJOZKBPLIOR","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"BLGISIJO","created_at":"2026-05-18T12:26:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:BLGISIJOZKBPLIOREELIENZ4VS","target":"record","payload":{"canonical_record":{"source":{"id":"1008.1700","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2010-08-10T12:14:09Z","cross_cats_sorted":["cs.MS"],"title_canon_sha256":"a5cdc74e325caaa7bfc91e9ae043e70ff54a33551ebbf2c2165bf070cfa7c3e6","abstract_canon_sha256":"36a2162755c853870c97e32c60c2c2adfea1d75d5aa62de4ce846169504f00da"},"schema_version":"1.0"},"canonical_sha256":"0acc89212eca82f5a1d1211682373cacb63d1c3acdc4772caab2c81acbd6b565","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:12:54.985705Z","signature_b64":"ZDVmMPOXx9UZOR0Rv12cLUClBUbM4TapupvIiMAvk3/9sW+H4yhF8QJQFPhXRkf8loldojTcSd3siCYlmWqnAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0acc89212eca82f5a1d1211682373cacb63d1c3acdc4772caab2c81acbd6b565","last_reissued_at":"2026-05-18T04:12:54.985114Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:12:54.985114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1008.1700","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:12:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X9pUfOqFD9V+aEIU+qo9WBU+SHozWPOVDv6WIrDQTUwjTXQkzmbVsquDBJF2PRDwatd78hdM+fu1bUM+V/2MDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T06:07:51.808706Z"},"content_sha256":"9320a94ce5ad5fee373b3e7f36b0da060791ccada22f954d48fec57656561a09","schema_version":"1.0","event_id":"sha256:9320a94ce5ad5fee373b3e7f36b0da060791ccada22f954d48fec57656561a09"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:BLGISIJOZKBPLIOREELIENZ4VS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A domain decomposing parallel sparse linear system solver","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS"],"primary_cat":"cs.NA","authors_text":"Murat Manguoglu","submitted_at":"2010-08-10T12:14:09Z","abstract_excerpt":"The solution of large sparse linear systems is often the most time-consuming part of many science and engineering applications. Computational fluid dynamics, circuit simulation, power network analysis, and material science are just a few examples of the application areas in which large sparse linear systems need to be solved effectively. In this paper we introduce a new parallel hybrid sparse linear system solver for distributed memory architectures that contains both direct and iterative components. We show that by using our solver one can alleviate the drawbacks of direct and iterative solve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.1700","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:12:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ibAflZbcUNcd6GIgBYV13RKlfrniF3Lpt3vr/hV5fpBdPqt87IA1nuLYCyhFt70wv4PNgKMl9hpF6babUm2LCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T06:07:51.809057Z"},"content_sha256":"556a215801a6d11f3286c549f3ce6d496451e5e30bfa6f6b8af758fb2feafe70","schema_version":"1.0","event_id":"sha256:556a215801a6d11f3286c549f3ce6d496451e5e30bfa6f6b8af758fb2feafe70"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BLGISIJOZKBPLIOREELIENZ4VS/bundle.json","state_url":"https://pith.science/pith/BLGISIJOZKBPLIOREELIENZ4VS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BLGISIJOZKBPLIOREELIENZ4VS/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-22T06:07:51Z","links":{"resolver":"https://pith.science/pith/BLGISIJOZKBPLIOREELIENZ4VS","bundle":"https://pith.science/pith/BLGISIJOZKBPLIOREELIENZ4VS/bundle.json","state":"https://pith.science/pith/BLGISIJOZKBPLIOREELIENZ4VS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BLGISIJOZKBPLIOREELIENZ4VS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:BLGISIJOZKBPLIOREELIENZ4VS","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":"36a2162755c853870c97e32c60c2c2adfea1d75d5aa62de4ce846169504f00da","cross_cats_sorted":["cs.MS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2010-08-10T12:14:09Z","title_canon_sha256":"a5cdc74e325caaa7bfc91e9ae043e70ff54a33551ebbf2c2165bf070cfa7c3e6"},"schema_version":"1.0","source":{"id":"1008.1700","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.1700","created_at":"2026-05-18T04:12:54Z"},{"alias_kind":"arxiv_version","alias_value":"1008.1700v2","created_at":"2026-05-18T04:12:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.1700","created_at":"2026-05-18T04:12:54Z"},{"alias_kind":"pith_short_12","alias_value":"BLGISIJOZKBP","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"BLGISIJOZKBPLIOR","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"BLGISIJO","created_at":"2026-05-18T12:26:05Z"}],"graph_snapshots":[{"event_id":"sha256:556a215801a6d11f3286c549f3ce6d496451e5e30bfa6f6b8af758fb2feafe70","target":"graph","created_at":"2026-05-18T04:12:54Z","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":"The solution of large sparse linear systems is often the most time-consuming part of many science and engineering applications. Computational fluid dynamics, circuit simulation, power network analysis, and material science are just a few examples of the application areas in which large sparse linear systems need to be solved effectively. In this paper we introduce a new parallel hybrid sparse linear system solver for distributed memory architectures that contains both direct and iterative components. We show that by using our solver one can alleviate the drawbacks of direct and iterative solve","authors_text":"Murat Manguoglu","cross_cats":["cs.MS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2010-08-10T12:14:09Z","title":"A domain decomposing parallel sparse linear system solver"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.1700","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:9320a94ce5ad5fee373b3e7f36b0da060791ccada22f954d48fec57656561a09","target":"record","created_at":"2026-05-18T04:12:54Z","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":"36a2162755c853870c97e32c60c2c2adfea1d75d5aa62de4ce846169504f00da","cross_cats_sorted":["cs.MS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2010-08-10T12:14:09Z","title_canon_sha256":"a5cdc74e325caaa7bfc91e9ae043e70ff54a33551ebbf2c2165bf070cfa7c3e6"},"schema_version":"1.0","source":{"id":"1008.1700","kind":"arxiv","version":2}},"canonical_sha256":"0acc89212eca82f5a1d1211682373cacb63d1c3acdc4772caab2c81acbd6b565","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0acc89212eca82f5a1d1211682373cacb63d1c3acdc4772caab2c81acbd6b565","first_computed_at":"2026-05-18T04:12:54.985114Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:12:54.985114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZDVmMPOXx9UZOR0Rv12cLUClBUbM4TapupvIiMAvk3/9sW+H4yhF8QJQFPhXRkf8loldojTcSd3siCYlmWqnAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:12:54.985705Z","signed_message":"canonical_sha256_bytes"},"source_id":"1008.1700","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9320a94ce5ad5fee373b3e7f36b0da060791ccada22f954d48fec57656561a09","sha256:556a215801a6d11f3286c549f3ce6d496451e5e30bfa6f6b8af758fb2feafe70"],"state_sha256":"0b446a3fc3b45edfea006b2ef96dd5da1fd98c9c250560cdc324a42bd54ed2b3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cObkv2jSa/YN/soGhcEqSyT2L6SHiF2/JOg4b2FHHwUrJ2stYhTm/OplYiNO9QXcO+dNkCr8OXdE3avJ1UOcAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T06:07:51.811057Z","bundle_sha256":"a3c48c49f24567de8bfe83ead923fa4783704178ce4e26780a77b3d799e1afc8"}}