{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:GZNSWJ36QOGWUVLFVR64FKU6VE","short_pith_number":"pith:GZNSWJ36","schema_version":"1.0","canonical_sha256":"365b2b277e838d6a5565ac7dc2aa9ea92c3ec7c66923eed7d351b7d2b09f9a1b","source":{"kind":"arxiv","id":"1906.08936","version":2},"attestation_state":"computed","paper":{"title":"Scalable and Probabilistic Leaderless BFT Consensus through Metastability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Emin G\\\"un Sirer, Kevin Sekniqi, Maofan Yin, Robbert van Renesse, Team Rocket","submitted_at":"2019-06-21T03:55:19Z","abstract_excerpt":"This paper introduces a family of leaderless Byzantine fault tolerance protocols, built around a metastable mechanism via network subsampling. These protocols provide a strong probabilistic safety guarantee in the presence of Byzantine adversaries while their concurrent and leaderless nature enables them to achieve high throughput and scalability. Unlike blockchains that rely on proof-of-work, they are quiescent and green. Unlike traditional consensus protocols where one or more nodes typically process linear bits in the number of total nodes per decision, no node processes more than logarithm"},"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":"1906.08936","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-06-21T03:55:19Z","cross_cats_sorted":[],"title_canon_sha256":"eeebc22b6a701ddc1b8839ab41afdda59d8f40cccc46976386035e45be88ba38","abstract_canon_sha256":"fd62cc65e095e627eabc41e11a32c0dde19b5893c9f5ae418c82d7577e55ecb0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:29:00.036427Z","signature_b64":"JeyAke7YGrce2lcf48okiEWS5xqH6HI3JMl7MTXeBP0k8mtr5uOgoJXgxUuWoubv+RZw/83iYMEDbZaHc9q4Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"365b2b277e838d6a5565ac7dc2aa9ea92c3ec7c66923eed7d351b7d2b09f9a1b","last_reissued_at":"2026-07-05T01:29:00.035932Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:29:00.035932Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable and Probabilistic Leaderless BFT Consensus through Metastability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Emin G\\\"un Sirer, Kevin Sekniqi, Maofan Yin, Robbert van Renesse, Team Rocket","submitted_at":"2019-06-21T03:55:19Z","abstract_excerpt":"This paper introduces a family of leaderless Byzantine fault tolerance protocols, built around a metastable mechanism via network subsampling. These protocols provide a strong probabilistic safety guarantee in the presence of Byzantine adversaries while their concurrent and leaderless nature enables them to achieve high throughput and scalability. Unlike blockchains that rely on proof-of-work, they are quiescent and green. Unlike traditional consensus protocols where one or more nodes typically process linear bits in the number of total nodes per decision, no node processes more than logarithm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.08936","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/1906.08936/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1906.08936","created_at":"2026-07-05T01:29:00.035994+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.08936v2","created_at":"2026-07-05T01:29:00.035994+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.08936","created_at":"2026-07-05T01:29:00.035994+00:00"},{"alias_kind":"pith_short_12","alias_value":"GZNSWJ36QOGW","created_at":"2026-07-05T01:29:00.035994+00:00"},{"alias_kind":"pith_short_16","alias_value":"GZNSWJ36QOGWUVLF","created_at":"2026-07-05T01:29:00.035994+00:00"},{"alias_kind":"pith_short_8","alias_value":"GZNSWJ36","created_at":"2026-07-05T01:29:00.035994+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.13180","citing_title":"JiRAIYA: A Reputation-Based Hierarchical Federated Learning Framework on Web3","ref_index":12,"is_internal_anchor":false},{"citing_arxiv_id":"2602.06655","citing_title":"Wonderboom -- Efficient, and Censorship-Resilient Signature Aggregation for Million Scale Consensus","ref_index":34,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GZNSWJ36QOGWUVLFVR64FKU6VE","json":"https://pith.science/pith/GZNSWJ36QOGWUVLFVR64FKU6VE.json","graph_json":"https://pith.science/api/pith-number/GZNSWJ36QOGWUVLFVR64FKU6VE/graph.json","events_json":"https://pith.science/api/pith-number/GZNSWJ36QOGWUVLFVR64FKU6VE/events.json","paper":"https://pith.science/paper/GZNSWJ36"},"agent_actions":{"view_html":"https://pith.science/pith/GZNSWJ36QOGWUVLFVR64FKU6VE","download_json":"https://pith.science/pith/GZNSWJ36QOGWUVLFVR64FKU6VE.json","view_paper":"https://pith.science/paper/GZNSWJ36","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.08936&json=true","fetch_graph":"https://pith.science/api/pith-number/GZNSWJ36QOGWUVLFVR64FKU6VE/graph.json","fetch_events":"https://pith.science/api/pith-number/GZNSWJ36QOGWUVLFVR64FKU6VE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GZNSWJ36QOGWUVLFVR64FKU6VE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GZNSWJ36QOGWUVLFVR64FKU6VE/action/storage_attestation","attest_author":"https://pith.science/pith/GZNSWJ36QOGWUVLFVR64FKU6VE/action/author_attestation","sign_citation":"https://pith.science/pith/GZNSWJ36QOGWUVLFVR64FKU6VE/action/citation_signature","submit_replication":"https://pith.science/pith/GZNSWJ36QOGWUVLFVR64FKU6VE/action/replication_record"}},"created_at":"2026-07-05T01:29:00.035994+00:00","updated_at":"2026-07-05T01:29:00.035994+00:00"}