{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:NF5NWL3NGR6W2SCZAKQ7EUJWRB","short_pith_number":"pith:NF5NWL3N","canonical_record":{"source":{"id":"1109.3370","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-09-15T14:54:07Z","cross_cats_sorted":[],"title_canon_sha256":"0aed2f707d47484f9038a0b4c01a55c8a50248a4adcae76c83e9117b830aff03","abstract_canon_sha256":"52f6a2b24dd1793ef0bf9be60be24a71267d35bd90cafb9ecc9f118267922d87"},"schema_version":"1.0"},"canonical_sha256":"697adb2f6d347d6d485902a1f25136886d3a3ae81843ad9ebd7f5ae9cca5e035","source":{"kind":"arxiv","id":"1109.3370","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.3370","created_at":"2026-05-18T04:12:56Z"},{"alias_kind":"arxiv_version","alias_value":"1109.3370v1","created_at":"2026-05-18T04:12:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.3370","created_at":"2026-05-18T04:12:56Z"},{"alias_kind":"pith_short_12","alias_value":"NF5NWL3NGR6W","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"NF5NWL3NGR6W2SCZ","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"NF5NWL3N","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:NF5NWL3NGR6W2SCZAKQ7EUJWRB","target":"record","payload":{"canonical_record":{"source":{"id":"1109.3370","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-09-15T14:54:07Z","cross_cats_sorted":[],"title_canon_sha256":"0aed2f707d47484f9038a0b4c01a55c8a50248a4adcae76c83e9117b830aff03","abstract_canon_sha256":"52f6a2b24dd1793ef0bf9be60be24a71267d35bd90cafb9ecc9f118267922d87"},"schema_version":"1.0"},"canonical_sha256":"697adb2f6d347d6d485902a1f25136886d3a3ae81843ad9ebd7f5ae9cca5e035","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:12:56.878163Z","signature_b64":"nNJXj/3co7cWjcuqlCsNTjE4eNnAAb4DtiUrE8PoITsym6HCJWcmYcMY1WgTqDMNpjos+xwtN2hWeXn97Ao1BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"697adb2f6d347d6d485902a1f25136886d3a3ae81843ad9ebd7f5ae9cca5e035","last_reissued_at":"2026-05-18T04:12:56.877702Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:12:56.877702Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.3370","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-18T04:12:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P4Uckknmde1yz/YVh2NlP61fxmIN8pr0D6PpWPP0d8fP3bmCdNxKctaWnkUsmxCxH/FKfPdeCKYDxAEJm64wAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:50:20.466233Z"},"content_sha256":"78d5345733670c5dc24637f2e85e1b6bf4c2606c4edb5ed46b98057d4e48b870","schema_version":"1.0","event_id":"sha256:78d5345733670c5dc24637f2e85e1b6bf4c2606c4edb5ed46b98057d4e48b870"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:NF5NWL3NGR6W2SCZAKQ7EUJWRB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Effectively Nonblocking Consensus Procedures Can Execute Forever - a Constructive Version of FLP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Robert Constable","submitted_at":"2011-09-15T14:54:07Z","abstract_excerpt":"The Fischer-Lynch-Paterson theorem (FLP) says that it is impossible for processes in an asynchronous distributed system to achieve consensus on a binary value when a single process can fail; it is a widely cited theoretical result about network computing. All proofs that I know depend essentially on classical (nonconstructive) logic, although they use the hypothetical construction of a nonterminating execution as a main lemma.\n  FLP is also a guide for protocol designers, and in that role there is a connection to an important property of consensus procedures, namely that they should not block,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.3370","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-18T04:12:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aciq160JEXg/La8GENlXTC/Q10tkc1iLiBLG9jRMmMVwGYKFzQn49YHgLLi2BLphe57OsVFj33+5CI+LI+FUBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:50:20.466849Z"},"content_sha256":"5849fb41b062a618aaffebbb4e3e81ffe27f2bd05d860a5400dc792173b74c86","schema_version":"1.0","event_id":"sha256:5849fb41b062a618aaffebbb4e3e81ffe27f2bd05d860a5400dc792173b74c86"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NF5NWL3NGR6W2SCZAKQ7EUJWRB/bundle.json","state_url":"https://pith.science/pith/NF5NWL3NGR6W2SCZAKQ7EUJWRB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NF5NWL3NGR6W2SCZAKQ7EUJWRB/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-28T16:50:20Z","links":{"resolver":"https://pith.science/pith/NF5NWL3NGR6W2SCZAKQ7EUJWRB","bundle":"https://pith.science/pith/NF5NWL3NGR6W2SCZAKQ7EUJWRB/bundle.json","state":"https://pith.science/pith/NF5NWL3NGR6W2SCZAKQ7EUJWRB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NF5NWL3NGR6W2SCZAKQ7EUJWRB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:NF5NWL3NGR6W2SCZAKQ7EUJWRB","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":"52f6a2b24dd1793ef0bf9be60be24a71267d35bd90cafb9ecc9f118267922d87","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-09-15T14:54:07Z","title_canon_sha256":"0aed2f707d47484f9038a0b4c01a55c8a50248a4adcae76c83e9117b830aff03"},"schema_version":"1.0","source":{"id":"1109.3370","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.3370","created_at":"2026-05-18T04:12:56Z"},{"alias_kind":"arxiv_version","alias_value":"1109.3370v1","created_at":"2026-05-18T04:12:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.3370","created_at":"2026-05-18T04:12:56Z"},{"alias_kind":"pith_short_12","alias_value":"NF5NWL3NGR6W","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"NF5NWL3NGR6W2SCZ","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"NF5NWL3N","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:5849fb41b062a618aaffebbb4e3e81ffe27f2bd05d860a5400dc792173b74c86","target":"graph","created_at":"2026-05-18T04:12:56Z","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":"The Fischer-Lynch-Paterson theorem (FLP) says that it is impossible for processes in an asynchronous distributed system to achieve consensus on a binary value when a single process can fail; it is a widely cited theoretical result about network computing. All proofs that I know depend essentially on classical (nonconstructive) logic, although they use the hypothetical construction of a nonterminating execution as a main lemma.\n  FLP is also a guide for protocol designers, and in that role there is a connection to an important property of consensus procedures, namely that they should not block,","authors_text":"Robert Constable","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-09-15T14:54:07Z","title":"Effectively Nonblocking Consensus Procedures Can Execute Forever - a Constructive Version of FLP"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.3370","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:78d5345733670c5dc24637f2e85e1b6bf4c2606c4edb5ed46b98057d4e48b870","target":"record","created_at":"2026-05-18T04:12:56Z","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":"52f6a2b24dd1793ef0bf9be60be24a71267d35bd90cafb9ecc9f118267922d87","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-09-15T14:54:07Z","title_canon_sha256":"0aed2f707d47484f9038a0b4c01a55c8a50248a4adcae76c83e9117b830aff03"},"schema_version":"1.0","source":{"id":"1109.3370","kind":"arxiv","version":1}},"canonical_sha256":"697adb2f6d347d6d485902a1f25136886d3a3ae81843ad9ebd7f5ae9cca5e035","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"697adb2f6d347d6d485902a1f25136886d3a3ae81843ad9ebd7f5ae9cca5e035","first_computed_at":"2026-05-18T04:12:56.877702Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:12:56.877702Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nNJXj/3co7cWjcuqlCsNTjE4eNnAAb4DtiUrE8PoITsym6HCJWcmYcMY1WgTqDMNpjos+xwtN2hWeXn97Ao1BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:12:56.878163Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.3370","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:78d5345733670c5dc24637f2e85e1b6bf4c2606c4edb5ed46b98057d4e48b870","sha256:5849fb41b062a618aaffebbb4e3e81ffe27f2bd05d860a5400dc792173b74c86"],"state_sha256":"0f1784e852e8c6b190b8715cb4524fd64224a595c08e288f8952f0df9b8479ae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"26FNwvPQYIbf7pUiW78ZSbU/l20usfPd+euDzDj5v0D3SSUCqds/zL4blm853xK5c4lmTuiLej1nGqncRoi6DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T16:50:20.470579Z","bundle_sha256":"5a0111eec143a346161c11a894dd2c0f4e1d17eb08b6e4c29d1c87fcccf1ce09"}}