{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:NF5NWL3NGR6W2SCZAKQ7EUJWRB","short_pith_number":"pith:NF5NWL3N","schema_version":"1.0","canonical_sha256":"697adb2f6d347d6d485902a1f25136886d3a3ae81843ad9ebd7f5ae9cca5e035","source":{"kind":"arxiv","id":"1109.3370","version":1},"attestation_state":"computed","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,"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1109.3370","created_at":"2026-05-18T04:12:56.877775+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.3370v1","created_at":"2026-05-18T04:12:56.877775+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.3370","created_at":"2026-05-18T04:12:56.877775+00:00"},{"alias_kind":"pith_short_12","alias_value":"NF5NWL3NGR6W","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"NF5NWL3NGR6W2SCZ","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"NF5NWL3N","created_at":"2026-05-18T12:26:37.096874+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NF5NWL3NGR6W2SCZAKQ7EUJWRB","json":"https://pith.science/pith/NF5NWL3NGR6W2SCZAKQ7EUJWRB.json","graph_json":"https://pith.science/api/pith-number/NF5NWL3NGR6W2SCZAKQ7EUJWRB/graph.json","events_json":"https://pith.science/api/pith-number/NF5NWL3NGR6W2SCZAKQ7EUJWRB/events.json","paper":"https://pith.science/paper/NF5NWL3N"},"agent_actions":{"view_html":"https://pith.science/pith/NF5NWL3NGR6W2SCZAKQ7EUJWRB","download_json":"https://pith.science/pith/NF5NWL3NGR6W2SCZAKQ7EUJWRB.json","view_paper":"https://pith.science/paper/NF5NWL3N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.3370&json=true","fetch_graph":"https://pith.science/api/pith-number/NF5NWL3NGR6W2SCZAKQ7EUJWRB/graph.json","fetch_events":"https://pith.science/api/pith-number/NF5NWL3NGR6W2SCZAKQ7EUJWRB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NF5NWL3NGR6W2SCZAKQ7EUJWRB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NF5NWL3NGR6W2SCZAKQ7EUJWRB/action/storage_attestation","attest_author":"https://pith.science/pith/NF5NWL3NGR6W2SCZAKQ7EUJWRB/action/author_attestation","sign_citation":"https://pith.science/pith/NF5NWL3NGR6W2SCZAKQ7EUJWRB/action/citation_signature","submit_replication":"https://pith.science/pith/NF5NWL3NGR6W2SCZAKQ7EUJWRB/action/replication_record"}},"created_at":"2026-05-18T04:12:56.877775+00:00","updated_at":"2026-05-18T04:12:56.877775+00:00"}