{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:KKTQLJPUFVE6ICZUA3M26BUS7V","short_pith_number":"pith:KKTQLJPU","canonical_record":{"source":{"id":"1703.05424","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-03-15T23:34:24Z","cross_cats_sorted":[],"title_canon_sha256":"fc38348b7691694a494be501aef5b137751a36d72e5bca2f23ebd7997c5ced22","abstract_canon_sha256":"43c23af0a0ac63ebffa2bed0b66d6b9a1a0d30bde5d76f9815692aa678145b68"},"schema_version":"1.0"},"canonical_sha256":"52a705a5f42d49e40b3406d9af0692fd48dd86d92735bc3baaca328cf6a1f46c","source":{"kind":"arxiv","id":"1703.05424","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.05424","created_at":"2026-05-17T23:44:48Z"},{"alias_kind":"arxiv_version","alias_value":"1703.05424v3","created_at":"2026-05-17T23:44:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.05424","created_at":"2026-05-17T23:44:48Z"},{"alias_kind":"pith_short_12","alias_value":"KKTQLJPUFVE6","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KKTQLJPUFVE6ICZU","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KKTQLJPU","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:KKTQLJPUFVE6ICZUA3M26BUS7V","target":"record","payload":{"canonical_record":{"source":{"id":"1703.05424","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-03-15T23:34:24Z","cross_cats_sorted":[],"title_canon_sha256":"fc38348b7691694a494be501aef5b137751a36d72e5bca2f23ebd7997c5ced22","abstract_canon_sha256":"43c23af0a0ac63ebffa2bed0b66d6b9a1a0d30bde5d76f9815692aa678145b68"},"schema_version":"1.0"},"canonical_sha256":"52a705a5f42d49e40b3406d9af0692fd48dd86d92735bc3baaca328cf6a1f46c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:48.582091Z","signature_b64":"uWu6eFpHECEiSk18ZkjoXSspBvmBBu1ZJEvPdp576O+ch655GdCzD4aK904jFJ0zA2hIxeWbTkNKnfMKPRCFDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52a705a5f42d49e40b3406d9af0692fd48dd86d92735bc3baaca328cf6a1f46c","last_reissued_at":"2026-05-17T23:44:48.581629Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:48.581629Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.05424","source_version":3,"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-17T23:44:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RrUvjVePcdddyLRn9szkASOs1JhTgXS/iXMznJPskvAD9VqHi6JNsqG4mNK5Kzn0L4A+3W59JhrMTeZVPbTUCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T15:59:36.202590Z"},"content_sha256":"2fb165f34a16383e6d2afacf19a6d4355acdc5b2a980703b4131876e8baad4e9","schema_version":"1.0","event_id":"sha256:2fb165f34a16383e6d2afacf19a6d4355acdc5b2a980703b4131876e8baad4e9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:KKTQLJPUFVE6ICZUA3M26BUS7V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Partially Replicated Causally Consistent Shared Memory: Lower Bounds and An Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Nitin H. Vaidya, Zhuolun Xiang","submitted_at":"2017-03-15T23:34:24Z","abstract_excerpt":"The focus of this paper is on causal consistency in a {\\em partially replicated} distributed shared memory (DSM) system that provides the abstraction of shared read/write registers. Maintaining causal consistency in distributed shared memory systems has received significant attention in the past, mostly on {\\em full replication} wherein each replica stores a copy of all the registers in the shared memory. To ensure causal consistency, all causally preceding updates must be performed before an update is performed at any given replica. Therefore, some mechanism for tracking causal dependencies i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.05424","kind":"arxiv","version":3},"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-17T23:44:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3hEoWaM5NINMzbKyx3BpPhxE/CXV3ffWySZkti7ABXtCHHxcjwDJVJRYKrwoyKrsXbkKeGPWVXy5upIxwKzqDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T15:59:36.203160Z"},"content_sha256":"be4c87428ad1b3f3f5986efcff9e040f94e1f9f13ecc42b611c55a44cd305125","schema_version":"1.0","event_id":"sha256:be4c87428ad1b3f3f5986efcff9e040f94e1f9f13ecc42b611c55a44cd305125"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KKTQLJPUFVE6ICZUA3M26BUS7V/bundle.json","state_url":"https://pith.science/pith/KKTQLJPUFVE6ICZUA3M26BUS7V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KKTQLJPUFVE6ICZUA3M26BUS7V/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-07-05T15:59:36Z","links":{"resolver":"https://pith.science/pith/KKTQLJPUFVE6ICZUA3M26BUS7V","bundle":"https://pith.science/pith/KKTQLJPUFVE6ICZUA3M26BUS7V/bundle.json","state":"https://pith.science/pith/KKTQLJPUFVE6ICZUA3M26BUS7V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KKTQLJPUFVE6ICZUA3M26BUS7V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KKTQLJPUFVE6ICZUA3M26BUS7V","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":"43c23af0a0ac63ebffa2bed0b66d6b9a1a0d30bde5d76f9815692aa678145b68","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-03-15T23:34:24Z","title_canon_sha256":"fc38348b7691694a494be501aef5b137751a36d72e5bca2f23ebd7997c5ced22"},"schema_version":"1.0","source":{"id":"1703.05424","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.05424","created_at":"2026-05-17T23:44:48Z"},{"alias_kind":"arxiv_version","alias_value":"1703.05424v3","created_at":"2026-05-17T23:44:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.05424","created_at":"2026-05-17T23:44:48Z"},{"alias_kind":"pith_short_12","alias_value":"KKTQLJPUFVE6","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KKTQLJPUFVE6ICZU","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KKTQLJPU","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:be4c87428ad1b3f3f5986efcff9e040f94e1f9f13ecc42b611c55a44cd305125","target":"graph","created_at":"2026-05-17T23:44:48Z","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":"The focus of this paper is on causal consistency in a {\\em partially replicated} distributed shared memory (DSM) system that provides the abstraction of shared read/write registers. Maintaining causal consistency in distributed shared memory systems has received significant attention in the past, mostly on {\\em full replication} wherein each replica stores a copy of all the registers in the shared memory. To ensure causal consistency, all causally preceding updates must be performed before an update is performed at any given replica. Therefore, some mechanism for tracking causal dependencies i","authors_text":"Nitin H. Vaidya, Zhuolun Xiang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-03-15T23:34:24Z","title":"Partially Replicated Causally Consistent Shared Memory: Lower Bounds and An Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.05424","kind":"arxiv","version":3},"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:2fb165f34a16383e6d2afacf19a6d4355acdc5b2a980703b4131876e8baad4e9","target":"record","created_at":"2026-05-17T23:44:48Z","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":"43c23af0a0ac63ebffa2bed0b66d6b9a1a0d30bde5d76f9815692aa678145b68","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-03-15T23:34:24Z","title_canon_sha256":"fc38348b7691694a494be501aef5b137751a36d72e5bca2f23ebd7997c5ced22"},"schema_version":"1.0","source":{"id":"1703.05424","kind":"arxiv","version":3}},"canonical_sha256":"52a705a5f42d49e40b3406d9af0692fd48dd86d92735bc3baaca328cf6a1f46c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"52a705a5f42d49e40b3406d9af0692fd48dd86d92735bc3baaca328cf6a1f46c","first_computed_at":"2026-05-17T23:44:48.581629Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:48.581629Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uWu6eFpHECEiSk18ZkjoXSspBvmBBu1ZJEvPdp576O+ch655GdCzD4aK904jFJ0zA2hIxeWbTkNKnfMKPRCFDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:48.582091Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.05424","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2fb165f34a16383e6d2afacf19a6d4355acdc5b2a980703b4131876e8baad4e9","sha256:be4c87428ad1b3f3f5986efcff9e040f94e1f9f13ecc42b611c55a44cd305125"],"state_sha256":"b97858628c188435b55cfc90e41b141f949eec84e12cec5af327beb721c9b145"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UQaOIV/Yn0yYoFM8Vwru8ptaOOF8Y7vM++G1TrnzzYrJlkEfVV1TNMudwGolwzqMzMNG+RAJLolhR60ws+FpBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T15:59:36.206141Z","bundle_sha256":"eda5ad7021870278a5d7fe7cc652c087e3f037a9a4248afef9e438e4838ced67"}}