{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:V6NV6YRJTM45BNOOEC2EAWO4CZ","short_pith_number":"pith:V6NV6YRJ","schema_version":"1.0","canonical_sha256":"af9b5f62299b39d0b5ce20b44059dc1672e325b619cec384198116783ddc60a3","source":{"kind":"arxiv","id":"1604.08161","version":1},"attestation_state":"computed","paper":{"title":"Atomic Read/Write Memory in Signature-free Byzantine Asynchronous Message-passing Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Achour Mosteafoui, Claude Jard, Matoula Petrolia, Michel Raynal","submitted_at":"2015-12-07T08:53:28Z","abstract_excerpt":"This article presents a signature-free distributed algorithm which builds an atomic read/write shared memory on top of an $n$-process asynchronous message-passing system in which up to $t<n/3$ processes may commit Byzantine failures. From a conceptual point of view, this algorithm is designed to be as close as possible to the algorithm proposed by Attiya, Bar-Noy and Dolev (JACM 1995), which builds an atomic register in an $n$-process asynchronous message-passing system where up to $t<n/2$ processes may crash. The proposed algorithm is particularly simple. It does not use cryptography to cope "},"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":"1604.08161","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-12-07T08:53:28Z","cross_cats_sorted":[],"title_canon_sha256":"86e8dc759615a7475ac0e5c4cfb6a5a6d43507fa88c9b46510940c0cff0df895","abstract_canon_sha256":"82918e64134a75c82200409c3ed1409c4bd6910c1f98410a2f785a2008a5926b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:07.936807Z","signature_b64":"4r2SeZkoT5f6fWkHD9NRFwnMmO2M4gkFB9gjRnI01B5j7BJZggYWwBY5ZQTbfQOtqa41c3wehB1F0K6YfBWSAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af9b5f62299b39d0b5ce20b44059dc1672e325b619cec384198116783ddc60a3","last_reissued_at":"2026-05-18T01:16:07.936153Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:07.936153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Atomic Read/Write Memory in Signature-free Byzantine Asynchronous Message-passing Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Achour Mosteafoui, Claude Jard, Matoula Petrolia, Michel Raynal","submitted_at":"2015-12-07T08:53:28Z","abstract_excerpt":"This article presents a signature-free distributed algorithm which builds an atomic read/write shared memory on top of an $n$-process asynchronous message-passing system in which up to $t<n/3$ processes may commit Byzantine failures. From a conceptual point of view, this algorithm is designed to be as close as possible to the algorithm proposed by Attiya, Bar-Noy and Dolev (JACM 1995), which builds an atomic register in an $n$-process asynchronous message-passing system where up to $t<n/2$ processes may crash. The proposed algorithm is particularly simple. It does not use cryptography to cope "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.08161","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":"1604.08161","created_at":"2026-05-18T01:16:07.936237+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.08161v1","created_at":"2026-05-18T01:16:07.936237+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.08161","created_at":"2026-05-18T01:16:07.936237+00:00"},{"alias_kind":"pith_short_12","alias_value":"V6NV6YRJTM45","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"V6NV6YRJTM45BNOO","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"V6NV6YRJ","created_at":"2026-05-18T12:29:44.643036+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/V6NV6YRJTM45BNOOEC2EAWO4CZ","json":"https://pith.science/pith/V6NV6YRJTM45BNOOEC2EAWO4CZ.json","graph_json":"https://pith.science/api/pith-number/V6NV6YRJTM45BNOOEC2EAWO4CZ/graph.json","events_json":"https://pith.science/api/pith-number/V6NV6YRJTM45BNOOEC2EAWO4CZ/events.json","paper":"https://pith.science/paper/V6NV6YRJ"},"agent_actions":{"view_html":"https://pith.science/pith/V6NV6YRJTM45BNOOEC2EAWO4CZ","download_json":"https://pith.science/pith/V6NV6YRJTM45BNOOEC2EAWO4CZ.json","view_paper":"https://pith.science/paper/V6NV6YRJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.08161&json=true","fetch_graph":"https://pith.science/api/pith-number/V6NV6YRJTM45BNOOEC2EAWO4CZ/graph.json","fetch_events":"https://pith.science/api/pith-number/V6NV6YRJTM45BNOOEC2EAWO4CZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V6NV6YRJTM45BNOOEC2EAWO4CZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V6NV6YRJTM45BNOOEC2EAWO4CZ/action/storage_attestation","attest_author":"https://pith.science/pith/V6NV6YRJTM45BNOOEC2EAWO4CZ/action/author_attestation","sign_citation":"https://pith.science/pith/V6NV6YRJTM45BNOOEC2EAWO4CZ/action/citation_signature","submit_replication":"https://pith.science/pith/V6NV6YRJTM45BNOOEC2EAWO4CZ/action/replication_record"}},"created_at":"2026-05-18T01:16:07.936237+00:00","updated_at":"2026-05-18T01:16:07.936237+00:00"}