{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:4ZDSHJWFBCAPCKZ7HETVCFYQLB","short_pith_number":"pith:4ZDSHJWF","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"},"canonical_sha256":"e64723a6c50880f12b3f3927511710584ad9f2285efa4ef4103e426421ea6d98","source":{"kind":"arxiv","id":"1905.07063","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.07063","created_at":"2026-05-17T23:45:57Z"},{"alias_kind":"arxiv_version","alias_value":"1905.07063v1","created_at":"2026-05-17T23:45:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.07063","created_at":"2026-05-17T23:45:57Z"},{"alias_kind":"pith_short_12","alias_value":"4ZDSHJWFBCAP","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"4ZDSHJWFBCAPCKZ7","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"4ZDSHJWF","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:4ZDSHJWFBCAPCKZ7HETVCFYQLB","target":"record","payload":{"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"},"canonical_sha256":"e64723a6c50880f12b3f3927511710584ad9f2285efa4ef4103e426421ea6d98","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"},"source_kind":"arxiv","source_id":"1905.07063","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-17T23:45:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AQ9pdAc6woJuZ7YooM+pFPC6WFv08hVaxMc0HDCurn+meYK5EhnH3VgTQYG4FbdBuHXN6KllOhkhNr63HyL0Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T14:51:24.041834Z"},"content_sha256":"f26725346dcd8aee1260442b240543c568941e91a872f718ea6fd81725506670","schema_version":"1.0","event_id":"sha256:f26725346dcd8aee1260442b240543c568941e91a872f718ea6fd81725506670"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:4ZDSHJWFBCAPCKZ7HETVCFYQLB","target":"graph","payload":{"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"},"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-17T23:45:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v4HLGD4Z1HXy1q0Bm2T77Fqvyb/i3QS+eIsPyQpb2q6BZmPNbCe0TnNvDJyJ0lz+9ZBy7K2ZSSdfkTgI19yiBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T14:51:24.042425Z"},"content_sha256":"8c60e26409a29b5700138b9960a6de53fa27752f4e3e59848cecadfc845818f2","schema_version":"1.0","event_id":"sha256:8c60e26409a29b5700138b9960a6de53fa27752f4e3e59848cecadfc845818f2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4ZDSHJWFBCAPCKZ7HETVCFYQLB/bundle.json","state_url":"https://pith.science/pith/4ZDSHJWFBCAPCKZ7HETVCFYQLB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4ZDSHJWFBCAPCKZ7HETVCFYQLB/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-23T14:51:24Z","links":{"resolver":"https://pith.science/pith/4ZDSHJWFBCAPCKZ7HETVCFYQLB","bundle":"https://pith.science/pith/4ZDSHJWFBCAPCKZ7HETVCFYQLB/bundle.json","state":"https://pith.science/pith/4ZDSHJWFBCAPCKZ7HETVCFYQLB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4ZDSHJWFBCAPCKZ7HETVCFYQLB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:4ZDSHJWFBCAPCKZ7HETVCFYQLB","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":"f359f691c44c6025db4886e369855cc7072e15a9528e1628e2ba9d2a77aa932f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2019-05-16T23:36:13Z","title_canon_sha256":"ca796f7164167f0cdc6678bf275b6c82b9c2b815da88c12c78aa005d413cfd2f"},"schema_version":"1.0","source":{"id":"1905.07063","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.07063","created_at":"2026-05-17T23:45:57Z"},{"alias_kind":"arxiv_version","alias_value":"1905.07063v1","created_at":"2026-05-17T23:45:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.07063","created_at":"2026-05-17T23:45:57Z"},{"alias_kind":"pith_short_12","alias_value":"4ZDSHJWFBCAP","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"4ZDSHJWFBCAPCKZ7","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"4ZDSHJWF","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:8c60e26409a29b5700138b9960a6de53fa27752f4e3e59848cecadfc845818f2","target":"graph","created_at":"2026-05-17T23:45:57Z","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 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","authors_text":"Dariusz R. Kowalski, Jaroslaw Mirek","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2019-05-16T23:36:13Z","title":"On the complexity of fault-tolerant consensus"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.07063","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:f26725346dcd8aee1260442b240543c568941e91a872f718ea6fd81725506670","target":"record","created_at":"2026-05-17T23:45:57Z","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":"f359f691c44c6025db4886e369855cc7072e15a9528e1628e2ba9d2a77aa932f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2019-05-16T23:36:13Z","title_canon_sha256":"ca796f7164167f0cdc6678bf275b6c82b9c2b815da88c12c78aa005d413cfd2f"},"schema_version":"1.0","source":{"id":"1905.07063","kind":"arxiv","version":1}},"canonical_sha256":"e64723a6c50880f12b3f3927511710584ad9f2285efa4ef4103e426421ea6d98","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e64723a6c50880f12b3f3927511710584ad9f2285efa4ef4103e426421ea6d98","first_computed_at":"2026-05-17T23:45:57.405624Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:57.405624Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oKMcAkoxzuoUFch0E+7w/iPvigfM1ZJBqdnUcyOXog+DVbJcnZRnsbA0ap/c7FDRhfDG4mTPK+QEnmZfwBRvBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:57.406147Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.07063","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f26725346dcd8aee1260442b240543c568941e91a872f718ea6fd81725506670","sha256:8c60e26409a29b5700138b9960a6de53fa27752f4e3e59848cecadfc845818f2"],"state_sha256":"27d03d921fec78cc2ce2d27299bfd548455624e31c6ba926a684ec4427747f6c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"17Ceg5YriZZLFHDs4Y0+oEvQPblwjZP8T38oAVg6UqS75BlphB+73O+0GsmUN1c1T2mOkiykvc80P10KB7j/Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T14:51:24.045452Z","bundle_sha256":"e86f8cfbbfba94f608eb320431edeac59a675337f7166c10bab7e64f9bf36019"}}