{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:HDQ73OHUO5I3GXZUZFHRH5J2TN","short_pith_number":"pith:HDQ73OHU","canonical_record":{"source":{"id":"1510.09119","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-10-30T15:23:43Z","cross_cats_sorted":[],"title_canon_sha256":"40313d3fb0bb3e39ccc37ff740ab659efd0a550a4dbd4e02af6bf3b6124f7a41","abstract_canon_sha256":"6a147257329829b9910c9306f8e595c6fdff1f41b67c99ae86a3a88d4ec243a9"},"schema_version":"1.0"},"canonical_sha256":"38e1fdb8f47751b35f34c94f13f53a9b744ada3409fcc75dd231da5a6d479415","source":{"kind":"arxiv","id":"1510.09119","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.09119","created_at":"2026-05-18T01:11:05Z"},{"alias_kind":"arxiv_version","alias_value":"1510.09119v2","created_at":"2026-05-18T01:11:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.09119","created_at":"2026-05-18T01:11:05Z"},{"alias_kind":"pith_short_12","alias_value":"HDQ73OHUO5I3","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HDQ73OHUO5I3GXZU","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HDQ73OHU","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:HDQ73OHUO5I3GXZUZFHRH5J2TN","target":"record","payload":{"canonical_record":{"source":{"id":"1510.09119","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-10-30T15:23:43Z","cross_cats_sorted":[],"title_canon_sha256":"40313d3fb0bb3e39ccc37ff740ab659efd0a550a4dbd4e02af6bf3b6124f7a41","abstract_canon_sha256":"6a147257329829b9910c9306f8e595c6fdff1f41b67c99ae86a3a88d4ec243a9"},"schema_version":"1.0"},"canonical_sha256":"38e1fdb8f47751b35f34c94f13f53a9b744ada3409fcc75dd231da5a6d479415","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:05.102502Z","signature_b64":"VH4vk3927VzouDa9YsdOAnOAPnEkdLw7V/GObFzTYjomvEbnpTHTRyiRPGuA8MK/MxkjybrqRtDdhS06EnZSBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38e1fdb8f47751b35f34c94f13f53a9b744ada3409fcc75dd231da5a6d479415","last_reissued_at":"2026-05-18T01:11:05.101806Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:05.101806Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.09119","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-18T01:11:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hGb1vsTI97ieZxW75/NUY2e3UNyiPWimnveV4A8BC7aOGKawxWCrCpRutlLcWSmRhLJvECUGp76OrWtbHthODw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T20:47:48.355972Z"},"content_sha256":"0fdc8d54c49d6bf8adf83117b6d80a61a3c68803cdcc173009dbddb895b3fa29","schema_version":"1.0","event_id":"sha256:0fdc8d54c49d6bf8adf83117b6d80a61a3c68803cdcc173009dbddb895b3fa29"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:HDQ73OHUO5I3GXZUZFHRH5J2TN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"From Byzantine Failures to Crash Failures in Message-Passing Systems: a BG Simulation-based approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Damien Imbs, Julien Stainer, Michel Raynal","submitted_at":"2015-10-30T15:23:43Z","abstract_excerpt":"The BG-simulation is a powerful reduction algorithm designed for asynchronous read/write crash-prone systems. It allows a set of $(t+1)$ asynchronous sequential processes to wait-free simulate (i.e., despite the crash of up to $t$ of them) an arbitrary number $n$ of processes under the assumption that at most $t$ of them may crash. The BG simulation shows that, in read/write systems, the crucial parameter is not the number $n$ of processes, but the upper bound $t$ on the number of process crashes.\n  The paper extends the concept of BG simulation to asynchronous message-passing systems prone to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.09119","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-18T01:11:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mI7Cl7M7znRj4b/kpipFYqD8E7x38IJGyrXxT2VmFpoGFAnJnfLvOjSPRnscP0CiNJ9nTxiJbX3F03CGp9RMCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T20:47:48.356764Z"},"content_sha256":"605e6ccb65725976e8403e606780f279452951bc8ba7175097b7f4a3e63027cc","schema_version":"1.0","event_id":"sha256:605e6ccb65725976e8403e606780f279452951bc8ba7175097b7f4a3e63027cc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HDQ73OHUO5I3GXZUZFHRH5J2TN/bundle.json","state_url":"https://pith.science/pith/HDQ73OHUO5I3GXZUZFHRH5J2TN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HDQ73OHUO5I3GXZUZFHRH5J2TN/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-11T20:47:48Z","links":{"resolver":"https://pith.science/pith/HDQ73OHUO5I3GXZUZFHRH5J2TN","bundle":"https://pith.science/pith/HDQ73OHUO5I3GXZUZFHRH5J2TN/bundle.json","state":"https://pith.science/pith/HDQ73OHUO5I3GXZUZFHRH5J2TN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HDQ73OHUO5I3GXZUZFHRH5J2TN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:HDQ73OHUO5I3GXZUZFHRH5J2TN","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":"6a147257329829b9910c9306f8e595c6fdff1f41b67c99ae86a3a88d4ec243a9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-10-30T15:23:43Z","title_canon_sha256":"40313d3fb0bb3e39ccc37ff740ab659efd0a550a4dbd4e02af6bf3b6124f7a41"},"schema_version":"1.0","source":{"id":"1510.09119","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.09119","created_at":"2026-05-18T01:11:05Z"},{"alias_kind":"arxiv_version","alias_value":"1510.09119v2","created_at":"2026-05-18T01:11:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.09119","created_at":"2026-05-18T01:11:05Z"},{"alias_kind":"pith_short_12","alias_value":"HDQ73OHUO5I3","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HDQ73OHUO5I3GXZU","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HDQ73OHU","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:605e6ccb65725976e8403e606780f279452951bc8ba7175097b7f4a3e63027cc","target":"graph","created_at":"2026-05-18T01:11:05Z","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 BG-simulation is a powerful reduction algorithm designed for asynchronous read/write crash-prone systems. It allows a set of $(t+1)$ asynchronous sequential processes to wait-free simulate (i.e., despite the crash of up to $t$ of them) an arbitrary number $n$ of processes under the assumption that at most $t$ of them may crash. The BG simulation shows that, in read/write systems, the crucial parameter is not the number $n$ of processes, but the upper bound $t$ on the number of process crashes.\n  The paper extends the concept of BG simulation to asynchronous message-passing systems prone to","authors_text":"Damien Imbs, Julien Stainer, Michel Raynal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-10-30T15:23:43Z","title":"From Byzantine Failures to Crash Failures in Message-Passing Systems: a BG Simulation-based approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.09119","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:0fdc8d54c49d6bf8adf83117b6d80a61a3c68803cdcc173009dbddb895b3fa29","target":"record","created_at":"2026-05-18T01:11:05Z","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":"6a147257329829b9910c9306f8e595c6fdff1f41b67c99ae86a3a88d4ec243a9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-10-30T15:23:43Z","title_canon_sha256":"40313d3fb0bb3e39ccc37ff740ab659efd0a550a4dbd4e02af6bf3b6124f7a41"},"schema_version":"1.0","source":{"id":"1510.09119","kind":"arxiv","version":2}},"canonical_sha256":"38e1fdb8f47751b35f34c94f13f53a9b744ada3409fcc75dd231da5a6d479415","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"38e1fdb8f47751b35f34c94f13f53a9b744ada3409fcc75dd231da5a6d479415","first_computed_at":"2026-05-18T01:11:05.101806Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:05.101806Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VH4vk3927VzouDa9YsdOAnOAPnEkdLw7V/GObFzTYjomvEbnpTHTRyiRPGuA8MK/MxkjybrqRtDdhS06EnZSBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:05.102502Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.09119","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0fdc8d54c49d6bf8adf83117b6d80a61a3c68803cdcc173009dbddb895b3fa29","sha256:605e6ccb65725976e8403e606780f279452951bc8ba7175097b7f4a3e63027cc"],"state_sha256":"4e381a452e9ffe4fe6fa3104955819dcebb507d636c31e5385f032b3c1caa53b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9LbeCuMDISCQG0Rw87021ne+muzlJ2Vjby0646Yqmv0kLipVUIA24MTYpJLl2YMz2pNbiVkgTV3qFitJ7BY6DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T20:47:48.360557Z","bundle_sha256":"c6f1d20b8573c0e8c42fff4cb8c2a60e1a1a9ab7e3c596a266aad2e61b9c531f"}}