{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:3J4M7F3UQW556XQEM4JP4OMDT7","short_pith_number":"pith:3J4M7F3U","schema_version":"1.0","canonical_sha256":"da78cf977485bbdf5e046712fe39839fe71b2399b63b099b64e27d371672ba45","source":{"kind":"arxiv","id":"1510.06882","version":2},"attestation_state":"computed","paper":{"title":"Trading off $t$-Resilience for Efficiency in Asynchronous Byzantine Reliable Broadcast","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Damien Imbs, Michel Raynal","submitted_at":"2015-10-23T10:29:19Z","abstract_excerpt":"This paper presents a simple and efficient reliable broadcast algorithm for asynchronous message-passing systems made up of $n$ processes, among which up to $t<n/5$ may behave arbitrarily (Byzantine processes). This algorithm requires two communication steps and $n^2-1$ messages. When compared to Bracha's algorithm, which is resilience optimal ($t<n/3$) and requires three communication steps and $2n^2-n-1$ messages, the proposed algorithm shows an interesting tradeoff between communication efficiency and $t$-resilience."},"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":"1510.06882","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-10-23T10:29:19Z","cross_cats_sorted":[],"title_canon_sha256":"ddbf82ee167d188a7598e003881978c7088fe386fddc362f87e75de2f167d442","abstract_canon_sha256":"898002a2edc4c0130237e5faad09518980088e8ec98b29e8b52348d52c922e83"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:17:43.021159Z","signature_b64":"X8AtTtFRms/5wL/13XkHekpDVm0rOVX9RGTdi/hlEYmBYDwgO12VzaMpth+ba8ROiFoeNckT+HgYBNt6pJfJDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da78cf977485bbdf5e046712fe39839fe71b2399b63b099b64e27d371672ba45","last_reissued_at":"2026-07-05T03:17:43.020741Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:17:43.020741Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Trading off $t$-Resilience for Efficiency in Asynchronous Byzantine Reliable Broadcast","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Damien Imbs, Michel Raynal","submitted_at":"2015-10-23T10:29:19Z","abstract_excerpt":"This paper presents a simple and efficient reliable broadcast algorithm for asynchronous message-passing systems made up of $n$ processes, among which up to $t<n/5$ may behave arbitrarily (Byzantine processes). This algorithm requires two communication steps and $n^2-1$ messages. When compared to Bracha's algorithm, which is resilience optimal ($t<n/3$) and requires three communication steps and $2n^2-n-1$ messages, the proposed algorithm shows an interesting tradeoff between communication efficiency and $t$-resilience."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.06882","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/1510.06882/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":"1510.06882","created_at":"2026-07-05T03:17:43.020796+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.06882v2","created_at":"2026-07-05T03:17:43.020796+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.06882","created_at":"2026-07-05T03:17:43.020796+00:00"},{"alias_kind":"pith_short_12","alias_value":"3J4M7F3UQW55","created_at":"2026-07-05T03:17:43.020796+00:00"},{"alias_kind":"pith_short_16","alias_value":"3J4M7F3UQW556XQE","created_at":"2026-07-05T03:17:43.020796+00:00"},{"alias_kind":"pith_short_8","alias_value":"3J4M7F3U","created_at":"2026-07-05T03:17:43.020796+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.05735","citing_title":"All-to-All Communication with Mobile Edge Adversary: Almost Linearly More Faults, For Free","ref_index":40,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3J4M7F3UQW556XQEM4JP4OMDT7","json":"https://pith.science/pith/3J4M7F3UQW556XQEM4JP4OMDT7.json","graph_json":"https://pith.science/api/pith-number/3J4M7F3UQW556XQEM4JP4OMDT7/graph.json","events_json":"https://pith.science/api/pith-number/3J4M7F3UQW556XQEM4JP4OMDT7/events.json","paper":"https://pith.science/paper/3J4M7F3U"},"agent_actions":{"view_html":"https://pith.science/pith/3J4M7F3UQW556XQEM4JP4OMDT7","download_json":"https://pith.science/pith/3J4M7F3UQW556XQEM4JP4OMDT7.json","view_paper":"https://pith.science/paper/3J4M7F3U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.06882&json=true","fetch_graph":"https://pith.science/api/pith-number/3J4M7F3UQW556XQEM4JP4OMDT7/graph.json","fetch_events":"https://pith.science/api/pith-number/3J4M7F3UQW556XQEM4JP4OMDT7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3J4M7F3UQW556XQEM4JP4OMDT7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3J4M7F3UQW556XQEM4JP4OMDT7/action/storage_attestation","attest_author":"https://pith.science/pith/3J4M7F3UQW556XQEM4JP4OMDT7/action/author_attestation","sign_citation":"https://pith.science/pith/3J4M7F3UQW556XQEM4JP4OMDT7/action/citation_signature","submit_replication":"https://pith.science/pith/3J4M7F3UQW556XQEM4JP4OMDT7/action/replication_record"}},"created_at":"2026-07-05T03:17:43.020796+00:00","updated_at":"2026-07-05T03:17:43.020796+00:00"}