{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:HDQ73OHUO5I3GXZUZFHRH5J2TN","short_pith_number":"pith:HDQ73OHU","schema_version":"1.0","canonical_sha256":"38e1fdb8f47751b35f34c94f13f53a9b744ada3409fcc75dd231da5a6d479415","source":{"kind":"arxiv","id":"1510.09119","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1510.09119","created_at":"2026-05-18T01:11:05.101912+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.09119v2","created_at":"2026-05-18T01:11:05.101912+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.09119","created_at":"2026-05-18T01:11:05.101912+00:00"},{"alias_kind":"pith_short_12","alias_value":"HDQ73OHUO5I3","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"HDQ73OHUO5I3GXZU","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"HDQ73OHU","created_at":"2026-05-18T12:29:25.134429+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HDQ73OHUO5I3GXZUZFHRH5J2TN","json":"https://pith.science/pith/HDQ73OHUO5I3GXZUZFHRH5J2TN.json","graph_json":"https://pith.science/api/pith-number/HDQ73OHUO5I3GXZUZFHRH5J2TN/graph.json","events_json":"https://pith.science/api/pith-number/HDQ73OHUO5I3GXZUZFHRH5J2TN/events.json","paper":"https://pith.science/paper/HDQ73OHU"},"agent_actions":{"view_html":"https://pith.science/pith/HDQ73OHUO5I3GXZUZFHRH5J2TN","download_json":"https://pith.science/pith/HDQ73OHUO5I3GXZUZFHRH5J2TN.json","view_paper":"https://pith.science/paper/HDQ73OHU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.09119&json=true","fetch_graph":"https://pith.science/api/pith-number/HDQ73OHUO5I3GXZUZFHRH5J2TN/graph.json","fetch_events":"https://pith.science/api/pith-number/HDQ73OHUO5I3GXZUZFHRH5J2TN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HDQ73OHUO5I3GXZUZFHRH5J2TN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HDQ73OHUO5I3GXZUZFHRH5J2TN/action/storage_attestation","attest_author":"https://pith.science/pith/HDQ73OHUO5I3GXZUZFHRH5J2TN/action/author_attestation","sign_citation":"https://pith.science/pith/HDQ73OHUO5I3GXZUZFHRH5J2TN/action/citation_signature","submit_replication":"https://pith.science/pith/HDQ73OHUO5I3GXZUZFHRH5J2TN/action/replication_record"}},"created_at":"2026-05-18T01:11:05.101912+00:00","updated_at":"2026-05-18T01:11:05.101912+00:00"}