{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:MXM4MT2I75LKCYGICSKQQRN4OJ","short_pith_number":"pith:MXM4MT2I","schema_version":"1.0","canonical_sha256":"65d9c64f48ff56a160c814950845bc72642182484298b09d9dc981a81a24fa69","source":{"kind":"arxiv","id":"1805.04840","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1805.04840","created_at":"2026-05-18T00:16:04.460553+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.04840v1","created_at":"2026-05-18T00:16:04.460553+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.04840","created_at":"2026-05-18T00:16:04.460553+00:00"},{"alias_kind":"pith_short_12","alias_value":"MXM4MT2I75LK","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"MXM4MT2I75LKCYGI","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"MXM4MT2I","created_at":"2026-05-18T12:32:40.477152+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MXM4MT2I75LKCYGICSKQQRN4OJ","json":"https://pith.science/pith/MXM4MT2I75LKCYGICSKQQRN4OJ.json","graph_json":"https://pith.science/api/pith-number/MXM4MT2I75LKCYGICSKQQRN4OJ/graph.json","events_json":"https://pith.science/api/pith-number/MXM4MT2I75LKCYGICSKQQRN4OJ/events.json","paper":"https://pith.science/paper/MXM4MT2I"},"agent_actions":{"view_html":"https://pith.science/pith/MXM4MT2I75LKCYGICSKQQRN4OJ","download_json":"https://pith.science/pith/MXM4MT2I75LKCYGICSKQQRN4OJ.json","view_paper":"https://pith.science/paper/MXM4MT2I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.04840&json=true","fetch_graph":"https://pith.science/api/pith-number/MXM4MT2I75LKCYGICSKQQRN4OJ/graph.json","fetch_events":"https://pith.science/api/pith-number/MXM4MT2I75LKCYGICSKQQRN4OJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MXM4MT2I75LKCYGICSKQQRN4OJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MXM4MT2I75LKCYGICSKQQRN4OJ/action/storage_attestation","attest_author":"https://pith.science/pith/MXM4MT2I75LKCYGICSKQQRN4OJ/action/author_attestation","sign_citation":"https://pith.science/pith/MXM4MT2I75LKCYGICSKQQRN4OJ/action/citation_signature","submit_replication":"https://pith.science/pith/MXM4MT2I75LKCYGICSKQQRN4OJ/action/replication_record"}},"created_at":"2026-05-18T00:16:04.460553+00:00","updated_at":"2026-05-18T00:16:04.460553+00:00"}