{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:T7I6UKXNMCCECZIZ7KA3IEXZTU","short_pith_number":"pith:T7I6UKXN","canonical_record":{"source":{"id":"2202.09123","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2022-02-18T11:03:36Z","cross_cats_sorted":[],"title_canon_sha256":"c0f9006a4babd60fc44ceab63637ce7bba3cecd848d0906dbd681440863b4d64","abstract_canon_sha256":"bb2da4b639f32758182c1d10b035d3a9114941e1a6e25994d8a3f8485e3fb80c"},"schema_version":"1.0"},"canonical_sha256":"9fd1ea2aed6084416519fa81b412f99d3ae28f5177bb232df5b276d1a06756c1","source":{"kind":"arxiv","id":"2202.09123","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2202.09123","created_at":"2026-07-05T07:32:14Z"},{"alias_kind":"arxiv_version","alias_value":"2202.09123v2","created_at":"2026-07-05T07:32:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.09123","created_at":"2026-07-05T07:32:14Z"},{"alias_kind":"pith_short_12","alias_value":"T7I6UKXNMCCE","created_at":"2026-07-05T07:32:14Z"},{"alias_kind":"pith_short_16","alias_value":"T7I6UKXNMCCECZIZ","created_at":"2026-07-05T07:32:14Z"},{"alias_kind":"pith_short_8","alias_value":"T7I6UKXN","created_at":"2026-07-05T07:32:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:T7I6UKXNMCCECZIZ7KA3IEXZTU","target":"record","payload":{"canonical_record":{"source":{"id":"2202.09123","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2022-02-18T11:03:36Z","cross_cats_sorted":[],"title_canon_sha256":"c0f9006a4babd60fc44ceab63637ce7bba3cecd848d0906dbd681440863b4d64","abstract_canon_sha256":"bb2da4b639f32758182c1d10b035d3a9114941e1a6e25994d8a3f8485e3fb80c"},"schema_version":"1.0"},"canonical_sha256":"9fd1ea2aed6084416519fa81b412f99d3ae28f5177bb232df5b276d1a06756c1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:32:14.721517Z","signature_b64":"EsP2ZJInNodbD5BdKI/A+X0K1Xs39L9NUo/EU3mAI34HYE5PLcVzvhreai9reMgt9Po/CCKyWC/gIgoaLM5aAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9fd1ea2aed6084416519fa81b412f99d3ae28f5177bb232df5b276d1a06756c1","last_reissued_at":"2026-07-05T07:32:14.721039Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:32:14.721039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2202.09123","source_version":2,"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-07-05T07:32:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZS/ZcNeRzrobbvA0LfF9TSvGt+LoUAPQrf6A1kmn7OVCfGfJla3/DsAvhABAn4KoVftM9pRUbJZAHWMWwk4RDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T11:17:55.737018Z"},"content_sha256":"3b682fb5f382aeee0a97b91e659d352d38a3e0010322a904cf5c2b4fb8a5973b","schema_version":"1.0","event_id":"sha256:3b682fb5f382aeee0a97b91e659d352d38a3e0010322a904cf5c2b4fb8a5973b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:T7I6UKXNMCCECZIZ7KA3IEXZTU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Make Every Word Count: Adaptive BA with Fewer Words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alexander Spiegelman, Idit Keidar, Shir Cohen","submitted_at":"2022-02-18T11:03:36Z","abstract_excerpt":"Byzantine Agreement is a key component in many distributed systems. While Dolev and Reischuk have proven a long time ago that quadratic communication complexity is necessary for worst-case runs, the question of what can be done in practically common runs with fewer failures remained open. In this paper we present the first Byzantine Broadcast algorithm with $O(n(f+1))$ communication complexity, where $0\\leq f\\leq t$ is the actual number of process failures in a run. And for BA with strong unanimity, we present the first optimal-resilience algorithm that has linear communication complexity in t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.09123","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2202.09123/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"},"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-07-05T07:32:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NoCoukXG5xU1IJDmkIrEgnrLYKitwJiTlKD0gKwV5kOSrfaWY1Q346qySv2Efns6vl0aJfGmXW79523hatrSDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T11:17:55.737552Z"},"content_sha256":"ffe85973c3fec9bbf3010c7423ced29db43236e83001d295034549e3c209bcc1","schema_version":"1.0","event_id":"sha256:ffe85973c3fec9bbf3010c7423ced29db43236e83001d295034549e3c209bcc1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T7I6UKXNMCCECZIZ7KA3IEXZTU/bundle.json","state_url":"https://pith.science/pith/T7I6UKXNMCCECZIZ7KA3IEXZTU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T7I6UKXNMCCECZIZ7KA3IEXZTU/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-08-04T11:17:55Z","links":{"resolver":"https://pith.science/pith/T7I6UKXNMCCECZIZ7KA3IEXZTU","bundle":"https://pith.science/pith/T7I6UKXNMCCECZIZ7KA3IEXZTU/bundle.json","state":"https://pith.science/pith/T7I6UKXNMCCECZIZ7KA3IEXZTU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T7I6UKXNMCCECZIZ7KA3IEXZTU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:T7I6UKXNMCCECZIZ7KA3IEXZTU","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":"bb2da4b639f32758182c1d10b035d3a9114941e1a6e25994d8a3f8485e3fb80c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2022-02-18T11:03:36Z","title_canon_sha256":"c0f9006a4babd60fc44ceab63637ce7bba3cecd848d0906dbd681440863b4d64"},"schema_version":"1.0","source":{"id":"2202.09123","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2202.09123","created_at":"2026-07-05T07:32:14Z"},{"alias_kind":"arxiv_version","alias_value":"2202.09123v2","created_at":"2026-07-05T07:32:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.09123","created_at":"2026-07-05T07:32:14Z"},{"alias_kind":"pith_short_12","alias_value":"T7I6UKXNMCCE","created_at":"2026-07-05T07:32:14Z"},{"alias_kind":"pith_short_16","alias_value":"T7I6UKXNMCCECZIZ","created_at":"2026-07-05T07:32:14Z"},{"alias_kind":"pith_short_8","alias_value":"T7I6UKXN","created_at":"2026-07-05T07:32:14Z"}],"graph_snapshots":[{"event_id":"sha256:ffe85973c3fec9bbf3010c7423ced29db43236e83001d295034549e3c209bcc1","target":"graph","created_at":"2026-07-05T07:32:14Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2202.09123/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Byzantine Agreement is a key component in many distributed systems. While Dolev and Reischuk have proven a long time ago that quadratic communication complexity is necessary for worst-case runs, the question of what can be done in practically common runs with fewer failures remained open. In this paper we present the first Byzantine Broadcast algorithm with $O(n(f+1))$ communication complexity, where $0\\leq f\\leq t$ is the actual number of process failures in a run. And for BA with strong unanimity, we present the first optimal-resilience algorithm that has linear communication complexity in t","authors_text":"Alexander Spiegelman, Idit Keidar, Shir Cohen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2022-02-18T11:03:36Z","title":"Make Every Word Count: Adaptive BA with Fewer Words"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.09123","kind":"arxiv","version":2},"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:3b682fb5f382aeee0a97b91e659d352d38a3e0010322a904cf5c2b4fb8a5973b","target":"record","created_at":"2026-07-05T07:32:14Z","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":"bb2da4b639f32758182c1d10b035d3a9114941e1a6e25994d8a3f8485e3fb80c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2022-02-18T11:03:36Z","title_canon_sha256":"c0f9006a4babd60fc44ceab63637ce7bba3cecd848d0906dbd681440863b4d64"},"schema_version":"1.0","source":{"id":"2202.09123","kind":"arxiv","version":2}},"canonical_sha256":"9fd1ea2aed6084416519fa81b412f99d3ae28f5177bb232df5b276d1a06756c1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9fd1ea2aed6084416519fa81b412f99d3ae28f5177bb232df5b276d1a06756c1","first_computed_at":"2026-07-05T07:32:14.721039Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:32:14.721039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EsP2ZJInNodbD5BdKI/A+X0K1Xs39L9NUo/EU3mAI34HYE5PLcVzvhreai9reMgt9Po/CCKyWC/gIgoaLM5aAA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:32:14.721517Z","signed_message":"canonical_sha256_bytes"},"source_id":"2202.09123","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3b682fb5f382aeee0a97b91e659d352d38a3e0010322a904cf5c2b4fb8a5973b","sha256:ffe85973c3fec9bbf3010c7423ced29db43236e83001d295034549e3c209bcc1"],"state_sha256":"aeea8d49c95b4b38cd986e00018086bd925a560ae579ef2c17f858b9a1b51cd3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+V/QrE7CbDCX4YYXWN/b86A/FYNPY26ATVQAULCDyf54fTa448tiiH2CEhyMmvO7r2cBTFAVp/VC2MLflIEKDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T11:17:55.741755Z","bundle_sha256":"d2ffeed9909384d8611abd706f5484f576c2bf92b1fb31e002787e302a3c1bd3"}}