{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:RPE5JM6PGEM3SC6RZUTLCKO5AL","short_pith_number":"pith:RPE5JM6P","schema_version":"1.0","canonical_sha256":"8bc9d4b3cf3119b90bd1cd26b129dd02eda07b2981b9d6256d82e5eec71f025c","source":{"kind":"arxiv","id":"1907.11329","version":4},"attestation_state":"computed","paper":{"title":"On the Round Complexity of Randomized Byzantine Agreement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.CR","authors_text":"Alex Samorodnitsky, Iftach Haitner, Matan Orland, Nikolaos Makriyannis, Ran Cohen","submitted_at":"2019-07-25T22:49:43Z","abstract_excerpt":"We prove lower bounds on the round complexity of randomized Byzantine agreement (BA) protocols, bounding the halting probability of such protocols after one and two rounds. In particular, we prove that:\n  (1) BA protocols resilient against $n/3$ [resp., $n/4$] corruptions terminate (under attack) at the end of the first round with probability at most $o(1)$ [resp., $1/2+ o(1)$].\n  (2) BA protocols resilient against a fraction of corruptions greater than $1/4$ terminate at the end of the second round with probability at most $1-\\Theta(1)$.\n  (3) For a large class of protocols (including all BA "},"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":"1907.11329","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-07-25T22:49:43Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"9c7e364f21e7b330f8e8b28c65b0bca9410c437a83a7c4817a037b7ff318c98e","abstract_canon_sha256":"38be14536c701d8a1f0e1103fdce57ee30e3030e160a503a328cd64af0498cd9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:22:51.557493Z","signature_b64":"UaNIDWd3ZwsvtRE2FbAHF8c+ZQ03Ty2QduyZROwVBnxzmQLL3JHk8xsmrGs0PqVvqJ0dR+1J51rAomY0+h9oCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8bc9d4b3cf3119b90bd1cd26b129dd02eda07b2981b9d6256d82e5eec71f025c","last_reissued_at":"2026-07-05T06:22:51.557077Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:22:51.557077Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Round Complexity of Randomized Byzantine Agreement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.CR","authors_text":"Alex Samorodnitsky, Iftach Haitner, Matan Orland, Nikolaos Makriyannis, Ran Cohen","submitted_at":"2019-07-25T22:49:43Z","abstract_excerpt":"We prove lower bounds on the round complexity of randomized Byzantine agreement (BA) protocols, bounding the halting probability of such protocols after one and two rounds. In particular, we prove that:\n  (1) BA protocols resilient against $n/3$ [resp., $n/4$] corruptions terminate (under attack) at the end of the first round with probability at most $o(1)$ [resp., $1/2+ o(1)$].\n  (2) BA protocols resilient against a fraction of corruptions greater than $1/4$ terminate at the end of the second round with probability at most $1-\\Theta(1)$.\n  (3) For a large class of protocols (including all BA "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.11329","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/1907.11329/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":"1907.11329","created_at":"2026-07-05T06:22:51.557132+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.11329v4","created_at":"2026-07-05T06:22:51.557132+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.11329","created_at":"2026-07-05T06:22:51.557132+00:00"},{"alias_kind":"pith_short_12","alias_value":"RPE5JM6PGEM3","created_at":"2026-07-05T06:22:51.557132+00:00"},{"alias_kind":"pith_short_16","alias_value":"RPE5JM6PGEM3SC6R","created_at":"2026-07-05T06:22:51.557132+00:00"},{"alias_kind":"pith_short_8","alias_value":"RPE5JM6P","created_at":"2026-07-05T06:22:51.557132+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/RPE5JM6PGEM3SC6RZUTLCKO5AL","json":"https://pith.science/pith/RPE5JM6PGEM3SC6RZUTLCKO5AL.json","graph_json":"https://pith.science/api/pith-number/RPE5JM6PGEM3SC6RZUTLCKO5AL/graph.json","events_json":"https://pith.science/api/pith-number/RPE5JM6PGEM3SC6RZUTLCKO5AL/events.json","paper":"https://pith.science/paper/RPE5JM6P"},"agent_actions":{"view_html":"https://pith.science/pith/RPE5JM6PGEM3SC6RZUTLCKO5AL","download_json":"https://pith.science/pith/RPE5JM6PGEM3SC6RZUTLCKO5AL.json","view_paper":"https://pith.science/paper/RPE5JM6P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.11329&json=true","fetch_graph":"https://pith.science/api/pith-number/RPE5JM6PGEM3SC6RZUTLCKO5AL/graph.json","fetch_events":"https://pith.science/api/pith-number/RPE5JM6PGEM3SC6RZUTLCKO5AL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RPE5JM6PGEM3SC6RZUTLCKO5AL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RPE5JM6PGEM3SC6RZUTLCKO5AL/action/storage_attestation","attest_author":"https://pith.science/pith/RPE5JM6PGEM3SC6RZUTLCKO5AL/action/author_attestation","sign_citation":"https://pith.science/pith/RPE5JM6PGEM3SC6RZUTLCKO5AL/action/citation_signature","submit_replication":"https://pith.science/pith/RPE5JM6PGEM3SC6RZUTLCKO5AL/action/replication_record"}},"created_at":"2026-07-05T06:22:51.557132+00:00","updated_at":"2026-07-05T06:22:51.557132+00:00"}