{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:2IXEEIV3WBKMGMSUG42N3VJKHW","short_pith_number":"pith:2IXEEIV3","schema_version":"1.0","canonical_sha256":"d22e4222bbb054c332543734ddd52a3daa9966c2608f6e1df2fd42835c6e0cbb","source":{"kind":"arxiv","id":"1709.01879","version":2},"attestation_state":"computed","paper":{"title":"Progress-Space Tradeoffs in Single-Writer Memory Implementations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Damien Imbs, Petr Kuznetsov, Thibault Rieutord","submitted_at":"2017-09-06T16:25:50Z","abstract_excerpt":"Most algorithms designed for shared-memory distributed systems assume the single-writer multi-reader (SWMR) setting where each process is provided with a unique register readable by all. In a system where computation is performed by a bounded number n of processes coming from a very large (possibly unbounded) set of potential participants, the assumption of a SWMR memory is no longer reasonable. If only a bounded number of multi-writer multi-reader (MWMR) registers are provided, we cannot rely on an a priori assignment of processes to registers. In this setting, simulating SWMR memory, or equi"},"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.01879","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-09-06T16:25:50Z","cross_cats_sorted":[],"title_canon_sha256":"0c975e849fdf66dfeea39ec1b95d324c81bc1cf58e6dfe77c24f6362edb5e7bb","abstract_canon_sha256":"49c33e6d97124335789912cb3183061523192989d4d7ae1de54ac2d083b98401"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:36.782846Z","signature_b64":"LhZj/H1U+WsZHzs9Gs7zHRysN+y8OQfXrvOpJeUBv3IiPGxtiCnJBei5oN6dh9VVY08hVWsOmChAch90z9ewCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d22e4222bbb054c332543734ddd52a3daa9966c2608f6e1df2fd42835c6e0cbb","last_reissued_at":"2026-05-18T00:29:36.782230Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:36.782230Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Progress-Space Tradeoffs in Single-Writer Memory Implementations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Damien Imbs, Petr Kuznetsov, Thibault Rieutord","submitted_at":"2017-09-06T16:25:50Z","abstract_excerpt":"Most algorithms designed for shared-memory distributed systems assume the single-writer multi-reader (SWMR) setting where each process is provided with a unique register readable by all. In a system where computation is performed by a bounded number n of processes coming from a very large (possibly unbounded) set of potential participants, the assumption of a SWMR memory is no longer reasonable. If only a bounded number of multi-writer multi-reader (MWMR) registers are provided, we cannot rely on an a priori assignment of processes to registers. In this setting, simulating SWMR memory, or equi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.01879","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.01879","created_at":"2026-05-18T00:29:36.782347+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.01879v2","created_at":"2026-05-18T00:29:36.782347+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.01879","created_at":"2026-05-18T00:29:36.782347+00:00"},{"alias_kind":"pith_short_12","alias_value":"2IXEEIV3WBKM","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"2IXEEIV3WBKMGMSU","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"2IXEEIV3","created_at":"2026-05-18T12:30:55.937587+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/2IXEEIV3WBKMGMSUG42N3VJKHW","json":"https://pith.science/pith/2IXEEIV3WBKMGMSUG42N3VJKHW.json","graph_json":"https://pith.science/api/pith-number/2IXEEIV3WBKMGMSUG42N3VJKHW/graph.json","events_json":"https://pith.science/api/pith-number/2IXEEIV3WBKMGMSUG42N3VJKHW/events.json","paper":"https://pith.science/paper/2IXEEIV3"},"agent_actions":{"view_html":"https://pith.science/pith/2IXEEIV3WBKMGMSUG42N3VJKHW","download_json":"https://pith.science/pith/2IXEEIV3WBKMGMSUG42N3VJKHW.json","view_paper":"https://pith.science/paper/2IXEEIV3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.01879&json=true","fetch_graph":"https://pith.science/api/pith-number/2IXEEIV3WBKMGMSUG42N3VJKHW/graph.json","fetch_events":"https://pith.science/api/pith-number/2IXEEIV3WBKMGMSUG42N3VJKHW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2IXEEIV3WBKMGMSUG42N3VJKHW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2IXEEIV3WBKMGMSUG42N3VJKHW/action/storage_attestation","attest_author":"https://pith.science/pith/2IXEEIV3WBKMGMSUG42N3VJKHW/action/author_attestation","sign_citation":"https://pith.science/pith/2IXEEIV3WBKMGMSUG42N3VJKHW/action/citation_signature","submit_replication":"https://pith.science/pith/2IXEEIV3WBKMGMSUG42N3VJKHW/action/replication_record"}},"created_at":"2026-05-18T00:29:36.782347+00:00","updated_at":"2026-05-18T00:29:36.782347+00:00"}