{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:DMPELZPHRZSEOH65OEAWNVCWWY","short_pith_number":"pith:DMPELZPH","canonical_record":{"source":{"id":"2002.03613","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-02-10T09:36:39Z","cross_cats_sorted":[],"title_canon_sha256":"98647e5370c42a0c790c12540e76ded8b28fa387fea1d5d49f9437e1d17133e4","abstract_canon_sha256":"388a617ebc21d51112974c713666bb4ef24502e1a4d0dd95cc8565aaddcc2d26"},"schema_version":"1.0"},"canonical_sha256":"1b1e45e5e78e64471fdd710166d456b62417f52e1015fa2a1fae7f16c7e69bcd","source":{"kind":"arxiv","id":"2002.03613","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.03613","created_at":"2026-07-05T01:03:42Z"},{"alias_kind":"arxiv_version","alias_value":"2002.03613v2","created_at":"2026-07-05T01:03:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.03613","created_at":"2026-07-05T01:03:42Z"},{"alias_kind":"pith_short_12","alias_value":"DMPELZPHRZSE","created_at":"2026-07-05T01:03:42Z"},{"alias_kind":"pith_short_16","alias_value":"DMPELZPHRZSEOH65","created_at":"2026-07-05T01:03:42Z"},{"alias_kind":"pith_short_8","alias_value":"DMPELZPH","created_at":"2026-07-05T01:03:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:DMPELZPHRZSEOH65OEAWNVCWWY","target":"record","payload":{"canonical_record":{"source":{"id":"2002.03613","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-02-10T09:36:39Z","cross_cats_sorted":[],"title_canon_sha256":"98647e5370c42a0c790c12540e76ded8b28fa387fea1d5d49f9437e1d17133e4","abstract_canon_sha256":"388a617ebc21d51112974c713666bb4ef24502e1a4d0dd95cc8565aaddcc2d26"},"schema_version":"1.0"},"canonical_sha256":"1b1e45e5e78e64471fdd710166d456b62417f52e1015fa2a1fae7f16c7e69bcd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:03:42.621962Z","signature_b64":"hQb4GsH8FrBGU+Z9hmjeVLfNc1haj+u9HJl7VHd039vxFJyxjh+kmgvz0/a1I2cyCjiawC+AVAyjmAODYMXTBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b1e45e5e78e64471fdd710166d456b62417f52e1015fa2a1fae7f16c7e69bcd","last_reissued_at":"2026-07-05T01:03:42.621477Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:03:42.621477Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2002.03613","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-07-05T01:03:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Af0UWlfsjnMEsvEf2FOzWi9id/DrUGWi46zqaEqzlOtrg6OsB/guPzRWa/RRoauRB9pOavMQ0AD/XWs8qhrlBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T12:29:49.812777Z"},"content_sha256":"df5b294c1880d5a9f94dbcfbc8520702cfe104f1a0cc05d4d9fe4d380ab51946","schema_version":"1.0","event_id":"sha256:df5b294c1880d5a9f94dbcfbc8520702cfe104f1a0cc05d4d9fe4d380ab51946"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:DMPELZPHRZSEOH65OEAWNVCWWY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Istanbul BFT Consensus Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Henrique Moniz","submitted_at":"2020-02-10T09:36:39Z","abstract_excerpt":"This paper presents IBFT, a simple and elegant Byzantine fault-tolerant consensus algorithm that is used to implement state machine replication in the \\emph{Quorum} blockchain. IBFT assumes a partially synchronous communication model, where safety does not depend on any timing assumptions and only liveness depends on periods of synchrony. The algorithm is deterministic, leader-based, and optimally resilient - tolerating $f$ faulty processes out of $n$, where $n \\geq 3f+1$. During periods of good communication, IBFT achieves termination in three message delays and has $O(n^2)$ total communicati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.03613","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2002.03613/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:03:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zeVUiWXN78ugY9vnww04VAqZ/bt36jruBuRQlf5biXDKelmqpMn9c9XxgRdZ5JKJs46UHS1zQs/Zluamv5nKBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T12:29:49.813306Z"},"content_sha256":"60fb059220bc7ca527b328a94fc2886d79cea52f3a880c0fd1842fb0112586ed","schema_version":"1.0","event_id":"sha256:60fb059220bc7ca527b328a94fc2886d79cea52f3a880c0fd1842fb0112586ed"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DMPELZPHRZSEOH65OEAWNVCWWY/bundle.json","state_url":"https://pith.science/pith/DMPELZPHRZSEOH65OEAWNVCWWY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DMPELZPHRZSEOH65OEAWNVCWWY/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-08-17T12:29:49Z","links":{"resolver":"https://pith.science/pith/DMPELZPHRZSEOH65OEAWNVCWWY","bundle":"https://pith.science/pith/DMPELZPHRZSEOH65OEAWNVCWWY/bundle.json","state":"https://pith.science/pith/DMPELZPHRZSEOH65OEAWNVCWWY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DMPELZPHRZSEOH65OEAWNVCWWY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:DMPELZPHRZSEOH65OEAWNVCWWY","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":"388a617ebc21d51112974c713666bb4ef24502e1a4d0dd95cc8565aaddcc2d26","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-02-10T09:36:39Z","title_canon_sha256":"98647e5370c42a0c790c12540e76ded8b28fa387fea1d5d49f9437e1d17133e4"},"schema_version":"1.0","source":{"id":"2002.03613","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.03613","created_at":"2026-07-05T01:03:42Z"},{"alias_kind":"arxiv_version","alias_value":"2002.03613v2","created_at":"2026-07-05T01:03:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.03613","created_at":"2026-07-05T01:03:42Z"},{"alias_kind":"pith_short_12","alias_value":"DMPELZPHRZSE","created_at":"2026-07-05T01:03:42Z"},{"alias_kind":"pith_short_16","alias_value":"DMPELZPHRZSEOH65","created_at":"2026-07-05T01:03:42Z"},{"alias_kind":"pith_short_8","alias_value":"DMPELZPH","created_at":"2026-07-05T01:03:42Z"}],"graph_snapshots":[{"event_id":"sha256:60fb059220bc7ca527b328a94fc2886d79cea52f3a880c0fd1842fb0112586ed","target":"graph","created_at":"2026-07-05T01:03:42Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2002.03613/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper presents IBFT, a simple and elegant Byzantine fault-tolerant consensus algorithm that is used to implement state machine replication in the \\emph{Quorum} blockchain. IBFT assumes a partially synchronous communication model, where safety does not depend on any timing assumptions and only liveness depends on periods of synchrony. The algorithm is deterministic, leader-based, and optimally resilient - tolerating $f$ faulty processes out of $n$, where $n \\geq 3f+1$. During periods of good communication, IBFT achieves termination in three message delays and has $O(n^2)$ total communicati","authors_text":"Henrique Moniz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-02-10T09:36:39Z","title":"The Istanbul BFT Consensus Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.03613","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:df5b294c1880d5a9f94dbcfbc8520702cfe104f1a0cc05d4d9fe4d380ab51946","target":"record","created_at":"2026-07-05T01:03:42Z","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":"388a617ebc21d51112974c713666bb4ef24502e1a4d0dd95cc8565aaddcc2d26","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-02-10T09:36:39Z","title_canon_sha256":"98647e5370c42a0c790c12540e76ded8b28fa387fea1d5d49f9437e1d17133e4"},"schema_version":"1.0","source":{"id":"2002.03613","kind":"arxiv","version":2}},"canonical_sha256":"1b1e45e5e78e64471fdd710166d456b62417f52e1015fa2a1fae7f16c7e69bcd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b1e45e5e78e64471fdd710166d456b62417f52e1015fa2a1fae7f16c7e69bcd","first_computed_at":"2026-07-05T01:03:42.621477Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:03:42.621477Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hQb4GsH8FrBGU+Z9hmjeVLfNc1haj+u9HJl7VHd039vxFJyxjh+kmgvz0/a1I2cyCjiawC+AVAyjmAODYMXTBg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:03:42.621962Z","signed_message":"canonical_sha256_bytes"},"source_id":"2002.03613","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:df5b294c1880d5a9f94dbcfbc8520702cfe104f1a0cc05d4d9fe4d380ab51946","sha256:60fb059220bc7ca527b328a94fc2886d79cea52f3a880c0fd1842fb0112586ed"],"state_sha256":"e6041aee502789547aa14fd2861a7e854502b2b882decf5d98e0ce13e4f29a70"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VDF5lj6g6cVat9WJPmd9c1wOHlRq/fP0H5jHuiA//d180VH38ia0Fc15RL97z8rbYXTqoAy7jS7shepwUlIjDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T12:29:49.816800Z","bundle_sha256":"02f17f893c515d60d0454af7a9559ab0ea8b4f4efb2fdcfa18549682862e447f"}}