{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:N4JV5QP4MF6BHNBHA3SKV7FWB7","short_pith_number":"pith:N4JV5QP4","schema_version":"1.0","canonical_sha256":"6f135ec1fc617c13b42706e4aafcb60fdac6070fc0fbef0e759ed314b2c0c7cc","source":{"kind":"arxiv","id":"1504.02547","version":2},"attestation_state":"computed","paper":{"title":"Byzantine Agreement with Optimal Early Stopping, Optimal Resilience and Polynomial Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Danny Dolev, Ittai Abraham","submitted_at":"2015-04-10T04:04:31Z","abstract_excerpt":"We provide the first protocol that solves Byzantine agreement with optimal early stopping ($\\min\\{f+2,t+1\\}$ rounds) and optimal resilience ($n>3t$) using polynomial message size and computation.\n  All previous approaches obtained sub-optimal results and used resolve rules that looked only at the immediate children in the EIG (\\emph{Exponential Information Gathering}) tree. At the heart of our solution are new resolve rules that look at multiple layers of the EIG tree."},"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":"1504.02547","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-04-10T04:04:31Z","cross_cats_sorted":[],"title_canon_sha256":"218e76ccc2d1763a78a0ffbea7a597180dde0919dca1f973287cfedbccffa68c","abstract_canon_sha256":"7aa35cbfe821b77df8ab2e068b284e56faf0a6701e07159c5d332a4621714c49"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:42.444646Z","signature_b64":"jaSOWj4g1Dsc8MFB4DgvlIndhORXzbDvt92lTLpVkeAt5TcQ6y5ZeW93fFak9oAG3+i4hsQ/4gcaCZg75tEWCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f135ec1fc617c13b42706e4aafcb60fdac6070fc0fbef0e759ed314b2c0c7cc","last_reissued_at":"2026-05-18T02:18:42.443981Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:42.443981Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Byzantine Agreement with Optimal Early Stopping, Optimal Resilience and Polynomial Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Danny Dolev, Ittai Abraham","submitted_at":"2015-04-10T04:04:31Z","abstract_excerpt":"We provide the first protocol that solves Byzantine agreement with optimal early stopping ($\\min\\{f+2,t+1\\}$ rounds) and optimal resilience ($n>3t$) using polynomial message size and computation.\n  All previous approaches obtained sub-optimal results and used resolve rules that looked only at the immediate children in the EIG (\\emph{Exponential Information Gathering}) tree. At the heart of our solution are new resolve rules that look at multiple layers of the EIG tree."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.02547","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":""},"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":"1504.02547","created_at":"2026-05-18T02:18:42.444075+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.02547v2","created_at":"2026-05-18T02:18:42.444075+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.02547","created_at":"2026-05-18T02:18:42.444075+00:00"},{"alias_kind":"pith_short_12","alias_value":"N4JV5QP4MF6B","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"N4JV5QP4MF6BHNBH","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"N4JV5QP4","created_at":"2026-05-18T12:29:32.376354+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/N4JV5QP4MF6BHNBHA3SKV7FWB7","json":"https://pith.science/pith/N4JV5QP4MF6BHNBHA3SKV7FWB7.json","graph_json":"https://pith.science/api/pith-number/N4JV5QP4MF6BHNBHA3SKV7FWB7/graph.json","events_json":"https://pith.science/api/pith-number/N4JV5QP4MF6BHNBHA3SKV7FWB7/events.json","paper":"https://pith.science/paper/N4JV5QP4"},"agent_actions":{"view_html":"https://pith.science/pith/N4JV5QP4MF6BHNBHA3SKV7FWB7","download_json":"https://pith.science/pith/N4JV5QP4MF6BHNBHA3SKV7FWB7.json","view_paper":"https://pith.science/paper/N4JV5QP4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.02547&json=true","fetch_graph":"https://pith.science/api/pith-number/N4JV5QP4MF6BHNBHA3SKV7FWB7/graph.json","fetch_events":"https://pith.science/api/pith-number/N4JV5QP4MF6BHNBHA3SKV7FWB7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N4JV5QP4MF6BHNBHA3SKV7FWB7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N4JV5QP4MF6BHNBHA3SKV7FWB7/action/storage_attestation","attest_author":"https://pith.science/pith/N4JV5QP4MF6BHNBHA3SKV7FWB7/action/author_attestation","sign_citation":"https://pith.science/pith/N4JV5QP4MF6BHNBHA3SKV7FWB7/action/citation_signature","submit_replication":"https://pith.science/pith/N4JV5QP4MF6BHNBHA3SKV7FWB7/action/replication_record"}},"created_at":"2026-05-18T02:18:42.444075+00:00","updated_at":"2026-05-18T02:18:42.444075+00:00"}