{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:4ZDSHJWFBCAPCKZ7HETVCFYQLB","short_pith_number":"pith:4ZDSHJWF","schema_version":"1.0","canonical_sha256":"e64723a6c50880f12b3f3927511710584ad9f2285efa4ef4103e426421ea6d98","source":{"kind":"arxiv","id":"1905.07063","version":1},"attestation_state":"computed","paper":{"title":"On the complexity of fault-tolerant consensus","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Dariusz R. Kowalski, Jaroslaw Mirek","submitted_at":"2019-05-16T23:36:13Z","abstract_excerpt":"The paper studies the problem of reaching agreement in a distributed message-passing system prone to crash failures. Crashes are generated by \\constrained\\ adversaries - a \\wadapt\\ adversary, who has to fix in advance the set of $f$ crash-prone processes, or a \\chainadapt\\ adversary, who orders all the processes into $k$ disjoint chains and has to follow this pattern when crashing them. Apart from these constraints, both of them may crash processes in an adaptive way at any time. While commonly used \\sadapt\\ adversaries model attacks and \\noadapt\\ ones -- pre-defined faults, the constrained ad"},"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":"1905.07063","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2019-05-16T23:36:13Z","cross_cats_sorted":[],"title_canon_sha256":"ca796f7164167f0cdc6678bf275b6c82b9c2b815da88c12c78aa005d413cfd2f","abstract_canon_sha256":"f359f691c44c6025db4886e369855cc7072e15a9528e1628e2ba9d2a77aa932f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:57.406147Z","signature_b64":"oKMcAkoxzuoUFch0E+7w/iPvigfM1ZJBqdnUcyOXog+DVbJcnZRnsbA0ap/c7FDRhfDG4mTPK+QEnmZfwBRvBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e64723a6c50880f12b3f3927511710584ad9f2285efa4ef4103e426421ea6d98","last_reissued_at":"2026-05-17T23:45:57.405624Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:57.405624Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the complexity of fault-tolerant consensus","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Dariusz R. Kowalski, Jaroslaw Mirek","submitted_at":"2019-05-16T23:36:13Z","abstract_excerpt":"The paper studies the problem of reaching agreement in a distributed message-passing system prone to crash failures. Crashes are generated by \\constrained\\ adversaries - a \\wadapt\\ adversary, who has to fix in advance the set of $f$ crash-prone processes, or a \\chainadapt\\ adversary, who orders all the processes into $k$ disjoint chains and has to follow this pattern when crashing them. Apart from these constraints, both of them may crash processes in an adaptive way at any time. While commonly used \\sadapt\\ adversaries model attacks and \\noadapt\\ ones -- pre-defined faults, the constrained ad"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.07063","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1905.07063","created_at":"2026-05-17T23:45:57.405731+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.07063v1","created_at":"2026-05-17T23:45:57.405731+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.07063","created_at":"2026-05-17T23:45:57.405731+00:00"},{"alias_kind":"pith_short_12","alias_value":"4ZDSHJWFBCAP","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"4ZDSHJWFBCAPCKZ7","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"4ZDSHJWF","created_at":"2026-05-18T12:33:10.108867+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/4ZDSHJWFBCAPCKZ7HETVCFYQLB","json":"https://pith.science/pith/4ZDSHJWFBCAPCKZ7HETVCFYQLB.json","graph_json":"https://pith.science/api/pith-number/4ZDSHJWFBCAPCKZ7HETVCFYQLB/graph.json","events_json":"https://pith.science/api/pith-number/4ZDSHJWFBCAPCKZ7HETVCFYQLB/events.json","paper":"https://pith.science/paper/4ZDSHJWF"},"agent_actions":{"view_html":"https://pith.science/pith/4ZDSHJWFBCAPCKZ7HETVCFYQLB","download_json":"https://pith.science/pith/4ZDSHJWFBCAPCKZ7HETVCFYQLB.json","view_paper":"https://pith.science/paper/4ZDSHJWF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.07063&json=true","fetch_graph":"https://pith.science/api/pith-number/4ZDSHJWFBCAPCKZ7HETVCFYQLB/graph.json","fetch_events":"https://pith.science/api/pith-number/4ZDSHJWFBCAPCKZ7HETVCFYQLB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4ZDSHJWFBCAPCKZ7HETVCFYQLB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4ZDSHJWFBCAPCKZ7HETVCFYQLB/action/storage_attestation","attest_author":"https://pith.science/pith/4ZDSHJWFBCAPCKZ7HETVCFYQLB/action/author_attestation","sign_citation":"https://pith.science/pith/4ZDSHJWFBCAPCKZ7HETVCFYQLB/action/citation_signature","submit_replication":"https://pith.science/pith/4ZDSHJWFBCAPCKZ7HETVCFYQLB/action/replication_record"}},"created_at":"2026-05-17T23:45:57.405731+00:00","updated_at":"2026-05-17T23:45:57.405731+00:00"}