{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:LO6HQ3ZIHMG3UQMPN3BCAKXYH6","short_pith_number":"pith:LO6HQ3ZI","schema_version":"1.0","canonical_sha256":"5bbc786f283b0dba418f6ec2202af83fb4154e0aac6eb967754ca962277532cd","source":{"kind":"arxiv","id":"1709.06808","version":2},"attestation_state":"computed","paper":{"title":"The Life in 1-Consensus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Eli Daian, Eli Gafni, Yehuda Afek","submitted_at":"2017-09-20T10:49:30Z","abstract_excerpt":"This paper introduces the atomic Write and Read Next ($\\text{WRN}_{k}$) deterministic shared memory object, that for any $k\\ge3$, is stronger than read-write registers, but is unable to implement $2$-processor consensus. In particular, it refutes the conjecture claiming that every deterministic object of consensus number $1$ is computationally equivalent to read-write registers."},"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":"1709.06808","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-09-20T10:49:30Z","cross_cats_sorted":[],"title_canon_sha256":"dc780907e7ec7e8c07b630e8d8f952158f456c44c3ff2284c9d4518a35b81564","abstract_canon_sha256":"c0b033b50f53ef3ae91f0535a4c0442e978b207090b22d3fc225b469e8b38ca7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:12.670233Z","signature_b64":"W14q/lfp5yS86qRQsAg1kOFFLWi/Mn4EsKtxROC8oSoYCFvzL4i+Vp258lfvJEEuOw6Ki4ZhJL1KHi62O35uAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5bbc786f283b0dba418f6ec2202af83fb4154e0aac6eb967754ca962277532cd","last_reissued_at":"2026-05-18T00:34:12.669438Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:12.669438Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Life in 1-Consensus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Eli Daian, Eli Gafni, Yehuda Afek","submitted_at":"2017-09-20T10:49:30Z","abstract_excerpt":"This paper introduces the atomic Write and Read Next ($\\text{WRN}_{k}$) deterministic shared memory object, that for any $k\\ge3$, is stronger than read-write registers, but is unable to implement $2$-processor consensus. In particular, it refutes the conjecture claiming that every deterministic object of consensus number $1$ is computationally equivalent to read-write registers."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.06808","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":""},"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":"1709.06808","created_at":"2026-05-18T00:34:12.669546+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.06808v2","created_at":"2026-05-18T00:34:12.669546+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.06808","created_at":"2026-05-18T00:34:12.669546+00:00"},{"alias_kind":"pith_short_12","alias_value":"LO6HQ3ZIHMG3","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"LO6HQ3ZIHMG3UQMP","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"LO6HQ3ZI","created_at":"2026-05-18T12:31:28.150371+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/LO6HQ3ZIHMG3UQMPN3BCAKXYH6","json":"https://pith.science/pith/LO6HQ3ZIHMG3UQMPN3BCAKXYH6.json","graph_json":"https://pith.science/api/pith-number/LO6HQ3ZIHMG3UQMPN3BCAKXYH6/graph.json","events_json":"https://pith.science/api/pith-number/LO6HQ3ZIHMG3UQMPN3BCAKXYH6/events.json","paper":"https://pith.science/paper/LO6HQ3ZI"},"agent_actions":{"view_html":"https://pith.science/pith/LO6HQ3ZIHMG3UQMPN3BCAKXYH6","download_json":"https://pith.science/pith/LO6HQ3ZIHMG3UQMPN3BCAKXYH6.json","view_paper":"https://pith.science/paper/LO6HQ3ZI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.06808&json=true","fetch_graph":"https://pith.science/api/pith-number/LO6HQ3ZIHMG3UQMPN3BCAKXYH6/graph.json","fetch_events":"https://pith.science/api/pith-number/LO6HQ3ZIHMG3UQMPN3BCAKXYH6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LO6HQ3ZIHMG3UQMPN3BCAKXYH6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LO6HQ3ZIHMG3UQMPN3BCAKXYH6/action/storage_attestation","attest_author":"https://pith.science/pith/LO6HQ3ZIHMG3UQMPN3BCAKXYH6/action/author_attestation","sign_citation":"https://pith.science/pith/LO6HQ3ZIHMG3UQMPN3BCAKXYH6/action/citation_signature","submit_replication":"https://pith.science/pith/LO6HQ3ZIHMG3UQMPN3BCAKXYH6/action/replication_record"}},"created_at":"2026-05-18T00:34:12.669546+00:00","updated_at":"2026-05-18T00:34:12.669546+00:00"}