{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:ID456PAICZEECRDFA77JTLABNK","short_pith_number":"pith:ID456PAI","canonical_record":{"source":{"id":"1907.11445","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2019-07-26T09:14:54Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"88b13ddd2faff1ee941e2795b5f4276b5b140eacad3eab4bc9a68ee7ec2c0304","abstract_canon_sha256":"fbdf300c87809d95186c86d58bf79d72c8ae281b774f8510ee598e937f7d1da0"},"schema_version":"1.0"},"canonical_sha256":"40f9df3c08164841446507fe99ac016aa61802a20b894a290908a1082d85f81b","source":{"kind":"arxiv","id":"1907.11445","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.11445","created_at":"2026-05-17T23:39:29Z"},{"alias_kind":"arxiv_version","alias_value":"1907.11445v1","created_at":"2026-05-17T23:39:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.11445","created_at":"2026-05-17T23:39:29Z"},{"alias_kind":"pith_short_12","alias_value":"ID456PAICZEE","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"ID456PAICZEECRDF","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"ID456PAI","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:ID456PAICZEECRDFA77JTLABNK","target":"record","payload":{"canonical_record":{"source":{"id":"1907.11445","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2019-07-26T09:14:54Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"88b13ddd2faff1ee941e2795b5f4276b5b140eacad3eab4bc9a68ee7ec2c0304","abstract_canon_sha256":"fbdf300c87809d95186c86d58bf79d72c8ae281b774f8510ee598e937f7d1da0"},"schema_version":"1.0"},"canonical_sha256":"40f9df3c08164841446507fe99ac016aa61802a20b894a290908a1082d85f81b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:29.054023Z","signature_b64":"aCvW63ir5mXa3J2eW5lz7UhnOHbFB24Sk/7qc+7HN+DPfsjJQ/WtaqWZk+d0qvQibJJ/gSGTVRW7lkK/wxUGDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"40f9df3c08164841446507fe99ac016aa61802a20b894a290908a1082d85f81b","last_reissued_at":"2026-05-17T23:39:29.053436Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:29.053436Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.11445","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:39:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ae0OpUu8fcXd7Y0ElIZxgBnUNiXviFZ+EbxAE1SMgtKkY5QKetmi+RzuvYz/u2/hghqEi+Fi0Ruvx0IfGM3NDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:08:08.881000Z"},"content_sha256":"e5085e84d862628650f21f171bf8058e020116243915449346cb1edae4b2870b","schema_version":"1.0","event_id":"sha256:e5085e84d862628650f21f171bf8058e020116243915449346cb1edae4b2870b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:ID456PAICZEECRDFA77JTLABNK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Protocol for Asynchronous, Reliable, Secure and Efficient Consensus (PARSEC) Version 2.0","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.CR","authors_text":"Andreas Fackler, Bartlomiej Kaminski, Fraser Hutchison, Pierre Chevalier, Qi Ma, Spandan Sharma, William J Buchanan","submitted_at":"2019-07-26T09:14:54Z","abstract_excerpt":"In this paper we present an open source, fully asynchronous, leaderless algorithm for reaching consensus in the presence of Byzantine faults in an asynchronous network. We prove the algorithm's correctness provided that less than a third of participating nodes are faulty. We also present a way of applying the algorithm to a network with dynamic membership, i.e. a network in which nodes can join and leave at will. The core contribution of this paper is an optimal model in the definition of an asynchronous BFT protocol, and which is resilient to 1/3 byzantine nodes. This model matches an agreeme"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.11445","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:39:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FeSOPM8+OlNT4C1mcWbHKSHvrkr9kWePNJXXXtBmr8Km3/OOv2BoVW1ZDbNKZ6RYWZJWFrJxU8zig3EJZxhGAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:08:08.881699Z"},"content_sha256":"a8e5fa406f7c85c2696794aaad96a58fa9bc6ccb708b4995c2ebfd689336a039","schema_version":"1.0","event_id":"sha256:a8e5fa406f7c85c2696794aaad96a58fa9bc6ccb708b4995c2ebfd689336a039"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ID456PAICZEECRDFA77JTLABNK/bundle.json","state_url":"https://pith.science/pith/ID456PAICZEECRDFA77JTLABNK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ID456PAICZEECRDFA77JTLABNK/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-26T07:08:08Z","links":{"resolver":"https://pith.science/pith/ID456PAICZEECRDFA77JTLABNK","bundle":"https://pith.science/pith/ID456PAICZEECRDFA77JTLABNK/bundle.json","state":"https://pith.science/pith/ID456PAICZEECRDFA77JTLABNK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ID456PAICZEECRDFA77JTLABNK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:ID456PAICZEECRDFA77JTLABNK","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":"fbdf300c87809d95186c86d58bf79d72c8ae281b774f8510ee598e937f7d1da0","cross_cats_sorted":["cs.DC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2019-07-26T09:14:54Z","title_canon_sha256":"88b13ddd2faff1ee941e2795b5f4276b5b140eacad3eab4bc9a68ee7ec2c0304"},"schema_version":"1.0","source":{"id":"1907.11445","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.11445","created_at":"2026-05-17T23:39:29Z"},{"alias_kind":"arxiv_version","alias_value":"1907.11445v1","created_at":"2026-05-17T23:39:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.11445","created_at":"2026-05-17T23:39:29Z"},{"alias_kind":"pith_short_12","alias_value":"ID456PAICZEE","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"ID456PAICZEECRDF","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"ID456PAI","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:a8e5fa406f7c85c2696794aaad96a58fa9bc6ccb708b4995c2ebfd689336a039","target":"graph","created_at":"2026-05-17T23:39:29Z","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":"In this paper we present an open source, fully asynchronous, leaderless algorithm for reaching consensus in the presence of Byzantine faults in an asynchronous network. We prove the algorithm's correctness provided that less than a third of participating nodes are faulty. We also present a way of applying the algorithm to a network with dynamic membership, i.e. a network in which nodes can join and leave at will. The core contribution of this paper is an optimal model in the definition of an asynchronous BFT protocol, and which is resilient to 1/3 byzantine nodes. This model matches an agreeme","authors_text":"Andreas Fackler, Bartlomiej Kaminski, Fraser Hutchison, Pierre Chevalier, Qi Ma, Spandan Sharma, William J Buchanan","cross_cats":["cs.DC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2019-07-26T09:14:54Z","title":"Protocol for Asynchronous, Reliable, Secure and Efficient Consensus (PARSEC) Version 2.0"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.11445","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:e5085e84d862628650f21f171bf8058e020116243915449346cb1edae4b2870b","target":"record","created_at":"2026-05-17T23:39:29Z","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":"fbdf300c87809d95186c86d58bf79d72c8ae281b774f8510ee598e937f7d1da0","cross_cats_sorted":["cs.DC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2019-07-26T09:14:54Z","title_canon_sha256":"88b13ddd2faff1ee941e2795b5f4276b5b140eacad3eab4bc9a68ee7ec2c0304"},"schema_version":"1.0","source":{"id":"1907.11445","kind":"arxiv","version":1}},"canonical_sha256":"40f9df3c08164841446507fe99ac016aa61802a20b894a290908a1082d85f81b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"40f9df3c08164841446507fe99ac016aa61802a20b894a290908a1082d85f81b","first_computed_at":"2026-05-17T23:39:29.053436Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:29.053436Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aCvW63ir5mXa3J2eW5lz7UhnOHbFB24Sk/7qc+7HN+DPfsjJQ/WtaqWZk+d0qvQibJJ/gSGTVRW7lkK/wxUGDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:29.054023Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.11445","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e5085e84d862628650f21f171bf8058e020116243915449346cb1edae4b2870b","sha256:a8e5fa406f7c85c2696794aaad96a58fa9bc6ccb708b4995c2ebfd689336a039"],"state_sha256":"b8cbbbac0f0710876c4b6cc45fd4167fcd4987277d91d26e1eaa14c44902c686"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WsYKa+z10AastiN3yWI+csFj2HfJH/kXniOiLE93saEdAB2WskgJDnGI7tarhRiWVUMZgHySFudI6ivYigraCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T07:08:08.885664Z","bundle_sha256":"3f104a9a7f678c2c7cc1d80f1af13a92831c877179c14e074c7af9c55f6d662f"}}