{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:ZUUOD7TRQJYRT2EMB35RF5AODV","short_pith_number":"pith:ZUUOD7TR","canonical_record":{"source":{"id":"1208.1723","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-08-08T17:51:24Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"9e3261bccff64e2a127dfa676880452dfe4e461e65ad74ee83d14f0ddc4fd660","abstract_canon_sha256":"13bd61b91a3e76272ee10f3d34e2db257320fda8036ef94628e39dede7ae41fa"},"schema_version":"1.0"},"canonical_sha256":"cd28e1fe71827119e88c0efb12f40e1d6c7f391127e96f1d4f6ada5701827155","source":{"kind":"arxiv","id":"1208.1723","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.1723","created_at":"2026-05-18T03:49:10Z"},{"alias_kind":"arxiv_version","alias_value":"1208.1723v1","created_at":"2026-05-18T03:49:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.1723","created_at":"2026-05-18T03:49:10Z"},{"alias_kind":"pith_short_12","alias_value":"ZUUOD7TRQJYR","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"ZUUOD7TRQJYRT2EM","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"ZUUOD7TR","created_at":"2026-05-18T12:27:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:ZUUOD7TRQJYRT2EMB35RF5AODV","target":"record","payload":{"canonical_record":{"source":{"id":"1208.1723","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-08-08T17:51:24Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"9e3261bccff64e2a127dfa676880452dfe4e461e65ad74ee83d14f0ddc4fd660","abstract_canon_sha256":"13bd61b91a3e76272ee10f3d34e2db257320fda8036ef94628e39dede7ae41fa"},"schema_version":"1.0"},"canonical_sha256":"cd28e1fe71827119e88c0efb12f40e1d6c7f391127e96f1d4f6ada5701827155","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:49:10.803149Z","signature_b64":"MGCxXzPpygUsUAwErUe5seWcMKOo3wZfi9Mz/ed7UTFjJleQmZgp8+XpOGggkvEjj9K1IuNz3l2WIdZ6ldzMAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd28e1fe71827119e88c0efb12f40e1d6c7f391127e96f1d4f6ada5701827155","last_reissued_at":"2026-05-18T03:49:10.802433Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:49:10.802433Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1208.1723","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-18T03:49:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8ZjVxkPRIC0Trlkh8bWy1Scu7xzJHRiZ/jbx93SBqjVaOD+zEAxXCqPieOhlAlzb/i2T1KiInuqK7e6Cj6fTAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T12:11:11.283687Z"},"content_sha256":"f58432e42888d84979119b4b9a1670e1a5bc8cd18d53636d92fb77e01eee539c","schema_version":"1.0","event_id":"sha256:f58432e42888d84979119b4b9a1670e1a5bc8cd18d53636d92fb77e01eee539c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:ZUUOD7TRQJYRT2EMB35RF5AODV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"RMR-Efficient Randomized Abortable Mutual Exclusion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Abhijeet Pareek, Philipp Woelfel","submitted_at":"2012-08-08T17:51:24Z","abstract_excerpt":"Recent research on mutual exclusion for shared-memory systems has focused on \"local spin\" algorithms. Performance is measured using the \"remote memory references\" (RMRs) metric. As common in recent literature, we consider a standard asynchronous shared memory model with N processes, which allows atomic read, write and compare-and-swap (short: CAS) operations.\n  In such a model, the asymptotically tight upper and lower bound on the number of RMRs per passage through the Critical Section is Theta(log N) for the optimal deterministic algorithms (see Yang and Anderson,1995, and Attiya, Hendler and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.1723","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-18T03:49:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3uhpTaImXHd73CsSvFmNAv+BzKunoSlDQPyViNqEU/tU83wyS0LDzGu06M0pYhCPk2MwMq8EoYnADmx/9RSQAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T12:11:11.284447Z"},"content_sha256":"c15e62afb491b2fe866ede2922afe308edf702670ff8380badabb25e0c884145","schema_version":"1.0","event_id":"sha256:c15e62afb491b2fe866ede2922afe308edf702670ff8380badabb25e0c884145"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZUUOD7TRQJYRT2EMB35RF5AODV/bundle.json","state_url":"https://pith.science/pith/ZUUOD7TRQJYRT2EMB35RF5AODV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZUUOD7TRQJYRT2EMB35RF5AODV/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-26T12:11:11Z","links":{"resolver":"https://pith.science/pith/ZUUOD7TRQJYRT2EMB35RF5AODV","bundle":"https://pith.science/pith/ZUUOD7TRQJYRT2EMB35RF5AODV/bundle.json","state":"https://pith.science/pith/ZUUOD7TRQJYRT2EMB35RF5AODV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZUUOD7TRQJYRT2EMB35RF5AODV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:ZUUOD7TRQJYRT2EMB35RF5AODV","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":"13bd61b91a3e76272ee10f3d34e2db257320fda8036ef94628e39dede7ae41fa","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-08-08T17:51:24Z","title_canon_sha256":"9e3261bccff64e2a127dfa676880452dfe4e461e65ad74ee83d14f0ddc4fd660"},"schema_version":"1.0","source":{"id":"1208.1723","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.1723","created_at":"2026-05-18T03:49:10Z"},{"alias_kind":"arxiv_version","alias_value":"1208.1723v1","created_at":"2026-05-18T03:49:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.1723","created_at":"2026-05-18T03:49:10Z"},{"alias_kind":"pith_short_12","alias_value":"ZUUOD7TRQJYR","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"ZUUOD7TRQJYRT2EM","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"ZUUOD7TR","created_at":"2026-05-18T12:27:30Z"}],"graph_snapshots":[{"event_id":"sha256:c15e62afb491b2fe866ede2922afe308edf702670ff8380badabb25e0c884145","target":"graph","created_at":"2026-05-18T03:49:10Z","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":"Recent research on mutual exclusion for shared-memory systems has focused on \"local spin\" algorithms. Performance is measured using the \"remote memory references\" (RMRs) metric. As common in recent literature, we consider a standard asynchronous shared memory model with N processes, which allows atomic read, write and compare-and-swap (short: CAS) operations.\n  In such a model, the asymptotically tight upper and lower bound on the number of RMRs per passage through the Critical Section is Theta(log N) for the optimal deterministic algorithms (see Yang and Anderson,1995, and Attiya, Hendler and","authors_text":"Abhijeet Pareek, Philipp Woelfel","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-08-08T17:51:24Z","title":"RMR-Efficient Randomized Abortable Mutual Exclusion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.1723","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:f58432e42888d84979119b4b9a1670e1a5bc8cd18d53636d92fb77e01eee539c","target":"record","created_at":"2026-05-18T03:49:10Z","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":"13bd61b91a3e76272ee10f3d34e2db257320fda8036ef94628e39dede7ae41fa","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-08-08T17:51:24Z","title_canon_sha256":"9e3261bccff64e2a127dfa676880452dfe4e461e65ad74ee83d14f0ddc4fd660"},"schema_version":"1.0","source":{"id":"1208.1723","kind":"arxiv","version":1}},"canonical_sha256":"cd28e1fe71827119e88c0efb12f40e1d6c7f391127e96f1d4f6ada5701827155","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cd28e1fe71827119e88c0efb12f40e1d6c7f391127e96f1d4f6ada5701827155","first_computed_at":"2026-05-18T03:49:10.802433Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:49:10.802433Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MGCxXzPpygUsUAwErUe5seWcMKOo3wZfi9Mz/ed7UTFjJleQmZgp8+XpOGggkvEjj9K1IuNz3l2WIdZ6ldzMAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:49:10.803149Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.1723","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f58432e42888d84979119b4b9a1670e1a5bc8cd18d53636d92fb77e01eee539c","sha256:c15e62afb491b2fe866ede2922afe308edf702670ff8380badabb25e0c884145"],"state_sha256":"7c67393c08f7c86aee9e56c1fb3bb41e331470a6289fe26ab420586d1b14447d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"30ATbQAP1vtvGbJ78IrLV1ZoLHnitVqM3Slrez8W18t6qUap+E3IufwSF/j8ECtglvm+CgQutpezLWUnL+0lCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T12:11:11.288153Z","bundle_sha256":"3a548598c28df4a88adfdec1a150c44ec5736cb88ff8b92c372478f9337e5b50"}}