{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:26G73IDLDL3ETX3Q2BG75XAHRT","short_pith_number":"pith:26G73IDL","canonical_record":{"source":{"id":"0803.0048","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2008-03-01T07:21:27Z","cross_cats_sorted":[],"title_canon_sha256":"b30cfee0b44d5d1521626873b37447943bacf507d3c2b25370984a15567c2dfa","abstract_canon_sha256":"f3ded2c7731e9e183825ceefba596b35fc6e4cdbb4249e31b2dedfc97f26d33b"},"schema_version":"1.0"},"canonical_sha256":"d78dfda06b1af649df70d04dfedc078cd3518c7ab221e1335f8f0e9c5690fd21","source":{"kind":"arxiv","id":"0803.0048","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0803.0048","created_at":"2026-05-18T04:22:11Z"},{"alias_kind":"arxiv_version","alias_value":"0803.0048v4","created_at":"2026-05-18T04:22:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0803.0048","created_at":"2026-05-18T04:22:11Z"},{"alias_kind":"pith_short_12","alias_value":"26G73IDLDL3E","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"26G73IDLDL3ETX3Q","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"26G73IDL","created_at":"2026-05-18T12:25:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:26G73IDLDL3ETX3Q2BG75XAHRT","target":"record","payload":{"canonical_record":{"source":{"id":"0803.0048","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2008-03-01T07:21:27Z","cross_cats_sorted":[],"title_canon_sha256":"b30cfee0b44d5d1521626873b37447943bacf507d3c2b25370984a15567c2dfa","abstract_canon_sha256":"f3ded2c7731e9e183825ceefba596b35fc6e4cdbb4249e31b2dedfc97f26d33b"},"schema_version":"1.0"},"canonical_sha256":"d78dfda06b1af649df70d04dfedc078cd3518c7ab221e1335f8f0e9c5690fd21","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:22:11.652355Z","signature_b64":"LI/c/HNP8dsWxvBcuArQ5rAgc6OPL/ZOMsHhFpCiZONMhvEl1spNDUr/oZRgD5moMPR3qL9oaEex3o2AQSwrCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d78dfda06b1af649df70d04dfedc078cd3518c7ab221e1335f8f0e9c5690fd21","last_reissued_at":"2026-05-18T04:22:11.651952Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:22:11.651952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0803.0048","source_version":4,"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:22:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q7Qq+5Y/PYnQRC1OqVr/gPzElkOB7vXiEwB1sQxCyls7gpu2OceP/z+zM8rMLtnW0LthWKLJtUBh4PJzTqYfAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T22:40:36.039504Z"},"content_sha256":"c9e523cb51ca004f9914b9c463075e547e6ecb4c9d9a530f7233602296c4f9c4","schema_version":"1.0","event_id":"sha256:c9e523cb51ca004f9914b9c463075e547e6ecb4c9d9a530f7233602296c4f9c4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:26G73IDLDL3ETX3Q2BG75XAHRT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Bit-Compatible Shared Memory Parallelization for ILU(k) Preconditioning and a Bit-Compatible Generalization to Distributed Memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Gene Cooperman, Xin Dong","submitted_at":"2008-03-01T07:21:27Z","abstract_excerpt":"ILU(k) is a commonly used preconditioner for iterative linear solvers for sparse, non-symmetric systems. It is often preferred for the sake of its stability. We present TPILU(k), the first efficiently parallelized ILU(k) preconditioner that maintains this important stability property. Even better, TPILU(k) preconditioning produces an answer that is bit-compatible with the sequential ILU(k) preconditioning. In terms of performance, the TPILU(k) preconditioning is shown to run faster whenever more cores are made available to it --- while continuing to be as stable as sequential ILU(k). This is i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0803.0048","kind":"arxiv","version":4},"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:22:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R/COYvzaXEpXPHe5d4Mlnp0jupVWGnGJbsohlQjCRfvY5gsQ/QjlrZhx9v5qnOD+jdngvBEmkN/h0Q3MZiLyBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T22:40:36.039845Z"},"content_sha256":"ba9bec2dfb080a85890e87e3c4911250c972b78fcb9c48b0ef1d6aac35ca0572","schema_version":"1.0","event_id":"sha256:ba9bec2dfb080a85890e87e3c4911250c972b78fcb9c48b0ef1d6aac35ca0572"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/26G73IDLDL3ETX3Q2BG75XAHRT/bundle.json","state_url":"https://pith.science/pith/26G73IDLDL3ETX3Q2BG75XAHRT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/26G73IDLDL3ETX3Q2BG75XAHRT/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-01T22:40:36Z","links":{"resolver":"https://pith.science/pith/26G73IDLDL3ETX3Q2BG75XAHRT","bundle":"https://pith.science/pith/26G73IDLDL3ETX3Q2BG75XAHRT/bundle.json","state":"https://pith.science/pith/26G73IDLDL3ETX3Q2BG75XAHRT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/26G73IDLDL3ETX3Q2BG75XAHRT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:26G73IDLDL3ETX3Q2BG75XAHRT","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":"f3ded2c7731e9e183825ceefba596b35fc6e4cdbb4249e31b2dedfc97f26d33b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2008-03-01T07:21:27Z","title_canon_sha256":"b30cfee0b44d5d1521626873b37447943bacf507d3c2b25370984a15567c2dfa"},"schema_version":"1.0","source":{"id":"0803.0048","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0803.0048","created_at":"2026-05-18T04:22:11Z"},{"alias_kind":"arxiv_version","alias_value":"0803.0048v4","created_at":"2026-05-18T04:22:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0803.0048","created_at":"2026-05-18T04:22:11Z"},{"alias_kind":"pith_short_12","alias_value":"26G73IDLDL3E","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"26G73IDLDL3ETX3Q","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"26G73IDL","created_at":"2026-05-18T12:25:56Z"}],"graph_snapshots":[{"event_id":"sha256:ba9bec2dfb080a85890e87e3c4911250c972b78fcb9c48b0ef1d6aac35ca0572","target":"graph","created_at":"2026-05-18T04:22:11Z","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":"ILU(k) is a commonly used preconditioner for iterative linear solvers for sparse, non-symmetric systems. It is often preferred for the sake of its stability. We present TPILU(k), the first efficiently parallelized ILU(k) preconditioner that maintains this important stability property. Even better, TPILU(k) preconditioning produces an answer that is bit-compatible with the sequential ILU(k) preconditioning. In terms of performance, the TPILU(k) preconditioning is shown to run faster whenever more cores are made available to it --- while continuing to be as stable as sequential ILU(k). This is i","authors_text":"Gene Cooperman, Xin Dong","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2008-03-01T07:21:27Z","title":"A Bit-Compatible Shared Memory Parallelization for ILU(k) Preconditioning and a Bit-Compatible Generalization to Distributed Memory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0803.0048","kind":"arxiv","version":4},"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:c9e523cb51ca004f9914b9c463075e547e6ecb4c9d9a530f7233602296c4f9c4","target":"record","created_at":"2026-05-18T04:22:11Z","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":"f3ded2c7731e9e183825ceefba596b35fc6e4cdbb4249e31b2dedfc97f26d33b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2008-03-01T07:21:27Z","title_canon_sha256":"b30cfee0b44d5d1521626873b37447943bacf507d3c2b25370984a15567c2dfa"},"schema_version":"1.0","source":{"id":"0803.0048","kind":"arxiv","version":4}},"canonical_sha256":"d78dfda06b1af649df70d04dfedc078cd3518c7ab221e1335f8f0e9c5690fd21","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d78dfda06b1af649df70d04dfedc078cd3518c7ab221e1335f8f0e9c5690fd21","first_computed_at":"2026-05-18T04:22:11.651952Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:22:11.651952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LI/c/HNP8dsWxvBcuArQ5rAgc6OPL/ZOMsHhFpCiZONMhvEl1spNDUr/oZRgD5moMPR3qL9oaEex3o2AQSwrCg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:22:11.652355Z","signed_message":"canonical_sha256_bytes"},"source_id":"0803.0048","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c9e523cb51ca004f9914b9c463075e547e6ecb4c9d9a530f7233602296c4f9c4","sha256:ba9bec2dfb080a85890e87e3c4911250c972b78fcb9c48b0ef1d6aac35ca0572"],"state_sha256":"930e318818f1f72290af3083d6ffe8d876e0a28d3b5b282e0db45fb35ed1b61a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IoSG0mXhCqhfOcWBtfez9jzqU9cEjZSh/7XgI7/BkuIoOfhXKOIgnKqclbGgBW4DtVexUoviloZyhc0aLDzWAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T22:40:36.041821Z","bundle_sha256":"b575f0d485694e37ee330192740f9fb2985b3121f17070a91b3c92829c0c1eae"}}