{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:GTKUOOUZPI6BNTTPMRJSEADXYN","short_pith_number":"pith:GTKUOOUZ","canonical_record":{"source":{"id":"1607.05596","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-07-19T14:22:50Z","cross_cats_sorted":[],"title_canon_sha256":"bad721eacf1ce249638cf017c6576b37c4d1e18496a026422b4fae827705c80b","abstract_canon_sha256":"58bdb5a75aa4cdfd05ef0c8f55ccbb974c9339e3e0a342ad62f75d67e276577a"},"schema_version":"1.0"},"canonical_sha256":"34d5473a997a3c16ce6f6453220077c35e5e266a5375c4ad1aa1f85c9138e884","source":{"kind":"arxiv","id":"1607.05596","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.05596","created_at":"2026-05-18T01:10:16Z"},{"alias_kind":"arxiv_version","alias_value":"1607.05596v4","created_at":"2026-05-18T01:10:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.05596","created_at":"2026-05-18T01:10:16Z"},{"alias_kind":"pith_short_12","alias_value":"GTKUOOUZPI6B","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GTKUOOUZPI6BNTTP","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GTKUOOUZ","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:GTKUOOUZPI6BNTTPMRJSEADXYN","target":"record","payload":{"canonical_record":{"source":{"id":"1607.05596","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-07-19T14:22:50Z","cross_cats_sorted":[],"title_canon_sha256":"bad721eacf1ce249638cf017c6576b37c4d1e18496a026422b4fae827705c80b","abstract_canon_sha256":"58bdb5a75aa4cdfd05ef0c8f55ccbb974c9339e3e0a342ad62f75d67e276577a"},"schema_version":"1.0"},"canonical_sha256":"34d5473a997a3c16ce6f6453220077c35e5e266a5375c4ad1aa1f85c9138e884","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:16.272125Z","signature_b64":"6HrFIchCmqarOrNVB0Qomosg+CmTfED9XrW3hKnISl3DEWvC9QO21bJEI35YnmgXCXTLvleMyVfxtY1lYwYNAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34d5473a997a3c16ce6f6453220077c35e5e266a5375c4ad1aa1f85c9138e884","last_reissued_at":"2026-05-18T01:10:16.271679Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:16.271679Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.05596","source_version":4,"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:10:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FRh8Nes9m99S/pMc/CCfmEQGHkuMxT7eeB6x/4C+XxcVra+sCkRLdUrbD13l/fEeSRk9LX6LlfqiRbVOLI22BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T16:09:48.007226Z"},"content_sha256":"2f218395c42b953b4fa447ffe7a1aa6749d2c40bb8f5fa94a4c3f89cb7774ea8","schema_version":"1.0","event_id":"sha256:2f218395c42b953b4fa447ffe7a1aa6749d2c40bb8f5fa94a4c3f89cb7774ea8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:GTKUOOUZPI6BNTTPMRJSEADXYN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Composition and Implementation of Sequential Consistency (Extended Version)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Achour Mostefaoui (GDD), Claude Jard, Matoula Petrolia, Matthieu Perrin","submitted_at":"2016-07-19T14:22:50Z","abstract_excerpt":"It has been proved that to implement a linearizable shared memory in synchronous message-passing systems it is necessary to wait for a time proportional to the uncertainty in the latency of the network for both read and write operations, while waiting during read or during write operations is sufficient for sequential consistency. This paper extends this result to crash-prone asynchronous systems. We propose a distributed algorithm that builds a sequentially consistent shared memory abstraction with snapshot on top of an asynchronous message-passing system where less than half of the processes"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.05596","kind":"arxiv","version":4},"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:10:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZmIHjny8U9rVtJw4hgzFRoINx1yJvG5hjxPzBNQM4Rllrgdgw2i4ghncfnqXpmLBIbcuHqBrCUZRWf6oIpKOCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T16:09:48.007585Z"},"content_sha256":"b8626ff7ec9194782b950169179a73ee6776c35db522ef2531904a2f1b739465","schema_version":"1.0","event_id":"sha256:b8626ff7ec9194782b950169179a73ee6776c35db522ef2531904a2f1b739465"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GTKUOOUZPI6BNTTPMRJSEADXYN/bundle.json","state_url":"https://pith.science/pith/GTKUOOUZPI6BNTTPMRJSEADXYN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GTKUOOUZPI6BNTTPMRJSEADXYN/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-06-24T16:09:48Z","links":{"resolver":"https://pith.science/pith/GTKUOOUZPI6BNTTPMRJSEADXYN","bundle":"https://pith.science/pith/GTKUOOUZPI6BNTTPMRJSEADXYN/bundle.json","state":"https://pith.science/pith/GTKUOOUZPI6BNTTPMRJSEADXYN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GTKUOOUZPI6BNTTPMRJSEADXYN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:GTKUOOUZPI6BNTTPMRJSEADXYN","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":"58bdb5a75aa4cdfd05ef0c8f55ccbb974c9339e3e0a342ad62f75d67e276577a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-07-19T14:22:50Z","title_canon_sha256":"bad721eacf1ce249638cf017c6576b37c4d1e18496a026422b4fae827705c80b"},"schema_version":"1.0","source":{"id":"1607.05596","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.05596","created_at":"2026-05-18T01:10:16Z"},{"alias_kind":"arxiv_version","alias_value":"1607.05596v4","created_at":"2026-05-18T01:10:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.05596","created_at":"2026-05-18T01:10:16Z"},{"alias_kind":"pith_short_12","alias_value":"GTKUOOUZPI6B","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GTKUOOUZPI6BNTTP","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GTKUOOUZ","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:b8626ff7ec9194782b950169179a73ee6776c35db522ef2531904a2f1b739465","target":"graph","created_at":"2026-05-18T01:10:16Z","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":"It has been proved that to implement a linearizable shared memory in synchronous message-passing systems it is necessary to wait for a time proportional to the uncertainty in the latency of the network for both read and write operations, while waiting during read or during write operations is sufficient for sequential consistency. This paper extends this result to crash-prone asynchronous systems. We propose a distributed algorithm that builds a sequentially consistent shared memory abstraction with snapshot on top of an asynchronous message-passing system where less than half of the processes","authors_text":"Achour Mostefaoui (GDD), Claude Jard, Matoula Petrolia, Matthieu Perrin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-07-19T14:22:50Z","title":"On Composition and Implementation of Sequential Consistency (Extended Version)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.05596","kind":"arxiv","version":4},"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:2f218395c42b953b4fa447ffe7a1aa6749d2c40bb8f5fa94a4c3f89cb7774ea8","target":"record","created_at":"2026-05-18T01:10:16Z","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":"58bdb5a75aa4cdfd05ef0c8f55ccbb974c9339e3e0a342ad62f75d67e276577a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-07-19T14:22:50Z","title_canon_sha256":"bad721eacf1ce249638cf017c6576b37c4d1e18496a026422b4fae827705c80b"},"schema_version":"1.0","source":{"id":"1607.05596","kind":"arxiv","version":4}},"canonical_sha256":"34d5473a997a3c16ce6f6453220077c35e5e266a5375c4ad1aa1f85c9138e884","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"34d5473a997a3c16ce6f6453220077c35e5e266a5375c4ad1aa1f85c9138e884","first_computed_at":"2026-05-18T01:10:16.271679Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:16.271679Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6HrFIchCmqarOrNVB0Qomosg+CmTfED9XrW3hKnISl3DEWvC9QO21bJEI35YnmgXCXTLvleMyVfxtY1lYwYNAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:16.272125Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.05596","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2f218395c42b953b4fa447ffe7a1aa6749d2c40bb8f5fa94a4c3f89cb7774ea8","sha256:b8626ff7ec9194782b950169179a73ee6776c35db522ef2531904a2f1b739465"],"state_sha256":"5979fa6aa7dfaefddf3aa12daf32f11a216744526453b27182120f46086833f6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0FUJzuNFR4fFgRwH1CM2SqwqD5wkt6f/Jfm5JIKhlMJ/+TFutyJ0Qmb06mwABcooQdFl9GYexgS0EFMA4g15CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T16:09:48.009441Z","bundle_sha256":"0a35ae8ae02fe5615b6464a80ae0ebb5380fd8c17675841eb4c7bef18661e67c"}}