{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:IA2DOXXXSBP2D2SD4SAMNS4X53","short_pith_number":"pith:IA2DOXXX","canonical_record":{"source":{"id":"1109.5153","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-09-23T18:39:18Z","cross_cats_sorted":[],"title_canon_sha256":"cefd5d98a1909291f03232f44093136de5356144e8e9f700978e766b4577ead7","abstract_canon_sha256":"8ecb71cd08c2bd5d59e0ef6d1cb4c6b3122bc9129b977caae1138e9a0323666c"},"schema_version":"1.0"},"canonical_sha256":"4034375ef7905fa1ea43e480c6cb97eef8800f2225e8d2a3abdd4f19b36c0d0f","source":{"kind":"arxiv","id":"1109.5153","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.5153","created_at":"2026-05-18T04:12:21Z"},{"alias_kind":"arxiv_version","alias_value":"1109.5153v1","created_at":"2026-05-18T04:12:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.5153","created_at":"2026-05-18T04:12:21Z"},{"alias_kind":"pith_short_12","alias_value":"IA2DOXXXSBP2","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"IA2DOXXXSBP2D2SD","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"IA2DOXXX","created_at":"2026-05-18T12:26:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:IA2DOXXXSBP2D2SD4SAMNS4X53","target":"record","payload":{"canonical_record":{"source":{"id":"1109.5153","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-09-23T18:39:18Z","cross_cats_sorted":[],"title_canon_sha256":"cefd5d98a1909291f03232f44093136de5356144e8e9f700978e766b4577ead7","abstract_canon_sha256":"8ecb71cd08c2bd5d59e0ef6d1cb4c6b3122bc9129b977caae1138e9a0323666c"},"schema_version":"1.0"},"canonical_sha256":"4034375ef7905fa1ea43e480c6cb97eef8800f2225e8d2a3abdd4f19b36c0d0f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:12:21.590957Z","signature_b64":"GpDnddhLxgG/5bCn0d2kOmrxNvubIOC2kfxv8Rw5NfAa+NZlOJ+XfJEBSLOnw5t4HS2X53rauhhUVYMc6B8pBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4034375ef7905fa1ea43e480c6cb97eef8800f2225e8d2a3abdd4f19b36c0d0f","last_reissued_at":"2026-05-18T04:12:21.590357Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:12:21.590357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.5153","source_version":1,"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-18T04:12:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r13muLItYwb8ATCHlisKumLijK1+XR9d3ndoqSU9EzzZFQHeF0pPqaExe88yuh43oOpG/uNOgzVPIj2AfoEPDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T12:41:33.209524Z"},"content_sha256":"72de656dde648f26aece7ba1913cf6c94781f74144f8ca05a2f13240de8c048d","schema_version":"1.0","event_id":"sha256:72de656dde648f26aece7ba1913cf6c94781f74144f8ca05a2f13240de8c048d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:IA2DOXXXSBP2D2SD4SAMNS4X53","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Complexity Separation Between the Cache-Coherent and Distributed Shared Memory Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Wojciech Golab","submitted_at":"2011-09-23T18:39:18Z","abstract_excerpt":"We consider asynchronous multiprocessor systems where processes communicate by accessing shared memory. Exchange of information among processes in such a multiprocessor necessitates costly memory accesses called \\emph{remote memory references} (RMRs), which generate communication on the interconnect joining processors and main memory. In this paper we compare two popular shared memory architecture models, namely the \\emph{cache-coherent} (CC) and \\emph{distributed shared memory} (DSM) models, in terms of their power for solving synchronization problems efficiently with respect to RMRs. The par"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.5153","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"},"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-18T04:12:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1AlfV8guPvV83Q+WlZGv7tX1t46T9pU/A1zkkLFUz7vinEgn/1h5kVh8nh0IeIZh0D2fRkxm6XPbnLX+UgPJCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T12:41:33.209913Z"},"content_sha256":"8983f1870e348b4bdef594bffb80509f3482ede46f3d29bb0edc16b27a3c4424","schema_version":"1.0","event_id":"sha256:8983f1870e348b4bdef594bffb80509f3482ede46f3d29bb0edc16b27a3c4424"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IA2DOXXXSBP2D2SD4SAMNS4X53/bundle.json","state_url":"https://pith.science/pith/IA2DOXXXSBP2D2SD4SAMNS4X53/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IA2DOXXXSBP2D2SD4SAMNS4X53/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-03T12:41:33Z","links":{"resolver":"https://pith.science/pith/IA2DOXXXSBP2D2SD4SAMNS4X53","bundle":"https://pith.science/pith/IA2DOXXXSBP2D2SD4SAMNS4X53/bundle.json","state":"https://pith.science/pith/IA2DOXXXSBP2D2SD4SAMNS4X53/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IA2DOXXXSBP2D2SD4SAMNS4X53/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:IA2DOXXXSBP2D2SD4SAMNS4X53","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":"8ecb71cd08c2bd5d59e0ef6d1cb4c6b3122bc9129b977caae1138e9a0323666c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-09-23T18:39:18Z","title_canon_sha256":"cefd5d98a1909291f03232f44093136de5356144e8e9f700978e766b4577ead7"},"schema_version":"1.0","source":{"id":"1109.5153","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.5153","created_at":"2026-05-18T04:12:21Z"},{"alias_kind":"arxiv_version","alias_value":"1109.5153v1","created_at":"2026-05-18T04:12:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.5153","created_at":"2026-05-18T04:12:21Z"},{"alias_kind":"pith_short_12","alias_value":"IA2DOXXXSBP2","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"IA2DOXXXSBP2D2SD","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"IA2DOXXX","created_at":"2026-05-18T12:26:30Z"}],"graph_snapshots":[{"event_id":"sha256:8983f1870e348b4bdef594bffb80509f3482ede46f3d29bb0edc16b27a3c4424","target":"graph","created_at":"2026-05-18T04:12:21Z","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":"We consider asynchronous multiprocessor systems where processes communicate by accessing shared memory. Exchange of information among processes in such a multiprocessor necessitates costly memory accesses called \\emph{remote memory references} (RMRs), which generate communication on the interconnect joining processors and main memory. In this paper we compare two popular shared memory architecture models, namely the \\emph{cache-coherent} (CC) and \\emph{distributed shared memory} (DSM) models, in terms of their power for solving synchronization problems efficiently with respect to RMRs. The par","authors_text":"Wojciech Golab","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-09-23T18:39:18Z","title":"A Complexity Separation Between the Cache-Coherent and Distributed Shared Memory Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.5153","kind":"arxiv","version":1},"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:72de656dde648f26aece7ba1913cf6c94781f74144f8ca05a2f13240de8c048d","target":"record","created_at":"2026-05-18T04:12:21Z","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":"8ecb71cd08c2bd5d59e0ef6d1cb4c6b3122bc9129b977caae1138e9a0323666c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-09-23T18:39:18Z","title_canon_sha256":"cefd5d98a1909291f03232f44093136de5356144e8e9f700978e766b4577ead7"},"schema_version":"1.0","source":{"id":"1109.5153","kind":"arxiv","version":1}},"canonical_sha256":"4034375ef7905fa1ea43e480c6cb97eef8800f2225e8d2a3abdd4f19b36c0d0f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4034375ef7905fa1ea43e480c6cb97eef8800f2225e8d2a3abdd4f19b36c0d0f","first_computed_at":"2026-05-18T04:12:21.590357Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:12:21.590357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GpDnddhLxgG/5bCn0d2kOmrxNvubIOC2kfxv8Rw5NfAa+NZlOJ+XfJEBSLOnw5t4HS2X53rauhhUVYMc6B8pBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:12:21.590957Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.5153","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:72de656dde648f26aece7ba1913cf6c94781f74144f8ca05a2f13240de8c048d","sha256:8983f1870e348b4bdef594bffb80509f3482ede46f3d29bb0edc16b27a3c4424"],"state_sha256":"fb1f01c243bb0d084df85a154be89cc6de243c65732bd8d22cada2928e8e16d6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CXJDIZvbVm6GVMgilRBxRXoItTSPzh017BzUK7X/UBppCh4UbpzEs/dPza/Dsw03zBdyhmFhP1cCPys6aS7TCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T12:41:33.211940Z","bundle_sha256":"9375631cbfb813ab3d13013ea86a3b735f07242c8327e200fcb2594c4a66789d"}}