{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:V6NV6YRJTM45BNOOEC2EAWO4CZ","short_pith_number":"pith:V6NV6YRJ","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"},"canonical_sha256":"af9b5f62299b39d0b5ce20b44059dc1672e325b619cec384198116783ddc60a3","source":{"kind":"arxiv","id":"1604.08161","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.08161","created_at":"2026-05-18T01:16:07Z"},{"alias_kind":"arxiv_version","alias_value":"1604.08161v1","created_at":"2026-05-18T01:16:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.08161","created_at":"2026-05-18T01:16:07Z"},{"alias_kind":"pith_short_12","alias_value":"V6NV6YRJTM45","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"V6NV6YRJTM45BNOO","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"V6NV6YRJ","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:V6NV6YRJTM45BNOOEC2EAWO4CZ","target":"record","payload":{"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"},"canonical_sha256":"af9b5f62299b39d0b5ce20b44059dc1672e325b619cec384198116783ddc60a3","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"},"source_kind":"arxiv","source_id":"1604.08161","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-18T01:16:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"atnwlOVSmcuSBsASGA5vfXp+IwuoMjv862R/IkKiyMNANxrNvRyH6Uu6RKxybsvVK/HK2cc7MPR0oxMti9JMBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:33:43.732176Z"},"content_sha256":"18c9568e5eef711335d29d758f485a0750abcf4591523265a4114786d261d1c1","schema_version":"1.0","event_id":"sha256:18c9568e5eef711335d29d758f485a0750abcf4591523265a4114786d261d1c1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:V6NV6YRJTM45BNOOEC2EAWO4CZ","target":"graph","payload":{"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"},"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-18T01:16:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8i1ED6R6xdSqMWuOjEX7GAmRNCS1Cfl+8chhBw+N+ERKaGnrZ6AZdMom/h1USmxTvpQQamQdNfZmflBKQ+sDBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:33:43.732578Z"},"content_sha256":"6a446a03468cd81e28edf2077f57cb7202ff529a1274aae0a53e8cd432357fa4","schema_version":"1.0","event_id":"sha256:6a446a03468cd81e28edf2077f57cb7202ff529a1274aae0a53e8cd432357fa4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V6NV6YRJTM45BNOOEC2EAWO4CZ/bundle.json","state_url":"https://pith.science/pith/V6NV6YRJTM45BNOOEC2EAWO4CZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V6NV6YRJTM45BNOOEC2EAWO4CZ/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-28T13:33:43Z","links":{"resolver":"https://pith.science/pith/V6NV6YRJTM45BNOOEC2EAWO4CZ","bundle":"https://pith.science/pith/V6NV6YRJTM45BNOOEC2EAWO4CZ/bundle.json","state":"https://pith.science/pith/V6NV6YRJTM45BNOOEC2EAWO4CZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V6NV6YRJTM45BNOOEC2EAWO4CZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:V6NV6YRJTM45BNOOEC2EAWO4CZ","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":"82918e64134a75c82200409c3ed1409c4bd6910c1f98410a2f785a2008a5926b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-12-07T08:53:28Z","title_canon_sha256":"86e8dc759615a7475ac0e5c4cfb6a5a6d43507fa88c9b46510940c0cff0df895"},"schema_version":"1.0","source":{"id":"1604.08161","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.08161","created_at":"2026-05-18T01:16:07Z"},{"alias_kind":"arxiv_version","alias_value":"1604.08161v1","created_at":"2026-05-18T01:16:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.08161","created_at":"2026-05-18T01:16:07Z"},{"alias_kind":"pith_short_12","alias_value":"V6NV6YRJTM45","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"V6NV6YRJTM45BNOO","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"V6NV6YRJ","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:6a446a03468cd81e28edf2077f57cb7202ff529a1274aae0a53e8cd432357fa4","target":"graph","created_at":"2026-05-18T01:16:07Z","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":"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 ","authors_text":"Achour Mosteafoui, Claude Jard, Matoula Petrolia, Michel Raynal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-12-07T08:53:28Z","title":"Atomic Read/Write Memory in Signature-free Byzantine Asynchronous Message-passing Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.08161","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:18c9568e5eef711335d29d758f485a0750abcf4591523265a4114786d261d1c1","target":"record","created_at":"2026-05-18T01:16:07Z","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":"82918e64134a75c82200409c3ed1409c4bd6910c1f98410a2f785a2008a5926b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-12-07T08:53:28Z","title_canon_sha256":"86e8dc759615a7475ac0e5c4cfb6a5a6d43507fa88c9b46510940c0cff0df895"},"schema_version":"1.0","source":{"id":"1604.08161","kind":"arxiv","version":1}},"canonical_sha256":"af9b5f62299b39d0b5ce20b44059dc1672e325b619cec384198116783ddc60a3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"af9b5f62299b39d0b5ce20b44059dc1672e325b619cec384198116783ddc60a3","first_computed_at":"2026-05-18T01:16:07.936153Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:07.936153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4r2SeZkoT5f6fWkHD9NRFwnMmO2M4gkFB9gjRnI01B5j7BJZggYWwBY5ZQTbfQOtqa41c3wehB1F0K6YfBWSAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:07.936807Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.08161","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:18c9568e5eef711335d29d758f485a0750abcf4591523265a4114786d261d1c1","sha256:6a446a03468cd81e28edf2077f57cb7202ff529a1274aae0a53e8cd432357fa4"],"state_sha256":"a9db233a3bf8959e1d7584b7bbbb60f17376d665eb2d1a33dd8ed1a5eb9804e6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v9f5TEyJ7+lsbtXmhnpVX5YLzPM/9iJQ6//OoNeK+gMmk4pkW5F6Rxt62fBOPAl2+QmtZ05C2Mav/TVdHBruDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T13:33:43.734607Z","bundle_sha256":"9ed1d9c75ece5ccf357fee1b95626ac652a4b09d98c7a6103ea44042d24239b6"}}