{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:2I554RUJOGQQHC5DVJL7O4TFIW","short_pith_number":"pith:2I554RUJ","canonical_record":{"source":{"id":"1807.01829","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-07-05T02:26:23Z","cross_cats_sorted":[],"title_canon_sha256":"c221d5aaeb579421866819e4069ab02f77d2763b5b8633c2d95c47d56016e321","abstract_canon_sha256":"b15e7273bae37b867b52207a555ee1dac0e15db4628cf0e9d184f9ecd62896d8"},"schema_version":"1.0"},"canonical_sha256":"d23bde468971a1038ba3aa57f772654581cb87b3a57020f95c949eb5b115688c","source":{"kind":"arxiv","id":"1807.01829","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.01829","created_at":"2026-05-18T00:11:28Z"},{"alias_kind":"arxiv_version","alias_value":"1807.01829v1","created_at":"2026-05-18T00:11:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.01829","created_at":"2026-05-18T00:11:28Z"},{"alias_kind":"pith_short_12","alias_value":"2I554RUJOGQQ","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2I554RUJOGQQHC5D","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2I554RUJ","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:2I554RUJOGQQHC5DVJL7O4TFIW","target":"record","payload":{"canonical_record":{"source":{"id":"1807.01829","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-07-05T02:26:23Z","cross_cats_sorted":[],"title_canon_sha256":"c221d5aaeb579421866819e4069ab02f77d2763b5b8633c2d95c47d56016e321","abstract_canon_sha256":"b15e7273bae37b867b52207a555ee1dac0e15db4628cf0e9d184f9ecd62896d8"},"schema_version":"1.0"},"canonical_sha256":"d23bde468971a1038ba3aa57f772654581cb87b3a57020f95c949eb5b115688c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:28.549559Z","signature_b64":"/Bh93xfdASRgXYlajWs5F38r89nIQ7Ogr//03/LujTInt+IDNPeidEkcJWaGOlj1Bj1ISTgk8nYjIiAJRYI4Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d23bde468971a1038ba3aa57f772654581cb87b3a57020f95c949eb5b115688c","last_reissued_at":"2026-05-18T00:11:28.549196Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:28.549196Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.01829","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-18T00:11:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bmtyHu4mCXFhJlt+rovyON/1Vb3ACGfOG4rydUHRhhjcm9gxJea1GenrK6SwdgSI2f8pMvP3ysbYid/+Si/CAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T17:19:07.387611Z"},"content_sha256":"946520b9a08c43d8d43a7a811db6e3ef0558432e1d392b4c08f11c2601c5e7dc","schema_version":"1.0","event_id":"sha256:946520b9a08c43d8d43a7a811db6e3ef0558432e1d392b4c08f11c2601c5e7dc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:2I554RUJOGQQHC5DVJL7O4TFIW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"LinBFT: Linear-Communication Byzantine Fault Tolerance for Public Blockchains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Yin Yang","submitted_at":"2018-07-05T02:26:23Z","abstract_excerpt":"This paper presents LinBFT, a novel Byzantine fault tolerance (BFT) protocol for blockchain systems that achieves amortized O(n) communication volume per block under reasonable conditions (where n is the number of participants), while satisfying determinist guarantees on safety and liveness. This significantly improves previous results, which either incurs quadratic communication complexity, or only satisfies safety in a probabilistic sense. LinBFT is based on the popular PBFT protocol, and cuts down its $O(n^4)$ complexity with three tricks, each by $O(n)$: linear view change, threshold signa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.01829","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-18T00:11:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UXUafR6yVsYQVWn1rd+4uSOAWwGzoHwBVCbQ2+tPFQUkpHcXjdKdARBW+mm+Fv3gtlPJJB8sUSR7O/Zjy2J1Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T17:19:07.388361Z"},"content_sha256":"2f2b5824e900d721f826a79339351957ed04a1898c7022a0b7cbf794b8116e14","schema_version":"1.0","event_id":"sha256:2f2b5824e900d721f826a79339351957ed04a1898c7022a0b7cbf794b8116e14"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2I554RUJOGQQHC5DVJL7O4TFIW/bundle.json","state_url":"https://pith.science/pith/2I554RUJOGQQHC5DVJL7O4TFIW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2I554RUJOGQQHC5DVJL7O4TFIW/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-16T17:19:07Z","links":{"resolver":"https://pith.science/pith/2I554RUJOGQQHC5DVJL7O4TFIW","bundle":"https://pith.science/pith/2I554RUJOGQQHC5DVJL7O4TFIW/bundle.json","state":"https://pith.science/pith/2I554RUJOGQQHC5DVJL7O4TFIW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2I554RUJOGQQHC5DVJL7O4TFIW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:2I554RUJOGQQHC5DVJL7O4TFIW","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":"b15e7273bae37b867b52207a555ee1dac0e15db4628cf0e9d184f9ecd62896d8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-07-05T02:26:23Z","title_canon_sha256":"c221d5aaeb579421866819e4069ab02f77d2763b5b8633c2d95c47d56016e321"},"schema_version":"1.0","source":{"id":"1807.01829","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.01829","created_at":"2026-05-18T00:11:28Z"},{"alias_kind":"arxiv_version","alias_value":"1807.01829v1","created_at":"2026-05-18T00:11:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.01829","created_at":"2026-05-18T00:11:28Z"},{"alias_kind":"pith_short_12","alias_value":"2I554RUJOGQQ","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2I554RUJOGQQHC5D","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2I554RUJ","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:2f2b5824e900d721f826a79339351957ed04a1898c7022a0b7cbf794b8116e14","target":"graph","created_at":"2026-05-18T00:11:28Z","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":"This paper presents LinBFT, a novel Byzantine fault tolerance (BFT) protocol for blockchain systems that achieves amortized O(n) communication volume per block under reasonable conditions (where n is the number of participants), while satisfying determinist guarantees on safety and liveness. This significantly improves previous results, which either incurs quadratic communication complexity, or only satisfies safety in a probabilistic sense. LinBFT is based on the popular PBFT protocol, and cuts down its $O(n^4)$ complexity with three tricks, each by $O(n)$: linear view change, threshold signa","authors_text":"Yin Yang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-07-05T02:26:23Z","title":"LinBFT: Linear-Communication Byzantine Fault Tolerance for Public Blockchains"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.01829","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:946520b9a08c43d8d43a7a811db6e3ef0558432e1d392b4c08f11c2601c5e7dc","target":"record","created_at":"2026-05-18T00:11:28Z","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":"b15e7273bae37b867b52207a555ee1dac0e15db4628cf0e9d184f9ecd62896d8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-07-05T02:26:23Z","title_canon_sha256":"c221d5aaeb579421866819e4069ab02f77d2763b5b8633c2d95c47d56016e321"},"schema_version":"1.0","source":{"id":"1807.01829","kind":"arxiv","version":1}},"canonical_sha256":"d23bde468971a1038ba3aa57f772654581cb87b3a57020f95c949eb5b115688c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d23bde468971a1038ba3aa57f772654581cb87b3a57020f95c949eb5b115688c","first_computed_at":"2026-05-18T00:11:28.549196Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:28.549196Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/Bh93xfdASRgXYlajWs5F38r89nIQ7Ogr//03/LujTInt+IDNPeidEkcJWaGOlj1Bj1ISTgk8nYjIiAJRYI4Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:28.549559Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.01829","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:946520b9a08c43d8d43a7a811db6e3ef0558432e1d392b4c08f11c2601c5e7dc","sha256:2f2b5824e900d721f826a79339351957ed04a1898c7022a0b7cbf794b8116e14"],"state_sha256":"397c46eea14289785316bcd4f52ee2aefd1d1e3948c3dd499b574999201dab8d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m2wvXAcgm0qM6CFYhMJRabZ3lyuFfChVSLCFD7X7QBOE58y+TfaIgNwSYwWAjWKTMQEtx7XAoMg4ziAKULLHBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T17:19:07.394710Z","bundle_sha256":"cf3cc684ed8af2213c203956ce1f4a39d3e2b9be61b97d5d2f380d0c3a0e7126"}}