{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:5FUJWLEA6HGYNTLB6UGR5AFHRW","short_pith_number":"pith:5FUJWLEA","canonical_record":{"source":{"id":"1811.01332","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-11-04T07:44:50Z","cross_cats_sorted":[],"title_canon_sha256":"f6aba7a270aaccd4e6194231738efd1cd1d34940472e489517f918d250a2ee83","abstract_canon_sha256":"51907eae3cc3db6283d4a9d8ce7bdd1caa8dc71a541fc68064c64d2ee8d275ea"},"schema_version":"1.0"},"canonical_sha256":"e9689b2c80f1cd86cd61f50d1e80a78da7c6097e522e2c332febbe16174254ed","source":{"kind":"arxiv","id":"1811.01332","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.01332","created_at":"2026-05-18T00:01:34Z"},{"alias_kind":"arxiv_version","alias_value":"1811.01332v1","created_at":"2026-05-18T00:01:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01332","created_at":"2026-05-18T00:01:34Z"},{"alias_kind":"pith_short_12","alias_value":"5FUJWLEA6HGY","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5FUJWLEA6HGYNTLB","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5FUJWLEA","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:5FUJWLEA6HGYNTLB6UGR5AFHRW","target":"record","payload":{"canonical_record":{"source":{"id":"1811.01332","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-11-04T07:44:50Z","cross_cats_sorted":[],"title_canon_sha256":"f6aba7a270aaccd4e6194231738efd1cd1d34940472e489517f918d250a2ee83","abstract_canon_sha256":"51907eae3cc3db6283d4a9d8ce7bdd1caa8dc71a541fc68064c64d2ee8d275ea"},"schema_version":"1.0"},"canonical_sha256":"e9689b2c80f1cd86cd61f50d1e80a78da7c6097e522e2c332febbe16174254ed","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:34.609786Z","signature_b64":"y3de/AuMDAkVRzUP21DfLI9txkZcdKOfiWqRGFGppO3PGh9UabWoBhXcWD7dpxE8NRd6cDF6UtAWEo+lksljBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9689b2c80f1cd86cd61f50d1e80a78da7c6097e522e2c332febbe16174254ed","last_reissued_at":"2026-05-18T00:01:34.609243Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:34.609243Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.01332","source_version":1,"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-18T00:01:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GhbkQpix5EkxAvL+y/WPhFUIzeUK1tlCLVZVizjk6BR9IccDR2tpz4qTb9PQ6Vg9US3QVmdmRontO37B5tkLCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T17:37:42.920519Z"},"content_sha256":"613fb48d41003b1ed04d1a0ad82ec932d37c23af18cb28d2e4af45109e086987","schema_version":"1.0","event_id":"sha256:613fb48d41003b1ed04d1a0ad82ec932d37c23af18cb28d2e4af45109e086987"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:5FUJWLEA6HGYNTLB6UGR5AFHRW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Validated Asynchronous Byzantine Agreement with Optimal Resilience and Asymptotically Optimal Time and Word Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alexander Spiegelman, Dahlia Malkhi, Ittai Abraham","submitted_at":"2018-11-04T07:44:50Z","abstract_excerpt":"We provide a new protocol for Validated Asynchronous Byzantine Agreement. Validated (multi-valued) Asynchronous Byzantine Agreement is a key building block in constructing Atomic Broadcast and fault-tolerant state machine replication in the asynchronous setting. Our protocol can withstand the optimal number $f<n/3$ of Byzantine failures and reaches agreement in the asymptotically optimal expected $O(1)$ running time. Honest parties in our protocol send only an expected $O(n^2)$ messages where each message contains a value and a constant number of signatures. Hence our total expected communicat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.01332","kind":"arxiv","version":1},"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-18T00:01:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"21OY/JclscytLxGOskktmYe5gpR3cJEAXGEYXTzRpianTjYxVG9I2K/LXWu3UjF6ziFUFyquG3dansDAT7m3DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T17:37:42.921146Z"},"content_sha256":"114bf224661467aadc017f5c0a2ee44e82a960a8ed6ef65e5f958b991dcfbdec","schema_version":"1.0","event_id":"sha256:114bf224661467aadc017f5c0a2ee44e82a960a8ed6ef65e5f958b991dcfbdec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5FUJWLEA6HGYNTLB6UGR5AFHRW/bundle.json","state_url":"https://pith.science/pith/5FUJWLEA6HGYNTLB6UGR5AFHRW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5FUJWLEA6HGYNTLB6UGR5AFHRW/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-28T17:37:42Z","links":{"resolver":"https://pith.science/pith/5FUJWLEA6HGYNTLB6UGR5AFHRW","bundle":"https://pith.science/pith/5FUJWLEA6HGYNTLB6UGR5AFHRW/bundle.json","state":"https://pith.science/pith/5FUJWLEA6HGYNTLB6UGR5AFHRW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5FUJWLEA6HGYNTLB6UGR5AFHRW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:5FUJWLEA6HGYNTLB6UGR5AFHRW","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":"51907eae3cc3db6283d4a9d8ce7bdd1caa8dc71a541fc68064c64d2ee8d275ea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-11-04T07:44:50Z","title_canon_sha256":"f6aba7a270aaccd4e6194231738efd1cd1d34940472e489517f918d250a2ee83"},"schema_version":"1.0","source":{"id":"1811.01332","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.01332","created_at":"2026-05-18T00:01:34Z"},{"alias_kind":"arxiv_version","alias_value":"1811.01332v1","created_at":"2026-05-18T00:01:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01332","created_at":"2026-05-18T00:01:34Z"},{"alias_kind":"pith_short_12","alias_value":"5FUJWLEA6HGY","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5FUJWLEA6HGYNTLB","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5FUJWLEA","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:114bf224661467aadc017f5c0a2ee44e82a960a8ed6ef65e5f958b991dcfbdec","target":"graph","created_at":"2026-05-18T00:01:34Z","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":"We provide a new protocol for Validated Asynchronous Byzantine Agreement. Validated (multi-valued) Asynchronous Byzantine Agreement is a key building block in constructing Atomic Broadcast and fault-tolerant state machine replication in the asynchronous setting. Our protocol can withstand the optimal number $f<n/3$ of Byzantine failures and reaches agreement in the asymptotically optimal expected $O(1)$ running time. Honest parties in our protocol send only an expected $O(n^2)$ messages where each message contains a value and a constant number of signatures. Hence our total expected communicat","authors_text":"Alexander Spiegelman, Dahlia Malkhi, Ittai Abraham","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-11-04T07:44:50Z","title":"Validated Asynchronous Byzantine Agreement with Optimal Resilience and Asymptotically Optimal Time and Word Communication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.01332","kind":"arxiv","version":1},"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:613fb48d41003b1ed04d1a0ad82ec932d37c23af18cb28d2e4af45109e086987","target":"record","created_at":"2026-05-18T00:01:34Z","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":"51907eae3cc3db6283d4a9d8ce7bdd1caa8dc71a541fc68064c64d2ee8d275ea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-11-04T07:44:50Z","title_canon_sha256":"f6aba7a270aaccd4e6194231738efd1cd1d34940472e489517f918d250a2ee83"},"schema_version":"1.0","source":{"id":"1811.01332","kind":"arxiv","version":1}},"canonical_sha256":"e9689b2c80f1cd86cd61f50d1e80a78da7c6097e522e2c332febbe16174254ed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e9689b2c80f1cd86cd61f50d1e80a78da7c6097e522e2c332febbe16174254ed","first_computed_at":"2026-05-18T00:01:34.609243Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:34.609243Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"y3de/AuMDAkVRzUP21DfLI9txkZcdKOfiWqRGFGppO3PGh9UabWoBhXcWD7dpxE8NRd6cDF6UtAWEo+lksljBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:34.609786Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.01332","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:613fb48d41003b1ed04d1a0ad82ec932d37c23af18cb28d2e4af45109e086987","sha256:114bf224661467aadc017f5c0a2ee44e82a960a8ed6ef65e5f958b991dcfbdec"],"state_sha256":"5b2d05d35090696e0098c4b323e07e31fac70916235881f67f0ceddc2c60ca21"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eKv4Y2ADufCCACr1RcD20aNC+vsfu5oLFnBT+JoxHzrLWcGcu+pHCaEJ7lY2DcMZqS++fD+k/gA2Rza3xaSCBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T17:37:42.925032Z","bundle_sha256":"e18ac2b85640b659fdc227c852f6b8a8be2c203bf4b2e2eef72a2800fbe5aff4"}}