{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ILGVJCTZJHIT6AH576AW223FIM","short_pith_number":"pith:ILGVJCTZ","canonical_record":{"source":{"id":"1607.06258","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-07-21T10:44:49Z","cross_cats_sorted":[],"title_canon_sha256":"b421869a38e2e11374a2ac3eef3e17f1408778c7f53a992db6d52ec5a06b5824","abstract_canon_sha256":"e32f9ae57c13a7d703aca86d0c3f71502e081ffece3722229bd0f6f4f1a01751"},"schema_version":"1.0"},"canonical_sha256":"42cd548a7949d13f00fdff816d6b65430743d9507a911101590b43f748af1a4f","source":{"kind":"arxiv","id":"1607.06258","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.06258","created_at":"2026-05-18T01:10:23Z"},{"alias_kind":"arxiv_version","alias_value":"1607.06258v2","created_at":"2026-05-18T01:10:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.06258","created_at":"2026-05-18T01:10:23Z"},{"alias_kind":"pith_short_12","alias_value":"ILGVJCTZJHIT","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"ILGVJCTZJHIT6AH5","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"ILGVJCTZ","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ILGVJCTZJHIT6AH576AW223FIM","target":"record","payload":{"canonical_record":{"source":{"id":"1607.06258","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-07-21T10:44:49Z","cross_cats_sorted":[],"title_canon_sha256":"b421869a38e2e11374a2ac3eef3e17f1408778c7f53a992db6d52ec5a06b5824","abstract_canon_sha256":"e32f9ae57c13a7d703aca86d0c3f71502e081ffece3722229bd0f6f4f1a01751"},"schema_version":"1.0"},"canonical_sha256":"42cd548a7949d13f00fdff816d6b65430743d9507a911101590b43f748af1a4f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:23.108965Z","signature_b64":"USlfk39h5jIzcRnmiV3olHFAi3pUPONyN8WZpMXEO4bqnwhlwaFrLwHxUxDs8FEp7AWqe26OIMRixxdjcInpBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"42cd548a7949d13f00fdff816d6b65430743d9507a911101590b43f748af1a4f","last_reissued_at":"2026-05-18T01:10:23.108517Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:23.108517Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.06258","source_version":2,"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:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FatqIjIYVQ3avQriRqJ6cTIhsBcrYIqdzczo61Q6j9SmV/8RShbyqXJGiuBfe9julXQ1/j5tpm7lyncWp1nJBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T16:09:20.939006Z"},"content_sha256":"c21fa218d7b405d4f6a335864d490c496142b3f4924a30a94587732cb0edb043","schema_version":"1.0","event_id":"sha256:c21fa218d7b405d4f6a335864d490c496142b3f4924a30a94587732cb0edb043"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ILGVJCTZJHIT6AH576AW223FIM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Composition and Implementation of Sequential Consistency","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-21T10:44:49Z","abstract_excerpt":"To implement a linearizable shared memory in synchronous message-passing systems it is necessary to wait for a time linear to the uncertainty in the latency of the network for both read and write operations. Waiting only for one of them suffices for sequential consistency. This paper extends this result to crash-prone asynchronous systems, proposing a distributed algorithm building a sequentially consistent shared snapshot memory on top of an asynchronous message-passing system where less than half of the processes may crash. We prove that waiting is needed only when a process invokes a read/s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.06258","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"},"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:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HEgF9hMUCFk4jE9AdPVdAiCtb00h8BtsxIWlpudENV34R1TrV8ghZ7UHb+uwuZjlp0BKaQizNEFRh/umPnHSAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T16:09:20.939366Z"},"content_sha256":"7c6eb9287f81f144412a10646599618e33cd429acd5e153719717bed32ccae54","schema_version":"1.0","event_id":"sha256:7c6eb9287f81f144412a10646599618e33cd429acd5e153719717bed32ccae54"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ILGVJCTZJHIT6AH576AW223FIM/bundle.json","state_url":"https://pith.science/pith/ILGVJCTZJHIT6AH576AW223FIM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ILGVJCTZJHIT6AH576AW223FIM/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:20Z","links":{"resolver":"https://pith.science/pith/ILGVJCTZJHIT6AH576AW223FIM","bundle":"https://pith.science/pith/ILGVJCTZJHIT6AH576AW223FIM/bundle.json","state":"https://pith.science/pith/ILGVJCTZJHIT6AH576AW223FIM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ILGVJCTZJHIT6AH576AW223FIM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ILGVJCTZJHIT6AH576AW223FIM","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":"e32f9ae57c13a7d703aca86d0c3f71502e081ffece3722229bd0f6f4f1a01751","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-07-21T10:44:49Z","title_canon_sha256":"b421869a38e2e11374a2ac3eef3e17f1408778c7f53a992db6d52ec5a06b5824"},"schema_version":"1.0","source":{"id":"1607.06258","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.06258","created_at":"2026-05-18T01:10:23Z"},{"alias_kind":"arxiv_version","alias_value":"1607.06258v2","created_at":"2026-05-18T01:10:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.06258","created_at":"2026-05-18T01:10:23Z"},{"alias_kind":"pith_short_12","alias_value":"ILGVJCTZJHIT","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"ILGVJCTZJHIT6AH5","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"ILGVJCTZ","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:7c6eb9287f81f144412a10646599618e33cd429acd5e153719717bed32ccae54","target":"graph","created_at":"2026-05-18T01:10:23Z","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":"To implement a linearizable shared memory in synchronous message-passing systems it is necessary to wait for a time linear to the uncertainty in the latency of the network for both read and write operations. Waiting only for one of them suffices for sequential consistency. This paper extends this result to crash-prone asynchronous systems, proposing a distributed algorithm building a sequentially consistent shared snapshot memory on top of an asynchronous message-passing system where less than half of the processes may crash. We prove that waiting is needed only when a process invokes a read/s","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-21T10:44:49Z","title":"On Composition and Implementation of Sequential Consistency"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.06258","kind":"arxiv","version":2},"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:c21fa218d7b405d4f6a335864d490c496142b3f4924a30a94587732cb0edb043","target":"record","created_at":"2026-05-18T01:10:23Z","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":"e32f9ae57c13a7d703aca86d0c3f71502e081ffece3722229bd0f6f4f1a01751","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-07-21T10:44:49Z","title_canon_sha256":"b421869a38e2e11374a2ac3eef3e17f1408778c7f53a992db6d52ec5a06b5824"},"schema_version":"1.0","source":{"id":"1607.06258","kind":"arxiv","version":2}},"canonical_sha256":"42cd548a7949d13f00fdff816d6b65430743d9507a911101590b43f748af1a4f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"42cd548a7949d13f00fdff816d6b65430743d9507a911101590b43f748af1a4f","first_computed_at":"2026-05-18T01:10:23.108517Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:23.108517Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"USlfk39h5jIzcRnmiV3olHFAi3pUPONyN8WZpMXEO4bqnwhlwaFrLwHxUxDs8FEp7AWqe26OIMRixxdjcInpBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:23.108965Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.06258","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c21fa218d7b405d4f6a335864d490c496142b3f4924a30a94587732cb0edb043","sha256:7c6eb9287f81f144412a10646599618e33cd429acd5e153719717bed32ccae54"],"state_sha256":"e9e2c87ca1b9f292fcbe16e06db44c358d661bef932267d73501e411975963aa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v2xzeM/FUwz5TXd8M+c38vYdZv3I9fNWByyi0ft2KT30RhvhPNRL7yGT5OsKyc6BpYH3ynUbVTiHkwL0DGRWDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T16:09:20.941371Z","bundle_sha256":"7e238b3d1ccf8d62d2165671682d497a2c17e0b701cf27edb8824ed4691f7c60"}}