{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:MXM4MT2I75LKCYGICSKQQRN4OJ","short_pith_number":"pith:MXM4MT2I","canonical_record":{"source":{"id":"1805.04840","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-13T08:13:05Z","cross_cats_sorted":[],"title_canon_sha256":"ee7ba33bc6defc8ef4bf71526b70f080623384bd26f5812df80475e73c00277c","abstract_canon_sha256":"f1695bb90ad7457613f4c2be0325e567aa1833027701690a284c0476652a1dd3"},"schema_version":"1.0"},"canonical_sha256":"65d9c64f48ff56a160c814950845bc72642182484298b09d9dc981a81a24fa69","source":{"kind":"arxiv","id":"1805.04840","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.04840","created_at":"2026-05-18T00:16:04Z"},{"alias_kind":"arxiv_version","alias_value":"1805.04840v1","created_at":"2026-05-18T00:16:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.04840","created_at":"2026-05-18T00:16:04Z"},{"alias_kind":"pith_short_12","alias_value":"MXM4MT2I75LK","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"MXM4MT2I75LKCYGI","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"MXM4MT2I","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:MXM4MT2I75LKCYGICSKQQRN4OJ","target":"record","payload":{"canonical_record":{"source":{"id":"1805.04840","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-13T08:13:05Z","cross_cats_sorted":[],"title_canon_sha256":"ee7ba33bc6defc8ef4bf71526b70f080623384bd26f5812df80475e73c00277c","abstract_canon_sha256":"f1695bb90ad7457613f4c2be0325e567aa1833027701690a284c0476652a1dd3"},"schema_version":"1.0"},"canonical_sha256":"65d9c64f48ff56a160c814950845bc72642182484298b09d9dc981a81a24fa69","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:04.460834Z","signature_b64":"tw78twV4wkoGBrbCvBNQDOUitcTunS8pP7HLBlZhHrwFKz4fNa3KSCCEV8X+GoCvLxbyB1m6rTe3rIQ/41zlBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65d9c64f48ff56a160c814950845bc72642182484298b09d9dc981a81a24fa69","last_reissued_at":"2026-05-18T00:16:04.460502Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:04.460502Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.04840","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-18T00:16:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0wU87R8VyqQqmCgLKSMbFqXNWuVal4T7ExeuFFXbWY2QIZ6aD454pPbqn3ezNf/P6nJ+B6YMGPiMbiB89cH9Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T09:09:35.257952Z"},"content_sha256":"ca069d47240d9c6a59431b755914017b248bc80bab031ec5a697fef2e208be3f","schema_version":"1.0","event_id":"sha256:ca069d47240d9c6a59431b755914017b248bc80bab031ec5a697fef2e208be3f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:MXM4MT2I75LKCYGICSKQQRN4OJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Almost Tight RMR Lower Bound for Abortable Test-And-Set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Aryaz Eghbali, Philipp Woelfel","submitted_at":"2018-05-13T08:13:05Z","abstract_excerpt":"We prove a lower bound of Omega(log n/loglog n) for the remote memory reference (RMR) complexity of abortable test-and-set (leader election) in the cache-coherent (CC) and the distributed shared memory (DSM) model.\n  This separates the complexities of abortable and non-abortable test-and-set, as the latter has constant RMR complexity (Golab, Hendler, Woelfel, SIAM Journal of Computing Vol. 39, 2010).\n  Golab, Hendler, Hadzilacos and Woelfel (Distributed Computing Vol. 25, 2012) showed that compare-and-swap can be implemented from registers and TAS objects with constant RMR complexity.\n  We obs"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.04840","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-18T00:16:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j2/wtcIhkEZ7yJPI5PhcnRlwdKFggSEt1QcjkAl1WK1KQIQUzKSJAMI2nlgucjAYQDCtCzaPZ2uumfrq7w9WAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T09:09:35.258295Z"},"content_sha256":"c8cb7490353b00edfcd56d584facc67cb5d24e3b73e0b829c600d26bd7e1297e","schema_version":"1.0","event_id":"sha256:c8cb7490353b00edfcd56d584facc67cb5d24e3b73e0b829c600d26bd7e1297e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MXM4MT2I75LKCYGICSKQQRN4OJ/bundle.json","state_url":"https://pith.science/pith/MXM4MT2I75LKCYGICSKQQRN4OJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MXM4MT2I75LKCYGICSKQQRN4OJ/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-26T09:09:35Z","links":{"resolver":"https://pith.science/pith/MXM4MT2I75LKCYGICSKQQRN4OJ","bundle":"https://pith.science/pith/MXM4MT2I75LKCYGICSKQQRN4OJ/bundle.json","state":"https://pith.science/pith/MXM4MT2I75LKCYGICSKQQRN4OJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MXM4MT2I75LKCYGICSKQQRN4OJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:MXM4MT2I75LKCYGICSKQQRN4OJ","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":"f1695bb90ad7457613f4c2be0325e567aa1833027701690a284c0476652a1dd3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-13T08:13:05Z","title_canon_sha256":"ee7ba33bc6defc8ef4bf71526b70f080623384bd26f5812df80475e73c00277c"},"schema_version":"1.0","source":{"id":"1805.04840","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.04840","created_at":"2026-05-18T00:16:04Z"},{"alias_kind":"arxiv_version","alias_value":"1805.04840v1","created_at":"2026-05-18T00:16:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.04840","created_at":"2026-05-18T00:16:04Z"},{"alias_kind":"pith_short_12","alias_value":"MXM4MT2I75LK","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"MXM4MT2I75LKCYGI","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"MXM4MT2I","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:c8cb7490353b00edfcd56d584facc67cb5d24e3b73e0b829c600d26bd7e1297e","target":"graph","created_at":"2026-05-18T00:16:04Z","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 prove a lower bound of Omega(log n/loglog n) for the remote memory reference (RMR) complexity of abortable test-and-set (leader election) in the cache-coherent (CC) and the distributed shared memory (DSM) model.\n  This separates the complexities of abortable and non-abortable test-and-set, as the latter has constant RMR complexity (Golab, Hendler, Woelfel, SIAM Journal of Computing Vol. 39, 2010).\n  Golab, Hendler, Hadzilacos and Woelfel (Distributed Computing Vol. 25, 2012) showed that compare-and-swap can be implemented from registers and TAS objects with constant RMR complexity.\n  We obs","authors_text":"Aryaz Eghbali, Philipp Woelfel","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-13T08:13:05Z","title":"An Almost Tight RMR Lower Bound for Abortable Test-And-Set"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.04840","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:ca069d47240d9c6a59431b755914017b248bc80bab031ec5a697fef2e208be3f","target":"record","created_at":"2026-05-18T00:16:04Z","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":"f1695bb90ad7457613f4c2be0325e567aa1833027701690a284c0476652a1dd3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-13T08:13:05Z","title_canon_sha256":"ee7ba33bc6defc8ef4bf71526b70f080623384bd26f5812df80475e73c00277c"},"schema_version":"1.0","source":{"id":"1805.04840","kind":"arxiv","version":1}},"canonical_sha256":"65d9c64f48ff56a160c814950845bc72642182484298b09d9dc981a81a24fa69","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"65d9c64f48ff56a160c814950845bc72642182484298b09d9dc981a81a24fa69","first_computed_at":"2026-05-18T00:16:04.460502Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:04.460502Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tw78twV4wkoGBrbCvBNQDOUitcTunS8pP7HLBlZhHrwFKz4fNa3KSCCEV8X+GoCvLxbyB1m6rTe3rIQ/41zlBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:04.460834Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.04840","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ca069d47240d9c6a59431b755914017b248bc80bab031ec5a697fef2e208be3f","sha256:c8cb7490353b00edfcd56d584facc67cb5d24e3b73e0b829c600d26bd7e1297e"],"state_sha256":"f9ba213190e2b448a599c1476f9636c42382ea2672cd1d22b80ff3a0e0536879"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0TPVpquy/1FJmwg/gHKXJt+FkqJnRhCye1nQ0iJ+YBgzXu3JMvubX7H9XsKxPbQKJrcFqSQ2iUy+koc/O1ixCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T09:09:35.260229Z","bundle_sha256":"2c30b9690f3ca8874431117339d217f0c6e8264a7452b677419c93b59ee1d3d1"}}