{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:YUJWHDBQQUUTHGUXOF2SJZ2WJ5","short_pith_number":"pith:YUJWHDBQ","schema_version":"1.0","canonical_sha256":"c513638c308529339a97717524e7564f5dc2fcc296c1e5b0e637798a6244e8da","source":{"kind":"arxiv","id":"1601.04820","version":1},"attestation_state":"computed","paper":{"title":"Time-Efficient Read/Write Register in Crash-prone Asynchronous Message-Passing Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Achour Mostefaoui (LINA), Michel Raynal (ASAP)","submitted_at":"2016-01-19T08:38:42Z","abstract_excerpt":"The atomic register is certainly the most basic object of computing science. Its implementation on top of an n-process asynchronous message-passing system has received a lot of attention. It has been shown that t \\textless{} n/2 (where t is the maximal number of processes that may crash) is a necessary and sufficient requirement to build an atomic register on top of a crash-prone asynchronous message-passing system. Considering such a context, this paper visits the notion of a fast implementation of an atomic register, and presents a new time-efficient asynchronous algorithm. Its time-efficien"},"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":"1601.04820","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-01-19T08:38:42Z","cross_cats_sorted":[],"title_canon_sha256":"73e97343bc370b7a7fe0f16db19e113108ca4f8faf15a1f3f3e42a8d30386796","abstract_canon_sha256":"9fc7fd64065fb4f5eb559a7f5a04ae91fe6388e318991ee8d0f4cc4600fb9d00"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:31.768296Z","signature_b64":"2KYoSyfsacH1RPDhhPV+rrv2dfqhCXA46e0t0yVK45KLUT0hXdTKz9+6r9P32ArrKN0OLuD/f9txHzt1fhzhAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c513638c308529339a97717524e7564f5dc2fcc296c1e5b0e637798a6244e8da","last_reissued_at":"2026-05-18T01:22:31.767743Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:31.767743Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Time-Efficient Read/Write Register in Crash-prone Asynchronous Message-Passing Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Achour Mostefaoui (LINA), Michel Raynal (ASAP)","submitted_at":"2016-01-19T08:38:42Z","abstract_excerpt":"The atomic register is certainly the most basic object of computing science. Its implementation on top of an n-process asynchronous message-passing system has received a lot of attention. It has been shown that t \\textless{} n/2 (where t is the maximal number of processes that may crash) is a necessary and sufficient requirement to build an atomic register on top of a crash-prone asynchronous message-passing system. Considering such a context, this paper visits the notion of a fast implementation of an atomic register, and presents a new time-efficient asynchronous algorithm. Its time-efficien"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.04820","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":"1601.04820","created_at":"2026-05-18T01:22:31.767826+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.04820v1","created_at":"2026-05-18T01:22:31.767826+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.04820","created_at":"2026-05-18T01:22:31.767826+00:00"},{"alias_kind":"pith_short_12","alias_value":"YUJWHDBQQUUT","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"YUJWHDBQQUUTHGUX","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"YUJWHDBQ","created_at":"2026-05-18T12:30:53.716459+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/YUJWHDBQQUUTHGUXOF2SJZ2WJ5","json":"https://pith.science/pith/YUJWHDBQQUUTHGUXOF2SJZ2WJ5.json","graph_json":"https://pith.science/api/pith-number/YUJWHDBQQUUTHGUXOF2SJZ2WJ5/graph.json","events_json":"https://pith.science/api/pith-number/YUJWHDBQQUUTHGUXOF2SJZ2WJ5/events.json","paper":"https://pith.science/paper/YUJWHDBQ"},"agent_actions":{"view_html":"https://pith.science/pith/YUJWHDBQQUUTHGUXOF2SJZ2WJ5","download_json":"https://pith.science/pith/YUJWHDBQQUUTHGUXOF2SJZ2WJ5.json","view_paper":"https://pith.science/paper/YUJWHDBQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.04820&json=true","fetch_graph":"https://pith.science/api/pith-number/YUJWHDBQQUUTHGUXOF2SJZ2WJ5/graph.json","fetch_events":"https://pith.science/api/pith-number/YUJWHDBQQUUTHGUXOF2SJZ2WJ5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YUJWHDBQQUUTHGUXOF2SJZ2WJ5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YUJWHDBQQUUTHGUXOF2SJZ2WJ5/action/storage_attestation","attest_author":"https://pith.science/pith/YUJWHDBQQUUTHGUXOF2SJZ2WJ5/action/author_attestation","sign_citation":"https://pith.science/pith/YUJWHDBQQUUTHGUXOF2SJZ2WJ5/action/citation_signature","submit_replication":"https://pith.science/pith/YUJWHDBQQUUTHGUXOF2SJZ2WJ5/action/replication_record"}},"created_at":"2026-05-18T01:22:31.767826+00:00","updated_at":"2026-05-18T01:22:31.767826+00:00"}