{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:EKMYUIXHR4WPDVISWKMLOPY45L","short_pith_number":"pith:EKMYUIXH","schema_version":"1.0","canonical_sha256":"22998a22e78f2cf1d512b298b73f1cead753c51f4162a814305d1411f45a68d9","source":{"kind":"arxiv","id":"2404.08070","version":2},"attestation_state":"computed","paper":{"title":"Byzantine Reliable Broadcast with Low Communication and Time Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Thomas Locher","submitted_at":"2024-04-11T18:16:25Z","abstract_excerpt":"Byzantine reliable broadcast is a fundamental problem in distributed computing, which has been studied extensively over the past decades. State-of-the-art algorithms are predominantly based on the approach to share encoded fragments of the broadcast message, yielding an asymptotically optimal communication complexity when the message size exceeds the network size, a condition frequently encountered in practice. However, algorithms following the standard coding approach incur an overhead factor of at least 3, which can already be a burden for bandwidth-constrained applications. Minimizing this "},"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":"2404.08070","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2024-04-11T18:16:25Z","cross_cats_sorted":[],"title_canon_sha256":"46b4476f356f1d51e61f46e9181f06cfe91ed290c0a38eeaf326f582e51c09cd","abstract_canon_sha256":"51cd9d3149b0be1f65e083800dc6c15c934cbd80cb69e72bdd89fbeefa5faa2c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:56:35.299149Z","signature_b64":"0D4D6KBXonuzEdv5qDtBP38zDQo3hs0JxPPrLRXurD+sUzcoX9xoYEXaEukyRyWTjHVPJ2gXsiq10FqHfmcaDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22998a22e78f2cf1d512b298b73f1cead753c51f4162a814305d1411f45a68d9","last_reissued_at":"2026-07-05T09:56:35.298667Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:56:35.298667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Byzantine Reliable Broadcast with Low Communication and Time Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Thomas Locher","submitted_at":"2024-04-11T18:16:25Z","abstract_excerpt":"Byzantine reliable broadcast is a fundamental problem in distributed computing, which has been studied extensively over the past decades. State-of-the-art algorithms are predominantly based on the approach to share encoded fragments of the broadcast message, yielding an asymptotically optimal communication complexity when the message size exceeds the network size, a condition frequently encountered in practice. However, algorithms following the standard coding approach incur an overhead factor of at least 3, which can already be a burden for bandwidth-constrained applications. Minimizing this "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.08070","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/2404.08070/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":"2404.08070","created_at":"2026-07-05T09:56:35.298725+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.08070v2","created_at":"2026-07-05T09:56:35.298725+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.08070","created_at":"2026-07-05T09:56:35.298725+00:00"},{"alias_kind":"pith_short_12","alias_value":"EKMYUIXHR4WP","created_at":"2026-07-05T09:56:35.298725+00:00"},{"alias_kind":"pith_short_16","alias_value":"EKMYUIXHR4WPDVIS","created_at":"2026-07-05T09:56:35.298725+00:00"},{"alias_kind":"pith_short_8","alias_value":"EKMYUIXH","created_at":"2026-07-05T09:56:35.298725+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.23246","citing_title":"How to Evaluate Participant Contributions in Decentralized Federated Learning","ref_index":40,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EKMYUIXHR4WPDVISWKMLOPY45L","json":"https://pith.science/pith/EKMYUIXHR4WPDVISWKMLOPY45L.json","graph_json":"https://pith.science/api/pith-number/EKMYUIXHR4WPDVISWKMLOPY45L/graph.json","events_json":"https://pith.science/api/pith-number/EKMYUIXHR4WPDVISWKMLOPY45L/events.json","paper":"https://pith.science/paper/EKMYUIXH"},"agent_actions":{"view_html":"https://pith.science/pith/EKMYUIXHR4WPDVISWKMLOPY45L","download_json":"https://pith.science/pith/EKMYUIXHR4WPDVISWKMLOPY45L.json","view_paper":"https://pith.science/paper/EKMYUIXH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.08070&json=true","fetch_graph":"https://pith.science/api/pith-number/EKMYUIXHR4WPDVISWKMLOPY45L/graph.json","fetch_events":"https://pith.science/api/pith-number/EKMYUIXHR4WPDVISWKMLOPY45L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EKMYUIXHR4WPDVISWKMLOPY45L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EKMYUIXHR4WPDVISWKMLOPY45L/action/storage_attestation","attest_author":"https://pith.science/pith/EKMYUIXHR4WPDVISWKMLOPY45L/action/author_attestation","sign_citation":"https://pith.science/pith/EKMYUIXHR4WPDVISWKMLOPY45L/action/citation_signature","submit_replication":"https://pith.science/pith/EKMYUIXHR4WPDVISWKMLOPY45L/action/replication_record"}},"created_at":"2026-07-05T09:56:35.298725+00:00","updated_at":"2026-07-05T09:56:35.298725+00:00"}