{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:D2545DMCWLT36GSVB2F2GBP3QJ","short_pith_number":"pith:D2545DMC","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"},"canonical_sha256":"1ebbce8d82b2e7bf1a550e8ba305fb825525655d1af04ef9c0e50edc519a1be5","source":{"kind":"arxiv","id":"1007.1049","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.1049","created_at":"2026-05-18T04:40:09Z"},{"alias_kind":"arxiv_version","alias_value":"1007.1049v3","created_at":"2026-05-18T04:40:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.1049","created_at":"2026-05-18T04:40:09Z"},{"alias_kind":"pith_short_12","alias_value":"D2545DMCWLT3","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"D2545DMCWLT36GSV","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"D2545DMC","created_at":"2026-05-18T12:26:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:D2545DMCWLT36GSVB2F2GBP3QJ","target":"record","payload":{"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"},"canonical_sha256":"1ebbce8d82b2e7bf1a550e8ba305fb825525655d1af04ef9c0e50edc519a1be5","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"},"source_kind":"arxiv","source_id":"1007.1049","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:40:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o+14svs2came8ozRhYqZuFBQSTf5i3J3du1QuKMf1YNRm5fWwxSRoAJ7vite1XUdNDVuiO89av80g890osvfAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T13:07:23.583978Z"},"content_sha256":"212dc4dc289d23cccf2ae197fdd012949927e96d7243e92ac5905327dd064496","schema_version":"1.0","event_id":"sha256:212dc4dc289d23cccf2ae197fdd012949927e96d7243e92ac5905327dd064496"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:D2545DMCWLT36GSVB2F2GBP3QJ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:40:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KCB1sjefL623CnXicz6K0VI/4h21sSe6//dhlDGrFwm1e3ueHLA5xIfN+jG0pGOfBh0ljwqNy9Cx3Tt+gnBCDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T13:07:23.584767Z"},"content_sha256":"c365f92c33121aeac57538e5d77bc033f024437dec5bc7070eab3b0f7ca50d7a","schema_version":"1.0","event_id":"sha256:c365f92c33121aeac57538e5d77bc033f024437dec5bc7070eab3b0f7ca50d7a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D2545DMCWLT36GSVB2F2GBP3QJ/bundle.json","state_url":"https://pith.science/pith/D2545DMCWLT36GSVB2F2GBP3QJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D2545DMCWLT36GSVB2F2GBP3QJ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-23T13:07:23Z","links":{"resolver":"https://pith.science/pith/D2545DMCWLT36GSVB2F2GBP3QJ","bundle":"https://pith.science/pith/D2545DMCWLT36GSVB2F2GBP3QJ/bundle.json","state":"https://pith.science/pith/D2545DMCWLT36GSVB2F2GBP3QJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D2545DMCWLT36GSVB2F2GBP3QJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:D2545DMCWLT36GSVB2F2GBP3QJ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c04d3badc7a18abf25f404e04f0bd9cad9ac8987722ce5bdcab5640d07a89a4a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-07-07T04:50:43Z","title_canon_sha256":"5cea784a380c10f7b9763f3ea5874f4c12af291bc0e4472cc771a518b8988e5f"},"schema_version":"1.0","source":{"id":"1007.1049","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.1049","created_at":"2026-05-18T04:40:09Z"},{"alias_kind":"arxiv_version","alias_value":"1007.1049v3","created_at":"2026-05-18T04:40:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.1049","created_at":"2026-05-18T04:40:09Z"},{"alias_kind":"pith_short_12","alias_value":"D2545DMCWLT3","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"D2545DMCWLT36GSV","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"D2545DMC","created_at":"2026-05-18T12:26:06Z"}],"graph_snapshots":[{"event_id":"sha256:c365f92c33121aeac57538e5d77bc033f024437dec5bc7070eab3b0f7ca50d7a","target":"graph","created_at":"2026-05-18T04:40:09Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Danny Dolev, Ezra N. Hoch, Michael Ben-Or","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-07-07T04:50:43Z","title":"Simple Gradecast Based Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.1049","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:212dc4dc289d23cccf2ae197fdd012949927e96d7243e92ac5905327dd064496","target":"record","created_at":"2026-05-18T04:40:09Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"c04d3badc7a18abf25f404e04f0bd9cad9ac8987722ce5bdcab5640d07a89a4a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-07-07T04:50:43Z","title_canon_sha256":"5cea784a380c10f7b9763f3ea5874f4c12af291bc0e4472cc771a518b8988e5f"},"schema_version":"1.0","source":{"id":"1007.1049","kind":"arxiv","version":3}},"canonical_sha256":"1ebbce8d82b2e7bf1a550e8ba305fb825525655d1af04ef9c0e50edc519a1be5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1ebbce8d82b2e7bf1a550e8ba305fb825525655d1af04ef9c0e50edc519a1be5","first_computed_at":"2026-05-18T04:40:09.309772Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:40:09.309772Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tdniCNWGcBvjWfJmiLJ4CliqyD1lN/jGY9H+FSwU2cH/7Jh1IiMSnHEE8MkbH6F2yC/7MK6LcWekIzEEChO5AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:40:09.310249Z","signed_message":"canonical_sha256_bytes"},"source_id":"1007.1049","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:212dc4dc289d23cccf2ae197fdd012949927e96d7243e92ac5905327dd064496","sha256:c365f92c33121aeac57538e5d77bc033f024437dec5bc7070eab3b0f7ca50d7a"],"state_sha256":"3677cc091a2dbcd85e73d6365ee9fd7cb29066cbff4865f526ab21ad2709969c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nepjz3shPMjpzFet+AQPI5OX80kr5YkClt5pmS2d7U1lYdmolbchqqj4hXjYYFWui2ML9/AQxUZ6ZuDOS19bDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T13:07:23.589027Z","bundle_sha256":"e0462c3f4b4deb6a6d5f6b5a2c43c07830e5d8c80cb7e37afef6e36755671d07"}}