{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:3J4M7F3UQW556XQEM4JP4OMDT7","short_pith_number":"pith:3J4M7F3U","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"},"canonical_sha256":"da78cf977485bbdf5e046712fe39839fe71b2399b63b099b64e27d371672ba45","source":{"kind":"arxiv","id":"1510.06882","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.06882","created_at":"2026-07-05T03:17:43Z"},{"alias_kind":"arxiv_version","alias_value":"1510.06882v2","created_at":"2026-07-05T03:17:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.06882","created_at":"2026-07-05T03:17:43Z"},{"alias_kind":"pith_short_12","alias_value":"3J4M7F3UQW55","created_at":"2026-07-05T03:17:43Z"},{"alias_kind":"pith_short_16","alias_value":"3J4M7F3UQW556XQE","created_at":"2026-07-05T03:17:43Z"},{"alias_kind":"pith_short_8","alias_value":"3J4M7F3U","created_at":"2026-07-05T03:17:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:3J4M7F3UQW556XQEM4JP4OMDT7","target":"record","payload":{"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"},"canonical_sha256":"da78cf977485bbdf5e046712fe39839fe71b2399b63b099b64e27d371672ba45","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"},"source_kind":"arxiv","source_id":"1510.06882","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-05T03:17:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VTGzQIJcGWm+/j2F+UmWkejYsgvfW8/LetYdBmnhW+IJRmQLBVyC6EPeJm/CBCfRDY8N4Gu+cY2m5Zr+A9eLCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T06:05:02.873588Z"},"content_sha256":"b746c2f05c4212c3ed15c3957a243051a0a7eec49f1a26d9a9ccccd7683645a1","schema_version":"1.0","event_id":"sha256:b746c2f05c4212c3ed15c3957a243051a0a7eec49f1a26d9a9ccccd7683645a1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:3J4M7F3UQW556XQEM4JP4OMDT7","target":"graph","payload":{"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"},"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-05T03:17:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"diWhNYIyg8E9a8jH7MghIDFJ9lZO9rFhjS6oUJtK3VhqliscsUduoH2VzZaAr4KR0+TEY5DGIRxAXybCJfMDDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T06:05:02.874080Z"},"content_sha256":"5cb67778b4cba4816440f0d4626ad52ad2c5c1484044af1ffb8446c3e8674200","schema_version":"1.0","event_id":"sha256:5cb67778b4cba4816440f0d4626ad52ad2c5c1484044af1ffb8446c3e8674200"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3J4M7F3UQW556XQEM4JP4OMDT7/bundle.json","state_url":"https://pith.science/pith/3J4M7F3UQW556XQEM4JP4OMDT7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3J4M7F3UQW556XQEM4JP4OMDT7/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-22T06:05:02Z","links":{"resolver":"https://pith.science/pith/3J4M7F3UQW556XQEM4JP4OMDT7","bundle":"https://pith.science/pith/3J4M7F3UQW556XQEM4JP4OMDT7/bundle.json","state":"https://pith.science/pith/3J4M7F3UQW556XQEM4JP4OMDT7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3J4M7F3UQW556XQEM4JP4OMDT7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:3J4M7F3UQW556XQEM4JP4OMDT7","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":"898002a2edc4c0130237e5faad09518980088e8ec98b29e8b52348d52c922e83","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-10-23T10:29:19Z","title_canon_sha256":"ddbf82ee167d188a7598e003881978c7088fe386fddc362f87e75de2f167d442"},"schema_version":"1.0","source":{"id":"1510.06882","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.06882","created_at":"2026-07-05T03:17:43Z"},{"alias_kind":"arxiv_version","alias_value":"1510.06882v2","created_at":"2026-07-05T03:17:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.06882","created_at":"2026-07-05T03:17:43Z"},{"alias_kind":"pith_short_12","alias_value":"3J4M7F3UQW55","created_at":"2026-07-05T03:17:43Z"},{"alias_kind":"pith_short_16","alias_value":"3J4M7F3UQW556XQE","created_at":"2026-07-05T03:17:43Z"},{"alias_kind":"pith_short_8","alias_value":"3J4M7F3U","created_at":"2026-07-05T03:17:43Z"}],"graph_snapshots":[{"event_id":"sha256:5cb67778b4cba4816440f0d4626ad52ad2c5c1484044af1ffb8446c3e8674200","target":"graph","created_at":"2026-07-05T03:17:43Z","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/1510.06882/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Damien Imbs, Michel Raynal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-10-23T10:29:19Z","title":"Trading off $t$-Resilience for Efficiency in Asynchronous Byzantine Reliable Broadcast"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.06882","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:b746c2f05c4212c3ed15c3957a243051a0a7eec49f1a26d9a9ccccd7683645a1","target":"record","created_at":"2026-07-05T03:17:43Z","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":"898002a2edc4c0130237e5faad09518980088e8ec98b29e8b52348d52c922e83","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-10-23T10:29:19Z","title_canon_sha256":"ddbf82ee167d188a7598e003881978c7088fe386fddc362f87e75de2f167d442"},"schema_version":"1.0","source":{"id":"1510.06882","kind":"arxiv","version":2}},"canonical_sha256":"da78cf977485bbdf5e046712fe39839fe71b2399b63b099b64e27d371672ba45","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"da78cf977485bbdf5e046712fe39839fe71b2399b63b099b64e27d371672ba45","first_computed_at":"2026-07-05T03:17:43.020741Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:17:43.020741Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"X8AtTtFRms/5wL/13XkHekpDVm0rOVX9RGTdi/hlEYmBYDwgO12VzaMpth+ba8ROiFoeNckT+HgYBNt6pJfJDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T03:17:43.021159Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.06882","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b746c2f05c4212c3ed15c3957a243051a0a7eec49f1a26d9a9ccccd7683645a1","sha256:5cb67778b4cba4816440f0d4626ad52ad2c5c1484044af1ffb8446c3e8674200"],"state_sha256":"1fde1933c8301bcda49d0a37411804e62c75e16ce52f99340583d2168eb216d5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zm3uokgp8QK6z+4TtYjB7FJybLy7aY6spWJYV4cjkybR+Jfrhk7OqUbrkBJLNlIJUcI1dXxKMCzdHoXzzc9cAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T06:05:02.879096Z","bundle_sha256":"f3df4820faeaac76f157be4eeb8052e2091cc281b1cc8c38d53e6a9893797358"}}