{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:TH7EUCP4BMTJIPSEINQIHLEDT5","short_pith_number":"pith:TH7EUCP4","canonical_record":{"source":{"id":"1106.4213","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.DC","submitted_at":"2011-06-21T14:24:43Z","cross_cats_sorted":[],"title_canon_sha256":"4aa6bf3cbe4edfbf57272b5c510131c31f3f0f1a782a15bd3ca206c0adbb4530","abstract_canon_sha256":"73fc05a23571bef3357ba62a539845d18e358a9d7fe503c5818228f1c62ba00f"},"schema_version":"1.0"},"canonical_sha256":"99fe4a09fc0b26943e44436083ac839f556f415279296430374f4b9d36cf49d5","source":{"kind":"arxiv","id":"1106.4213","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.4213","created_at":"2026-05-18T04:19:33Z"},{"alias_kind":"arxiv_version","alias_value":"1106.4213v1","created_at":"2026-05-18T04:19:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.4213","created_at":"2026-05-18T04:19:33Z"},{"alias_kind":"pith_short_12","alias_value":"TH7EUCP4BMTJ","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"TH7EUCP4BMTJIPSE","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"TH7EUCP4","created_at":"2026-05-18T12:26:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:TH7EUCP4BMTJIPSEINQIHLEDT5","target":"record","payload":{"canonical_record":{"source":{"id":"1106.4213","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.DC","submitted_at":"2011-06-21T14:24:43Z","cross_cats_sorted":[],"title_canon_sha256":"4aa6bf3cbe4edfbf57272b5c510131c31f3f0f1a782a15bd3ca206c0adbb4530","abstract_canon_sha256":"73fc05a23571bef3357ba62a539845d18e358a9d7fe503c5818228f1c62ba00f"},"schema_version":"1.0"},"canonical_sha256":"99fe4a09fc0b26943e44436083ac839f556f415279296430374f4b9d36cf49d5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:19:33.905858Z","signature_b64":"3KmIIXpZQWlDDl+MsE09Yn2pGeuYEJkTc8J009t1iMGtR1QF0lLaPmP9aS6ZP354FDBqka91Uy7o4hqdwUmRDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99fe4a09fc0b26943e44436083ac839f556f415279296430374f4b9d36cf49d5","last_reissued_at":"2026-05-18T04:19:33.905428Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:19:33.905428Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1106.4213","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-18T04:19:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8S5pCXBmsjhvDqPXdARkV3ungumxLwdonzzG9IfOIeTD40d0fDNz+a2NaAxcKwdZUaNstcvZQmDMA70HbkXYBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T16:38:27.395832Z"},"content_sha256":"78dbd61ebdc226f70a1ebcebd0bb874d6605597a6c0fb7739aa2167edb7bca93","schema_version":"1.0","event_id":"sha256:78dbd61ebdc226f70a1ebcebd0bb874d6605597a6c0fb7739aa2167edb7bca93"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:TH7EUCP4BMTJIPSEINQIHLEDT5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A New and Efficient Algorithm-Based Fault Tolerance Scheme for A Million Way Parallelism","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Erlin Yao, Guangming Tan, Mingyu Chen, Rui Wang, Wenli Zhang","submitted_at":"2011-06-21T14:24:43Z","abstract_excerpt":"Fault tolerance overhead of high performance computing (HPC) applications is becoming critical to the efficient utilization of HPC systems at large scale. HPC applications typically tolerate fail-stop failures by checkpointing. Another promising method is in the algorithm level, called algorithmic recovery. These two methods can achieve high efficiency when the system scale is not very large, but will both lose their effectiveness when systems approach the scale of Exaflops, where the number of processors including in system is expected to achieve one million. This paper develops a new and eff"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.4213","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-18T04:19:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vzs9Hu0eo6oWP8SPma7wtYRTtncHhBBWCxeCL+V2AFc4WURIThR+rZyeATpMLeT5Ig7SChTFQ17nMZX5hB2oDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T16:38:27.396746Z"},"content_sha256":"81b6f84dded6a12c9c9b6631bdf7a4fe205ddb30a587df649b05c6f87a52e622","schema_version":"1.0","event_id":"sha256:81b6f84dded6a12c9c9b6631bdf7a4fe205ddb30a587df649b05c6f87a52e622"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TH7EUCP4BMTJIPSEINQIHLEDT5/bundle.json","state_url":"https://pith.science/pith/TH7EUCP4BMTJIPSEINQIHLEDT5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TH7EUCP4BMTJIPSEINQIHLEDT5/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-31T16:38:27Z","links":{"resolver":"https://pith.science/pith/TH7EUCP4BMTJIPSEINQIHLEDT5","bundle":"https://pith.science/pith/TH7EUCP4BMTJIPSEINQIHLEDT5/bundle.json","state":"https://pith.science/pith/TH7EUCP4BMTJIPSEINQIHLEDT5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TH7EUCP4BMTJIPSEINQIHLEDT5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:TH7EUCP4BMTJIPSEINQIHLEDT5","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":"73fc05a23571bef3357ba62a539845d18e358a9d7fe503c5818228f1c62ba00f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.DC","submitted_at":"2011-06-21T14:24:43Z","title_canon_sha256":"4aa6bf3cbe4edfbf57272b5c510131c31f3f0f1a782a15bd3ca206c0adbb4530"},"schema_version":"1.0","source":{"id":"1106.4213","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.4213","created_at":"2026-05-18T04:19:33Z"},{"alias_kind":"arxiv_version","alias_value":"1106.4213v1","created_at":"2026-05-18T04:19:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.4213","created_at":"2026-05-18T04:19:33Z"},{"alias_kind":"pith_short_12","alias_value":"TH7EUCP4BMTJ","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"TH7EUCP4BMTJIPSE","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"TH7EUCP4","created_at":"2026-05-18T12:26:42Z"}],"graph_snapshots":[{"event_id":"sha256:81b6f84dded6a12c9c9b6631bdf7a4fe205ddb30a587df649b05c6f87a52e622","target":"graph","created_at":"2026-05-18T04:19:33Z","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":"Fault tolerance overhead of high performance computing (HPC) applications is becoming critical to the efficient utilization of HPC systems at large scale. HPC applications typically tolerate fail-stop failures by checkpointing. Another promising method is in the algorithm level, called algorithmic recovery. These two methods can achieve high efficiency when the system scale is not very large, but will both lose their effectiveness when systems approach the scale of Exaflops, where the number of processors including in system is expected to achieve one million. This paper develops a new and eff","authors_text":"Erlin Yao, Guangming Tan, Mingyu Chen, Rui Wang, Wenli Zhang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.DC","submitted_at":"2011-06-21T14:24:43Z","title":"A New and Efficient Algorithm-Based Fault Tolerance Scheme for A Million Way Parallelism"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.4213","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:78dbd61ebdc226f70a1ebcebd0bb874d6605597a6c0fb7739aa2167edb7bca93","target":"record","created_at":"2026-05-18T04:19:33Z","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":"73fc05a23571bef3357ba62a539845d18e358a9d7fe503c5818228f1c62ba00f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.DC","submitted_at":"2011-06-21T14:24:43Z","title_canon_sha256":"4aa6bf3cbe4edfbf57272b5c510131c31f3f0f1a782a15bd3ca206c0adbb4530"},"schema_version":"1.0","source":{"id":"1106.4213","kind":"arxiv","version":1}},"canonical_sha256":"99fe4a09fc0b26943e44436083ac839f556f415279296430374f4b9d36cf49d5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"99fe4a09fc0b26943e44436083ac839f556f415279296430374f4b9d36cf49d5","first_computed_at":"2026-05-18T04:19:33.905428Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:19:33.905428Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3KmIIXpZQWlDDl+MsE09Yn2pGeuYEJkTc8J009t1iMGtR1QF0lLaPmP9aS6ZP354FDBqka91Uy7o4hqdwUmRDA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:19:33.905858Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.4213","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:78dbd61ebdc226f70a1ebcebd0bb874d6605597a6c0fb7739aa2167edb7bca93","sha256:81b6f84dded6a12c9c9b6631bdf7a4fe205ddb30a587df649b05c6f87a52e622"],"state_sha256":"b92f44bba18b7c27eed83b32b98df3714c6adf6836b6454a8f8266a66e8ada3f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C+BDZdFlID4XlqaSaCxUhuHs03t3Zwe7qKSAv8dn7rVGv8F3z2739ADEoQg+Q1YNJL35AmachGbKRHl70QkkBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T16:38:27.400456Z","bundle_sha256":"ed57d8d73358d898918e131f3705feb919a3e9a71e1fa5e3234f888590584367"}}