{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:VBPLAJMC5YRM4JMAPF4DGEKDEL","short_pith_number":"pith:VBPLAJMC","canonical_record":{"source":{"id":"1310.7397","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-10-28T12:18:39Z","cross_cats_sorted":[],"title_canon_sha256":"ee5b10a1bdc976022b508b0a30ce4cdddb470f5c212ef498649ce76cec8503f2","abstract_canon_sha256":"ddfc8e3d886d559dd4c2fc5a32e9fb905a247a0b60ce25fa3888d7d4fc292aac"},"schema_version":"1.0"},"canonical_sha256":"a85eb02582ee22ce2580797833114322d5079349ecf144733ebf8f5367c2e2ae","source":{"kind":"arxiv","id":"1310.7397","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.7397","created_at":"2026-05-18T03:08:26Z"},{"alias_kind":"arxiv_version","alias_value":"1310.7397v2","created_at":"2026-05-18T03:08:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.7397","created_at":"2026-05-18T03:08:26Z"},{"alias_kind":"pith_short_12","alias_value":"VBPLAJMC5YRM","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VBPLAJMC5YRM4JMA","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VBPLAJMC","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:VBPLAJMC5YRM4JMAPF4DGEKDEL","target":"record","payload":{"canonical_record":{"source":{"id":"1310.7397","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-10-28T12:18:39Z","cross_cats_sorted":[],"title_canon_sha256":"ee5b10a1bdc976022b508b0a30ce4cdddb470f5c212ef498649ce76cec8503f2","abstract_canon_sha256":"ddfc8e3d886d559dd4c2fc5a32e9fb905a247a0b60ce25fa3888d7d4fc292aac"},"schema_version":"1.0"},"canonical_sha256":"a85eb02582ee22ce2580797833114322d5079349ecf144733ebf8f5367c2e2ae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:08:26.503210Z","signature_b64":"MzlDEdcrW5fYXH30cW3A+5M8/3Am2+N5dJ0OlHhTlgpSOjJa59oGe/umprywQE7vyp68wyMiImS/cHZPxOI4Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a85eb02582ee22ce2580797833114322d5079349ecf144733ebf8f5367c2e2ae","last_reissued_at":"2026-05-18T03:08:26.502442Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:08:26.502442Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.7397","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-18T03:08:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D/Jyh1JVqj9StlER311Mujv5c8dh9GQZJIu/bs/qeXf3Dx602HgTcXUAuEPc0wGHoIERObI05oS20WKTMKkDCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T12:17:10.992454Z"},"content_sha256":"e78cec4e13bb3f28998f32078ed7e3d14f9233c089b6ae3f6aa92129d14daf68","schema_version":"1.0","event_id":"sha256:e78cec4e13bb3f28998f32078ed7e3d14f9233c089b6ae3f6aa92129d14daf68"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:VBPLAJMC5YRM4JMAPF4DGEKDEL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deconstructing Queue-Based Mutual Exclusion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Wojciech Golab","submitted_at":"2013-10-28T12:18:39Z","abstract_excerpt":"We formulate a modular approach to the design and analysis of a particular class of mutual exclusion algorithms for shared memory multiprocessor systems. Specifically, we consider algorithms that organize waiting processes into a queue. Such algorithms can achieve O(1) remote memory reference (RMR) complexity, which minimizes (asymptotically) the amount of traffic through the processor-memory interconnect. We first describe a generic mutual exclusion algorithm that relies on a linearizable implementation of a particular queue-like data structure that we call MutexQueue. Next, we show two imple"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.7397","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-18T03:08:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rI0r+DswtMjNCaJUR7p0L7qgBkTAUUO/2iB4nnwzdcknrwxUi6lE3gYbDb9caNZ2EukVMlZSzGs5vsgZlIqyDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T12:17:10.992842Z"},"content_sha256":"8f8f9773115f24fbfa62822e362b1e318bd82fbaef7a8406d3e700d9b287a12c","schema_version":"1.0","event_id":"sha256:8f8f9773115f24fbfa62822e362b1e318bd82fbaef7a8406d3e700d9b287a12c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VBPLAJMC5YRM4JMAPF4DGEKDEL/bundle.json","state_url":"https://pith.science/pith/VBPLAJMC5YRM4JMAPF4DGEKDEL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VBPLAJMC5YRM4JMAPF4DGEKDEL/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:17:10Z","links":{"resolver":"https://pith.science/pith/VBPLAJMC5YRM4JMAPF4DGEKDEL","bundle":"https://pith.science/pith/VBPLAJMC5YRM4JMAPF4DGEKDEL/bundle.json","state":"https://pith.science/pith/VBPLAJMC5YRM4JMAPF4DGEKDEL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VBPLAJMC5YRM4JMAPF4DGEKDEL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:VBPLAJMC5YRM4JMAPF4DGEKDEL","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":"ddfc8e3d886d559dd4c2fc5a32e9fb905a247a0b60ce25fa3888d7d4fc292aac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-10-28T12:18:39Z","title_canon_sha256":"ee5b10a1bdc976022b508b0a30ce4cdddb470f5c212ef498649ce76cec8503f2"},"schema_version":"1.0","source":{"id":"1310.7397","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.7397","created_at":"2026-05-18T03:08:26Z"},{"alias_kind":"arxiv_version","alias_value":"1310.7397v2","created_at":"2026-05-18T03:08:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.7397","created_at":"2026-05-18T03:08:26Z"},{"alias_kind":"pith_short_12","alias_value":"VBPLAJMC5YRM","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VBPLAJMC5YRM4JMA","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VBPLAJMC","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:8f8f9773115f24fbfa62822e362b1e318bd82fbaef7a8406d3e700d9b287a12c","target":"graph","created_at":"2026-05-18T03:08:26Z","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 formulate a modular approach to the design and analysis of a particular class of mutual exclusion algorithms for shared memory multiprocessor systems. Specifically, we consider algorithms that organize waiting processes into a queue. Such algorithms can achieve O(1) remote memory reference (RMR) complexity, which minimizes (asymptotically) the amount of traffic through the processor-memory interconnect. We first describe a generic mutual exclusion algorithm that relies on a linearizable implementation of a particular queue-like data structure that we call MutexQueue. Next, we show two imple","authors_text":"Wojciech Golab","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-10-28T12:18:39Z","title":"Deconstructing Queue-Based Mutual Exclusion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.7397","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:e78cec4e13bb3f28998f32078ed7e3d14f9233c089b6ae3f6aa92129d14daf68","target":"record","created_at":"2026-05-18T03:08:26Z","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":"ddfc8e3d886d559dd4c2fc5a32e9fb905a247a0b60ce25fa3888d7d4fc292aac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-10-28T12:18:39Z","title_canon_sha256":"ee5b10a1bdc976022b508b0a30ce4cdddb470f5c212ef498649ce76cec8503f2"},"schema_version":"1.0","source":{"id":"1310.7397","kind":"arxiv","version":2}},"canonical_sha256":"a85eb02582ee22ce2580797833114322d5079349ecf144733ebf8f5367c2e2ae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a85eb02582ee22ce2580797833114322d5079349ecf144733ebf8f5367c2e2ae","first_computed_at":"2026-05-18T03:08:26.502442Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:08:26.502442Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MzlDEdcrW5fYXH30cW3A+5M8/3Am2+N5dJ0OlHhTlgpSOjJa59oGe/umprywQE7vyp68wyMiImS/cHZPxOI4Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:08:26.503210Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.7397","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e78cec4e13bb3f28998f32078ed7e3d14f9233c089b6ae3f6aa92129d14daf68","sha256:8f8f9773115f24fbfa62822e362b1e318bd82fbaef7a8406d3e700d9b287a12c"],"state_sha256":"fd91289ccaef5a8a8f18703a9dd8617ed389dcd14d6c5939ad17163b06e60e2a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Le1lCgxf0KVskBa/9JjnqDXzuClolO2wsx3YG/5mYxgVkYN/ib0dxxZwrII3fLU1Hvp5C9/QUMo0KRt3pUUqCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T12:17:10.996031Z","bundle_sha256":"23ceba0faef12249a0023442bffb63975831c8d0882beae40d83e5d90181ec7a"}}