{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:D2545DMCWLT36GSVB2F2GBP3QJ","short_pith_number":"pith:D2545DMC","schema_version":"1.0","canonical_sha256":"1ebbce8d82b2e7bf1a550e8ba305fb825525655d1af04ef9c0e50edc519a1be5","source":{"kind":"arxiv","id":"1007.1049","version":3},"attestation_state":"computed","paper":{"title":"Simple Gradecast Based Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Danny Dolev, Ezra N. Hoch, Michael Ben-Or","submitted_at":"2010-07-07T04:50:43Z","abstract_excerpt":"Gradecast is a simple three-round algorithm presented by Feldman and Micali. The current work presents a very simple algorithm that utilized Gradecast to achieve Byzantine agreement. Two small variations of the presented algorithm lead to improved algorithms for solving the Approximate agreement problem and the Multi-consensus problem.\n  An optimal approximate agreement algorithm was presented by Fekete, which supports up to 1/4 n Byzantine nodes and has message complexity of O(n^k), where n is the number of nodes and k is the number of rounds.\n  Our solution to the approximate agreement probl"},"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":"1007.1049","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-07-07T04:50:43Z","cross_cats_sorted":[],"title_canon_sha256":"5cea784a380c10f7b9763f3ea5874f4c12af291bc0e4472cc771a518b8988e5f","abstract_canon_sha256":"c04d3badc7a18abf25f404e04f0bd9cad9ac8987722ce5bdcab5640d07a89a4a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:40:09.310249Z","signature_b64":"tdniCNWGcBvjWfJmiLJ4CliqyD1lN/jGY9H+FSwU2cH/7Jh1IiMSnHEE8MkbH6F2yC/7MK6LcWekIzEEChO5AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ebbce8d82b2e7bf1a550e8ba305fb825525655d1af04ef9c0e50edc519a1be5","last_reissued_at":"2026-05-18T04:40:09.309772Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:40:09.309772Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simple Gradecast Based Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Danny Dolev, Ezra N. Hoch, Michael Ben-Or","submitted_at":"2010-07-07T04:50:43Z","abstract_excerpt":"Gradecast is a simple three-round algorithm presented by Feldman and Micali. The current work presents a very simple algorithm that utilized Gradecast to achieve Byzantine agreement. Two small variations of the presented algorithm lead to improved algorithms for solving the Approximate agreement problem and the Multi-consensus problem.\n  An optimal approximate agreement algorithm was presented by Fekete, which supports up to 1/4 n Byzantine nodes and has message complexity of O(n^k), where n is the number of nodes and k is the number of rounds.\n  Our solution to the approximate agreement probl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.1049","kind":"arxiv","version":3},"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":"1007.1049","created_at":"2026-05-18T04:40:09.309839+00:00"},{"alias_kind":"arxiv_version","alias_value":"1007.1049v3","created_at":"2026-05-18T04:40:09.309839+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.1049","created_at":"2026-05-18T04:40:09.309839+00:00"},{"alias_kind":"pith_short_12","alias_value":"D2545DMCWLT3","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_16","alias_value":"D2545DMCWLT36GSV","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_8","alias_value":"D2545DMC","created_at":"2026-05-18T12:26:06.534383+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.05591","citing_title":"Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/D2545DMCWLT36GSVB2F2GBP3QJ","json":"https://pith.science/pith/D2545DMCWLT36GSVB2F2GBP3QJ.json","graph_json":"https://pith.science/api/pith-number/D2545DMCWLT36GSVB2F2GBP3QJ/graph.json","events_json":"https://pith.science/api/pith-number/D2545DMCWLT36GSVB2F2GBP3QJ/events.json","paper":"https://pith.science/paper/D2545DMC"},"agent_actions":{"view_html":"https://pith.science/pith/D2545DMCWLT36GSVB2F2GBP3QJ","download_json":"https://pith.science/pith/D2545DMCWLT36GSVB2F2GBP3QJ.json","view_paper":"https://pith.science/paper/D2545DMC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1007.1049&json=true","fetch_graph":"https://pith.science/api/pith-number/D2545DMCWLT36GSVB2F2GBP3QJ/graph.json","fetch_events":"https://pith.science/api/pith-number/D2545DMCWLT36GSVB2F2GBP3QJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D2545DMCWLT36GSVB2F2GBP3QJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D2545DMCWLT36GSVB2F2GBP3QJ/action/storage_attestation","attest_author":"https://pith.science/pith/D2545DMCWLT36GSVB2F2GBP3QJ/action/author_attestation","sign_citation":"https://pith.science/pith/D2545DMCWLT36GSVB2F2GBP3QJ/action/citation_signature","submit_replication":"https://pith.science/pith/D2545DMCWLT36GSVB2F2GBP3QJ/action/replication_record"}},"created_at":"2026-05-18T04:40:09.309839+00:00","updated_at":"2026-05-18T04:40:09.309839+00:00"}