{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:LQSYYX4SAXUH33CYNBZ3SAFUVD","short_pith_number":"pith:LQSYYX4S","canonical_record":{"source":{"id":"2605.10372","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2026-05-11T11:14:04Z","cross_cats_sorted":[],"title_canon_sha256":"7e7ed55fda00251e1b0bbad285625285b09467ab09f5d62a4ed72d9831fab98a","abstract_canon_sha256":"9b82b92ef57bf296defdc83975dc9115f1d452096122fd91f0dc53594ddd66d6"},"schema_version":"1.0"},"canonical_sha256":"5c258c5f9205e87dec586873b900b4a8c4949b62c2582a4764186247dcafd8af","source":{"kind":"arxiv","id":"2605.10372","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.10372","created_at":"2026-06-01T02:03:43Z"},{"alias_kind":"arxiv_version","alias_value":"2605.10372v3","created_at":"2026-06-01T02:03:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.10372","created_at":"2026-06-01T02:03:43Z"},{"alias_kind":"pith_short_12","alias_value":"LQSYYX4SAXUH","created_at":"2026-06-01T02:03:43Z"},{"alias_kind":"pith_short_16","alias_value":"LQSYYX4SAXUH33CY","created_at":"2026-06-01T02:03:43Z"},{"alias_kind":"pith_short_8","alias_value":"LQSYYX4S","created_at":"2026-06-01T02:03:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:LQSYYX4SAXUH33CYNBZ3SAFUVD","target":"record","payload":{"canonical_record":{"source":{"id":"2605.10372","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2026-05-11T11:14:04Z","cross_cats_sorted":[],"title_canon_sha256":"7e7ed55fda00251e1b0bbad285625285b09467ab09f5d62a4ed72d9831fab98a","abstract_canon_sha256":"9b82b92ef57bf296defdc83975dc9115f1d452096122fd91f0dc53594ddd66d6"},"schema_version":"1.0"},"canonical_sha256":"5c258c5f9205e87dec586873b900b4a8c4949b62c2582a4764186247dcafd8af","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-01T02:03:43.210580Z","signature_b64":"iHbQ9Zhi2b6C0M19ulJ5l1QflLoiTwndY74EBm+kPnLRLk8bMtbbqc0n4EkFCnTRyIJ+doQLgy7yjMCnE2K2CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c258c5f9205e87dec586873b900b4a8c4949b62c2582a4764186247dcafd8af","last_reissued_at":"2026-06-01T02:03:43.209374Z","signature_status":"signed_v1","first_computed_at":"2026-06-01T02:03:43.209374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.10372","source_version":3,"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-06-01T02:03:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sIRgJuvBUq+2v1pLSbhh66O7qrKHfdcZI7bDpI+XljaY1qk7DWHzzvi3+Ecl7ZGHHycp1xVV+0BBW5EE6c74AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T02:40:50.831250Z"},"content_sha256":"00f43f43c6e4fa5ac52d11c6800df3fd3f67b516dd03dc33ee77c35036b569ae","schema_version":"1.0","event_id":"sha256:00f43f43c6e4fa5ac52d11c6800df3fd3f67b516dd03dc33ee77c35036b569ae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:LQSYYX4SAXUH33CYNBZ3SAFUVD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Amortized Asynchronous Byzantine Reliable Broadcast with Optimal Resilience","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Amortized multi-shot protocol achieves asymptotically optimal O(n|m|) communication for asynchronous Byzantine reliable broadcast while preserving f < n/3 resilience.","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alvin Hong Yao Yan, Jialin Li, Michael Yiqing Hu","submitted_at":"2026-05-11T11:14:04Z","abstract_excerpt":"Byzantine Reliable Broadcast (BRB) is a fundamental primitive in distributed computing and cryptographic systems; reducing the communication cost of BRB thus remains an important research direction. However, most existing works either focus strictly on the synchronous network model or utilize computationally impractical erasure codes. Therefore, to achieve a practical yet network-robust algorithm, one must turn toward committee sampling techniques. However, Committee sampling techniques often forgo optimal resilience ($f < \\lfloor\\frac{n}{3} \\rfloor$) in the face of asynchrony.\n  This work pro"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"This amortization strategy achieves asymptotic optimal O(n|m|) message complexity when messages are sufficiently large, with Ω(n) round complexity in the worst case. Under favorable conditions, an optimistic delivery path reduces the round complexity to Ω(1).","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The protocol relies on the standard asynchronous message-passing model with n nodes and at most f < n/3 Byzantine faults, plus the assumption that messages are large enough for amortization benefits to dominate.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"An amortized asynchronous BRB protocol maintains optimal f=n/3 resilience while achieving O(n|m|) message complexity for large messages via incremental round guarantees.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Amortized multi-shot protocol achieves asymptotically optimal O(n|m|) communication for asynchronous Byzantine reliable broadcast while preserving f < n/3 resilience.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"73f112fea028309e1f6361649d2c53254ba5ec9371b64d015f03cf51f7c3949b"},"source":{"id":"2605.10372","kind":"arxiv","version":3},"verdict":{"id":"19ade24b-c603-42bd-b98a-fd50fb856842","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-13T07:21:19.621226Z","strongest_claim":"This amortization strategy achieves asymptotic optimal O(n|m|) message complexity when messages are sufficiently large, with Ω(n) round complexity in the worst case. Under favorable conditions, an optimistic delivery path reduces the round complexity to Ω(1).","one_line_summary":"An amortized asynchronous BRB protocol maintains optimal f=n/3 resilience while achieving O(n|m|) message complexity for large messages via incremental round guarantees.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The protocol relies on the standard asynchronous message-passing model with n nodes and at most f < n/3 Byzantine faults, plus the assumption that messages are large enough for amortization benefits to dominate.","pith_extraction_headline":"Amortized multi-shot protocol achieves asymptotically optimal O(n|m|) communication for asynchronous Byzantine reliable broadcast while preserving f < n/3 resilience."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.10372/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"claim_evidence","ran_at":"2026-05-20T06:02:01.089343Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T15:34:43.030481Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-19T11:31:18.439802Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T09:24:25.702660Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"441cc577e2ac9cb310c511623394bda83e0c148364490ae04fc39f6c7d9d6fe1"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":1,"snapshot_sha256":"e5f35ef0fd902d3266417af41b5fd8d621b4ee5193102c2d52d1579fd8229993"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"19ade24b-c603-42bd-b98a-fd50fb856842"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-01T02:03:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GAPmbYVaqG8xWtQTFY1JCxZC3Sv0Mxi1amozRGtXLli4WB2b3dgu9fOjo4DNmbcUzEoGf9qRwS3q72CvzSrLDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T02:40:50.832414Z"},"content_sha256":"99b3b41158a586f0ba0a86b5ab3c5ad62adb0eeaa08ff0a993dd31f2556eb1b2","schema_version":"1.0","event_id":"sha256:99b3b41158a586f0ba0a86b5ab3c5ad62adb0eeaa08ff0a993dd31f2556eb1b2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LQSYYX4SAXUH33CYNBZ3SAFUVD/bundle.json","state_url":"https://pith.science/pith/LQSYYX4SAXUH33CYNBZ3SAFUVD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LQSYYX4SAXUH33CYNBZ3SAFUVD/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-06-11T02:40:50Z","links":{"resolver":"https://pith.science/pith/LQSYYX4SAXUH33CYNBZ3SAFUVD","bundle":"https://pith.science/pith/LQSYYX4SAXUH33CYNBZ3SAFUVD/bundle.json","state":"https://pith.science/pith/LQSYYX4SAXUH33CYNBZ3SAFUVD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LQSYYX4SAXUH33CYNBZ3SAFUVD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:LQSYYX4SAXUH33CYNBZ3SAFUVD","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":"9b82b92ef57bf296defdc83975dc9115f1d452096122fd91f0dc53594ddd66d6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2026-05-11T11:14:04Z","title_canon_sha256":"7e7ed55fda00251e1b0bbad285625285b09467ab09f5d62a4ed72d9831fab98a"},"schema_version":"1.0","source":{"id":"2605.10372","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.10372","created_at":"2026-06-01T02:03:43Z"},{"alias_kind":"arxiv_version","alias_value":"2605.10372v3","created_at":"2026-06-01T02:03:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.10372","created_at":"2026-06-01T02:03:43Z"},{"alias_kind":"pith_short_12","alias_value":"LQSYYX4SAXUH","created_at":"2026-06-01T02:03:43Z"},{"alias_kind":"pith_short_16","alias_value":"LQSYYX4SAXUH33CY","created_at":"2026-06-01T02:03:43Z"},{"alias_kind":"pith_short_8","alias_value":"LQSYYX4S","created_at":"2026-06-01T02:03:43Z"}],"graph_snapshots":[{"event_id":"sha256:99b3b41158a586f0ba0a86b5ab3c5ad62adb0eeaa08ff0a993dd31f2556eb1b2","target":"graph","created_at":"2026-06-01T02:03: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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"This amortization strategy achieves asymptotic optimal O(n|m|) message complexity when messages are sufficiently large, with Ω(n) round complexity in the worst case. Under favorable conditions, an optimistic delivery path reduces the round complexity to Ω(1)."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The protocol relies on the standard asynchronous message-passing model with n nodes and at most f < n/3 Byzantine faults, plus the assumption that messages are large enough for amortization benefits to dominate."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"An amortized asynchronous BRB protocol maintains optimal f=n/3 resilience while achieving O(n|m|) message complexity for large messages via incremental round guarantees."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Amortized multi-shot protocol achieves asymptotically optimal O(n|m|) communication for asynchronous Byzantine reliable broadcast while preserving f < n/3 resilience."}],"snapshot_sha256":"73f112fea028309e1f6361649d2c53254ba5ec9371b64d015f03cf51f7c3949b"},"formal_canon":{"evidence_count":1,"snapshot_sha256":"e5f35ef0fd902d3266417af41b5fd8d621b4ee5193102c2d52d1579fd8229993"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-20T06:02:01.089343Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T15:34:43.030481Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T11:31:18.439802Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T09:24:25.702660Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.10372/integrity.json","findings":[],"snapshot_sha256":"441cc577e2ac9cb310c511623394bda83e0c148364490ae04fc39f6c7d9d6fe1","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Byzantine Reliable Broadcast (BRB) is a fundamental primitive in distributed computing and cryptographic systems; reducing the communication cost of BRB thus remains an important research direction. However, most existing works either focus strictly on the synchronous network model or utilize computationally impractical erasure codes. Therefore, to achieve a practical yet network-robust algorithm, one must turn toward committee sampling techniques. However, Committee sampling techniques often forgo optimal resilience ($f < \\lfloor\\frac{n}{3} \\rfloor$) in the face of asynchrony.\n  This work pro","authors_text":"Alvin Hong Yao Yan, Jialin Li, Michael Yiqing Hu","cross_cats":[],"headline":"Amortized multi-shot protocol achieves asymptotically optimal O(n|m|) communication for asynchronous Byzantine reliable broadcast while preserving f < n/3 resilience.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2026-05-11T11:14:04Z","title":"Amortized Asynchronous Byzantine Reliable Broadcast with Optimal Resilience"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.10372","kind":"arxiv","version":3},"verdict":{"created_at":"2026-05-13T07:21:19.621226Z","id":"19ade24b-c603-42bd-b98a-fd50fb856842","model_set":{"reader":"grok-4.3"},"one_line_summary":"An amortized asynchronous BRB protocol maintains optimal f=n/3 resilience while achieving O(n|m|) message complexity for large messages via incremental round guarantees.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Amortized multi-shot protocol achieves asymptotically optimal O(n|m|) communication for asynchronous Byzantine reliable broadcast while preserving f < n/3 resilience.","strongest_claim":"This amortization strategy achieves asymptotic optimal O(n|m|) message complexity when messages are sufficiently large, with Ω(n) round complexity in the worst case. Under favorable conditions, an optimistic delivery path reduces the round complexity to Ω(1).","weakest_assumption":"The protocol relies on the standard asynchronous message-passing model with n nodes and at most f < n/3 Byzantine faults, plus the assumption that messages are large enough for amortization benefits to dominate."}},"verdict_id":"19ade24b-c603-42bd-b98a-fd50fb856842"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:00f43f43c6e4fa5ac52d11c6800df3fd3f67b516dd03dc33ee77c35036b569ae","target":"record","created_at":"2026-06-01T02:03: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":"9b82b92ef57bf296defdc83975dc9115f1d452096122fd91f0dc53594ddd66d6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2026-05-11T11:14:04Z","title_canon_sha256":"7e7ed55fda00251e1b0bbad285625285b09467ab09f5d62a4ed72d9831fab98a"},"schema_version":"1.0","source":{"id":"2605.10372","kind":"arxiv","version":3}},"canonical_sha256":"5c258c5f9205e87dec586873b900b4a8c4949b62c2582a4764186247dcafd8af","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5c258c5f9205e87dec586873b900b4a8c4949b62c2582a4764186247dcafd8af","first_computed_at":"2026-06-01T02:03:43.209374Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-01T02:03:43.209374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iHbQ9Zhi2b6C0M19ulJ5l1QflLoiTwndY74EBm+kPnLRLk8bMtbbqc0n4EkFCnTRyIJ+doQLgy7yjMCnE2K2CA==","signature_status":"signed_v1","signed_at":"2026-06-01T02:03:43.210580Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.10372","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:00f43f43c6e4fa5ac52d11c6800df3fd3f67b516dd03dc33ee77c35036b569ae","sha256:99b3b41158a586f0ba0a86b5ab3c5ad62adb0eeaa08ff0a993dd31f2556eb1b2"],"state_sha256":"4e30248b9656da69ab6b0e69d196af2f4018699a0ed76cb228fd371ff038cdef"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E8Wfn/ZbvEJHY//RonTsVpuz7HpaxjkjiXe7ck7ueNR2EOsGjpMMtySi7uljkTrStFArbudFwls2AvDwaEaiDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T02:40:50.839042Z","bundle_sha256":"4776597cc1eef35b693daef8b82dab8b71f556221e260d1e35e10c7b95505a73"}}