{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:TVMMSEUVQXQT4E7WDMCZX76FKR","short_pith_number":"pith:TVMMSEUV","canonical_record":{"source":{"id":"1301.3223","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-01-15T04:39:01Z","cross_cats_sorted":[],"title_canon_sha256":"6a639f2e3b929c62a435b35f3ab62dbddeee12076550e287064eeb242878d382","abstract_canon_sha256":"9dd2ede1dff24db4f9a5e316e443d562147a436814dbe02f925778b89f84dd6b"},"schema_version":"1.0"},"canonical_sha256":"9d58c9129585e13e13f61b059bffc5544ab23c796914b9449a9f51d8c612bb4d","source":{"kind":"arxiv","id":"1301.3223","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.3223","created_at":"2026-05-18T03:21:10Z"},{"alias_kind":"arxiv_version","alias_value":"1301.3223v4","created_at":"2026-05-18T03:21:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.3223","created_at":"2026-05-18T03:21:10Z"},{"alias_kind":"pith_short_12","alias_value":"TVMMSEUVQXQT","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"TVMMSEUVQXQT4E7W","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"TVMMSEUV","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:TVMMSEUVQXQT4E7WDMCZX76FKR","target":"record","payload":{"canonical_record":{"source":{"id":"1301.3223","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-01-15T04:39:01Z","cross_cats_sorted":[],"title_canon_sha256":"6a639f2e3b929c62a435b35f3ab62dbddeee12076550e287064eeb242878d382","abstract_canon_sha256":"9dd2ede1dff24db4f9a5e316e443d562147a436814dbe02f925778b89f84dd6b"},"schema_version":"1.0"},"canonical_sha256":"9d58c9129585e13e13f61b059bffc5544ab23c796914b9449a9f51d8c612bb4d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:21:10.346264Z","signature_b64":"RvAXbz4IVxTDaelfoiJl/S5GgVkdh18hx3rDy1qoxIyw5bqGmj7nsfxocNb9lEugp89b0EolRUb8g3FCkrybAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d58c9129585e13e13f61b059bffc5544ab23c796914b9449a9f51d8c612bb4d","last_reissued_at":"2026-05-18T03:21:10.345714Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:21:10.345714Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.3223","source_version":4,"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-18T03:21:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RxjEqG/S92YF4MDr8PV6/RDzC8KviQA3qpFe/SbLKSWq2PjCYapXvTR3/1zmrwn762LsYQcNyvGAdakb44thAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T21:16:57.645389Z"},"content_sha256":"ca87929590a4d9aa9512896c3789f38320190b60ca91e4f1d0644c23328c1160","schema_version":"1.0","event_id":"sha256:ca87929590a4d9aa9512896c3789f38320190b60ca91e4f1d0644c23328c1160"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:TVMMSEUVQXQT4E7WDMCZX76FKR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Complexity of Asynchronous Agreement Against Powerful Adversaries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Allison Lewko, Mark Lewko","submitted_at":"2013-01-15T04:39:01Z","abstract_excerpt":"We introduce new techniques for proving lower bounds on the running time of randomized algorithms for asynchronous agreement against powerful adversaries. In particular, we define a \\emph{strongly adaptive adversary} that is computationally unbounded and has a limited ability to corrupt a dynamic subset of processors by erasing their memories. We demonstrate that the randomized agreement algorithms designed by Ben-Or and Bracha to tolerate crash or Byzantine failures in the asynchronous setting extend to defeat a strongly adaptive adversary. These algorithms have essentially perfect correctnes"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.3223","kind":"arxiv","version":4},"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-18T03:21:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qobr5Z64Hc6xavIjmmzO6XZmhh/+DsfBjh9h7n/tS0e0v/v1HVvp+fhHQi1hZPxL9VMbkyNTXJ2bDi47eK6xBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T21:16:57.645733Z"},"content_sha256":"ec5f93b94308735d679c4a1f9f0a7907326a3e9c63a0c0203a3fa1a169eb34c8","schema_version":"1.0","event_id":"sha256:ec5f93b94308735d679c4a1f9f0a7907326a3e9c63a0c0203a3fa1a169eb34c8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TVMMSEUVQXQT4E7WDMCZX76FKR/bundle.json","state_url":"https://pith.science/pith/TVMMSEUVQXQT4E7WDMCZX76FKR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TVMMSEUVQXQT4E7WDMCZX76FKR/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-06-20T21:16:57Z","links":{"resolver":"https://pith.science/pith/TVMMSEUVQXQT4E7WDMCZX76FKR","bundle":"https://pith.science/pith/TVMMSEUVQXQT4E7WDMCZX76FKR/bundle.json","state":"https://pith.science/pith/TVMMSEUVQXQT4E7WDMCZX76FKR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TVMMSEUVQXQT4E7WDMCZX76FKR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:TVMMSEUVQXQT4E7WDMCZX76FKR","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":"9dd2ede1dff24db4f9a5e316e443d562147a436814dbe02f925778b89f84dd6b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-01-15T04:39:01Z","title_canon_sha256":"6a639f2e3b929c62a435b35f3ab62dbddeee12076550e287064eeb242878d382"},"schema_version":"1.0","source":{"id":"1301.3223","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.3223","created_at":"2026-05-18T03:21:10Z"},{"alias_kind":"arxiv_version","alias_value":"1301.3223v4","created_at":"2026-05-18T03:21:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.3223","created_at":"2026-05-18T03:21:10Z"},{"alias_kind":"pith_short_12","alias_value":"TVMMSEUVQXQT","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"TVMMSEUVQXQT4E7W","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"TVMMSEUV","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:ec5f93b94308735d679c4a1f9f0a7907326a3e9c63a0c0203a3fa1a169eb34c8","target":"graph","created_at":"2026-05-18T03:21:10Z","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 introduce new techniques for proving lower bounds on the running time of randomized algorithms for asynchronous agreement against powerful adversaries. In particular, we define a \\emph{strongly adaptive adversary} that is computationally unbounded and has a limited ability to corrupt a dynamic subset of processors by erasing their memories. We demonstrate that the randomized agreement algorithms designed by Ben-Or and Bracha to tolerate crash or Byzantine failures in the asynchronous setting extend to defeat a strongly adaptive adversary. These algorithms have essentially perfect correctnes","authors_text":"Allison Lewko, Mark Lewko","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-01-15T04:39:01Z","title":"On the Complexity of Asynchronous Agreement Against Powerful Adversaries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.3223","kind":"arxiv","version":4},"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:ca87929590a4d9aa9512896c3789f38320190b60ca91e4f1d0644c23328c1160","target":"record","created_at":"2026-05-18T03:21:10Z","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":"9dd2ede1dff24db4f9a5e316e443d562147a436814dbe02f925778b89f84dd6b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-01-15T04:39:01Z","title_canon_sha256":"6a639f2e3b929c62a435b35f3ab62dbddeee12076550e287064eeb242878d382"},"schema_version":"1.0","source":{"id":"1301.3223","kind":"arxiv","version":4}},"canonical_sha256":"9d58c9129585e13e13f61b059bffc5544ab23c796914b9449a9f51d8c612bb4d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9d58c9129585e13e13f61b059bffc5544ab23c796914b9449a9f51d8c612bb4d","first_computed_at":"2026-05-18T03:21:10.345714Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:21:10.345714Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RvAXbz4IVxTDaelfoiJl/S5GgVkdh18hx3rDy1qoxIyw5bqGmj7nsfxocNb9lEugp89b0EolRUb8g3FCkrybAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:21:10.346264Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.3223","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ca87929590a4d9aa9512896c3789f38320190b60ca91e4f1d0644c23328c1160","sha256:ec5f93b94308735d679c4a1f9f0a7907326a3e9c63a0c0203a3fa1a169eb34c8"],"state_sha256":"8b1cd2ff347034a9190ee874f0cb8530251ac8c3dbe2b1f988c90407b8b57add"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g8dONIrBqiUBLQUsafrFjQMa1xGT8LMi/V9O7+89dZKdRiPyK76y/1Lp1ufP/15gJ9i33bKnqghKY546HFHdAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T21:16:57.647796Z","bundle_sha256":"4abf90d41243406d90ed63a72b59cabb4df4a730b75c3934f35ffa71f8418bbd"}}