{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:HD7G3AVAWO2ZMIYBOH3FWW4CS4","short_pith_number":"pith:HD7G3AVA","schema_version":"1.0","canonical_sha256":"38fe6d82a0b3b596230171f65b5b829736956567287c8d01b15bb15dc4a8b28b","source":{"kind":"arxiv","id":"2505.02761","version":4},"attestation_state":"computed","paper":{"title":"Optimistic, Signature-Free Reliable Broadcast and Its Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Aniket Kate, Giuliano Losa, Kartik Nayak, Nibesh Shrestha, Qianyu Yu, Xuechao Wang","submitted_at":"2025-05-05T16:13:30Z","abstract_excerpt":"Reliable broadcast (RBC) is a key primitive in fault-tolerant distributed systems, and improving its efficiency can benefit a wide range of applications. This work focuses on signature-free RBC protocols, which are particularly attractive due to their computational efficiency. Existing protocols in this setting incur an optimal 3 steps to reach a decision while tolerating up to $f < n/3$ Byzantine faults, where $n$ is the number of parties. In this work, we propose an optimistic RBC protocol that maintains the $f < n/3$ fault tolerance but achieves termination in just 2 steps under certain opt"},"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":"2505.02761","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2025-05-05T16:13:30Z","cross_cats_sorted":[],"title_canon_sha256":"805aa74e80e535f4288f42d4e6800923195d95eb7373e8ab82ca8873f0560ea8","abstract_canon_sha256":"ba1b93a8ed3fa8a1a4c566d612c118af3047d5db3cee0039772d7bd7e3da6a9d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T02:03:50.279104Z","signature_b64":"EENjMgYy5cMebjdQZsO8CxmxT97U/ll31pSjqZ4kb0GQFOLVX0YxUSy2SDTyQN6NsU4LUWSLHYXsahwRfwHnAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38fe6d82a0b3b596230171f65b5b829736956567287c8d01b15bb15dc4a8b28b","last_reissued_at":"2026-05-26T02:03:50.278108Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T02:03:50.278108Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimistic, Signature-Free Reliable Broadcast and Its Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Aniket Kate, Giuliano Losa, Kartik Nayak, Nibesh Shrestha, Qianyu Yu, Xuechao Wang","submitted_at":"2025-05-05T16:13:30Z","abstract_excerpt":"Reliable broadcast (RBC) is a key primitive in fault-tolerant distributed systems, and improving its efficiency can benefit a wide range of applications. This work focuses on signature-free RBC protocols, which are particularly attractive due to their computational efficiency. Existing protocols in this setting incur an optimal 3 steps to reach a decision while tolerating up to $f < n/3$ Byzantine faults, where $n$ is the number of parties. In this work, we propose an optimistic RBC protocol that maintains the $f < n/3$ fault tolerance but achieves termination in just 2 steps under certain opt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.02761","kind":"arxiv","version":4},"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/2505.02761/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":"2505.02761","created_at":"2026-05-26T02:03:50.278243+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.02761v4","created_at":"2026-05-26T02:03:50.278243+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.02761","created_at":"2026-05-26T02:03:50.278243+00:00"},{"alias_kind":"pith_short_12","alias_value":"HD7G3AVAWO2Z","created_at":"2026-05-26T02:03:50.278243+00:00"},{"alias_kind":"pith_short_16","alias_value":"HD7G3AVAWO2ZMIYB","created_at":"2026-05-26T02:03:50.278243+00:00"},{"alias_kind":"pith_short_8","alias_value":"HD7G3AVA","created_at":"2026-05-26T02:03:50.278243+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HD7G3AVAWO2ZMIYBOH3FWW4CS4","json":"https://pith.science/pith/HD7G3AVAWO2ZMIYBOH3FWW4CS4.json","graph_json":"https://pith.science/api/pith-number/HD7G3AVAWO2ZMIYBOH3FWW4CS4/graph.json","events_json":"https://pith.science/api/pith-number/HD7G3AVAWO2ZMIYBOH3FWW4CS4/events.json","paper":"https://pith.science/paper/HD7G3AVA"},"agent_actions":{"view_html":"https://pith.science/pith/HD7G3AVAWO2ZMIYBOH3FWW4CS4","download_json":"https://pith.science/pith/HD7G3AVAWO2ZMIYBOH3FWW4CS4.json","view_paper":"https://pith.science/paper/HD7G3AVA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.02761&json=true","fetch_graph":"https://pith.science/api/pith-number/HD7G3AVAWO2ZMIYBOH3FWW4CS4/graph.json","fetch_events":"https://pith.science/api/pith-number/HD7G3AVAWO2ZMIYBOH3FWW4CS4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HD7G3AVAWO2ZMIYBOH3FWW4CS4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HD7G3AVAWO2ZMIYBOH3FWW4CS4/action/storage_attestation","attest_author":"https://pith.science/pith/HD7G3AVAWO2ZMIYBOH3FWW4CS4/action/author_attestation","sign_citation":"https://pith.science/pith/HD7G3AVAWO2ZMIYBOH3FWW4CS4/action/citation_signature","submit_replication":"https://pith.science/pith/HD7G3AVAWO2ZMIYBOH3FWW4CS4/action/replication_record"}},"created_at":"2026-05-26T02:03:50.278243+00:00","updated_at":"2026-05-26T02:03:50.278243+00:00"}