{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:SCCHYTAQ2RTRJJVVT6UGVZAUG6","short_pith_number":"pith:SCCHYTAQ","canonical_record":{"source":{"id":"1511.00212","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-11-01T07:16:00Z","cross_cats_sorted":[],"title_canon_sha256":"9426492fa07f16890b78834b48696746bbbd4fa56a1aca3ab990313794a738be","abstract_canon_sha256":"65da9f5d75da80d56c2eacf883088eda80c75aa4104ab33d03d1b572669209b5"},"schema_version":"1.0"},"canonical_sha256":"90847c4c10d46714a6b59fa86ae41437b329b089978f9c6f1e251f659b669fd8","source":{"kind":"arxiv","id":"1511.00212","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.00212","created_at":"2026-05-18T01:28:12Z"},{"alias_kind":"arxiv_version","alias_value":"1511.00212v1","created_at":"2026-05-18T01:28:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.00212","created_at":"2026-05-18T01:28:12Z"},{"alias_kind":"pith_short_12","alias_value":"SCCHYTAQ2RTR","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"SCCHYTAQ2RTRJJVV","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"SCCHYTAQ","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:SCCHYTAQ2RTRJJVVT6UGVZAUG6","target":"record","payload":{"canonical_record":{"source":{"id":"1511.00212","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-11-01T07:16:00Z","cross_cats_sorted":[],"title_canon_sha256":"9426492fa07f16890b78834b48696746bbbd4fa56a1aca3ab990313794a738be","abstract_canon_sha256":"65da9f5d75da80d56c2eacf883088eda80c75aa4104ab33d03d1b572669209b5"},"schema_version":"1.0"},"canonical_sha256":"90847c4c10d46714a6b59fa86ae41437b329b089978f9c6f1e251f659b669fd8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:28:12.926085Z","signature_b64":"QBsq6r5+/MQDTV4sTMStyyMWuzrasM6QsN8zLhp5oI5oVBytSVS5EBwomMNrzIebQ2L3Cx3KKQ79NlOVb4zVDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90847c4c10d46714a6b59fa86ae41437b329b089978f9c6f1e251f659b669fd8","last_reissued_at":"2026-05-18T01:28:12.925171Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:28:12.925171Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.00212","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-18T01:28:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GNWInfyHX8uFEMYDqmAf61o041SJn07XkzR2iz2UnfmPcAv0hAmgLzxqK3Nx8gAgXIH4eoGaB5eVXTS9q5mHAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:10:56.456528Z"},"content_sha256":"f28d24b524d1eafc9f85b21459fb3b14dcc765705fb850719fa4cac5f651ce19","schema_version":"1.0","event_id":"sha256:f28d24b524d1eafc9f85b21459fb3b14dcc765705fb850719fa4cac5f651ce19"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:SCCHYTAQ2RTRJJVVT6UGVZAUG6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exploiting Redundant Computation in Communication-Avoiding Algorithms for Algorithm-Based Fault Tolerance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Camille Coti","submitted_at":"2015-11-01T07:16:00Z","abstract_excerpt":"Communication-avoiding algorithms allow redundant computations to minimize the number of inter-process communications. In this paper, we propose to exploit this redundancy for fault-tolerance purpose. We illustrate this idea with QR factorization of tall and skinny matrices, and we evaluate the number of failures our algorithm can tolerate under different semantics."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.00212","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-18T01:28:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SeAr7FGCL8CPYzk6zH6RDWI9bvtZEJIixNNrH8ECpCltcJP6zbVRj1JLGveEAqvXWEnEKIggIR3UGDWjvjsVBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:10:56.457203Z"},"content_sha256":"5aabf4b02b6283f3f44002bb3f4579dea454620736026a93d53c47ae2889ddd4","schema_version":"1.0","event_id":"sha256:5aabf4b02b6283f3f44002bb3f4579dea454620736026a93d53c47ae2889ddd4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SCCHYTAQ2RTRJJVVT6UGVZAUG6/bundle.json","state_url":"https://pith.science/pith/SCCHYTAQ2RTRJJVVT6UGVZAUG6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SCCHYTAQ2RTRJJVVT6UGVZAUG6/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-26T14:10:56Z","links":{"resolver":"https://pith.science/pith/SCCHYTAQ2RTRJJVVT6UGVZAUG6","bundle":"https://pith.science/pith/SCCHYTAQ2RTRJJVVT6UGVZAUG6/bundle.json","state":"https://pith.science/pith/SCCHYTAQ2RTRJJVVT6UGVZAUG6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SCCHYTAQ2RTRJJVVT6UGVZAUG6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:SCCHYTAQ2RTRJJVVT6UGVZAUG6","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":"65da9f5d75da80d56c2eacf883088eda80c75aa4104ab33d03d1b572669209b5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-11-01T07:16:00Z","title_canon_sha256":"9426492fa07f16890b78834b48696746bbbd4fa56a1aca3ab990313794a738be"},"schema_version":"1.0","source":{"id":"1511.00212","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.00212","created_at":"2026-05-18T01:28:12Z"},{"alias_kind":"arxiv_version","alias_value":"1511.00212v1","created_at":"2026-05-18T01:28:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.00212","created_at":"2026-05-18T01:28:12Z"},{"alias_kind":"pith_short_12","alias_value":"SCCHYTAQ2RTR","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"SCCHYTAQ2RTRJJVV","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"SCCHYTAQ","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:5aabf4b02b6283f3f44002bb3f4579dea454620736026a93d53c47ae2889ddd4","target":"graph","created_at":"2026-05-18T01:28:12Z","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":"Communication-avoiding algorithms allow redundant computations to minimize the number of inter-process communications. In this paper, we propose to exploit this redundancy for fault-tolerance purpose. We illustrate this idea with QR factorization of tall and skinny matrices, and we evaluate the number of failures our algorithm can tolerate under different semantics.","authors_text":"Camille Coti","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-11-01T07:16:00Z","title":"Exploiting Redundant Computation in Communication-Avoiding Algorithms for Algorithm-Based Fault Tolerance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.00212","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:f28d24b524d1eafc9f85b21459fb3b14dcc765705fb850719fa4cac5f651ce19","target":"record","created_at":"2026-05-18T01:28:12Z","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":"65da9f5d75da80d56c2eacf883088eda80c75aa4104ab33d03d1b572669209b5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-11-01T07:16:00Z","title_canon_sha256":"9426492fa07f16890b78834b48696746bbbd4fa56a1aca3ab990313794a738be"},"schema_version":"1.0","source":{"id":"1511.00212","kind":"arxiv","version":1}},"canonical_sha256":"90847c4c10d46714a6b59fa86ae41437b329b089978f9c6f1e251f659b669fd8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"90847c4c10d46714a6b59fa86ae41437b329b089978f9c6f1e251f659b669fd8","first_computed_at":"2026-05-18T01:28:12.925171Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:28:12.925171Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QBsq6r5+/MQDTV4sTMStyyMWuzrasM6QsN8zLhp5oI5oVBytSVS5EBwomMNrzIebQ2L3Cx3KKQ79NlOVb4zVDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:28:12.926085Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.00212","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f28d24b524d1eafc9f85b21459fb3b14dcc765705fb850719fa4cac5f651ce19","sha256:5aabf4b02b6283f3f44002bb3f4579dea454620736026a93d53c47ae2889ddd4"],"state_sha256":"296977e572313f6f9860c95178e3c50e8289372c6bf71bef2e4c2aa87c619bd0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"37wPNcee9JFc8wOjy8SM6Z/zGwvPPLR9m8wjlw+qcgP75nPIKoNY6QH8iK0n4iAWTB+NOLMRnP+Bvy0SK/PEBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T14:10:56.461165Z","bundle_sha256":"1f43c9d8ac69ec3599854fa531527b85a10f862e753d6b17909d332e24a95640"}}