{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:LOHGZTDB3KRW6LVTDKPEDQ2F24","short_pith_number":"pith:LOHGZTDB","schema_version":"1.0","canonical_sha256":"5b8e6ccc61daa36f2eb31a9e41c345d71546b3ab10bdadd0b6805f61beb6be91","source":{"kind":"arxiv","id":"1608.06033","version":1},"attestation_state":"computed","paper":{"title":"Deterministic and Fast Randomized Test-and-Set in Optimal Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"George Giakkoupis, Lisa Higham, Maryam Helmi, Philipp Woelfel","submitted_at":"2016-08-22T02:18:34Z","abstract_excerpt":"The test-and-set object is a fundamental synchronization primitive for shared memory systems. A test-and-set object stores a bit, initialized to 0, and supports one operation, test&set(), which sets the bit's value to 1 and returns its previous value. This paper studies the number of atomic registers required to implement a test-and-set object in the standard asynchronous shared memory model with n processes. The best lower bound is log(n)-1 for obstruction-free (Giakkoupis and Woelfel, 2012) and deadlock-free (Styer and Peterson, 1989) implementations. Recently a deterministic obstruction-fre"},"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":"1608.06033","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-08-22T02:18:34Z","cross_cats_sorted":[],"title_canon_sha256":"fc5b5be7b8131d27f5e8ba0dae8959dde10a605213ea715ba831159212beccd8","abstract_canon_sha256":"e6e18b407e8e97dae32552d79ee9e16619117b271b802f0dfba33564c147f80e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:22.491205Z","signature_b64":"EGDjkBJ67NUW4glmw6p8HHzqj3mZc5loRwH7PVg7j37Hunb2vxSuk+AwjSraQjypNYSoAotp4a8zrxQEtPhdAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b8e6ccc61daa36f2eb31a9e41c345d71546b3ab10bdadd0b6805f61beb6be91","last_reissued_at":"2026-05-18T01:08:22.490556Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:22.490556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deterministic and Fast Randomized Test-and-Set in Optimal Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"George Giakkoupis, Lisa Higham, Maryam Helmi, Philipp Woelfel","submitted_at":"2016-08-22T02:18:34Z","abstract_excerpt":"The test-and-set object is a fundamental synchronization primitive for shared memory systems. A test-and-set object stores a bit, initialized to 0, and supports one operation, test&set(), which sets the bit's value to 1 and returns its previous value. This paper studies the number of atomic registers required to implement a test-and-set object in the standard asynchronous shared memory model with n processes. The best lower bound is log(n)-1 for obstruction-free (Giakkoupis and Woelfel, 2012) and deadlock-free (Styer and Peterson, 1989) implementations. Recently a deterministic obstruction-fre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.06033","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":"1608.06033","created_at":"2026-05-18T01:08:22.490660+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.06033v1","created_at":"2026-05-18T01:08:22.490660+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.06033","created_at":"2026-05-18T01:08:22.490660+00:00"},{"alias_kind":"pith_short_12","alias_value":"LOHGZTDB3KRW","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"LOHGZTDB3KRW6LVT","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"LOHGZTDB","created_at":"2026-05-18T12:30:29.479603+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/LOHGZTDB3KRW6LVTDKPEDQ2F24","json":"https://pith.science/pith/LOHGZTDB3KRW6LVTDKPEDQ2F24.json","graph_json":"https://pith.science/api/pith-number/LOHGZTDB3KRW6LVTDKPEDQ2F24/graph.json","events_json":"https://pith.science/api/pith-number/LOHGZTDB3KRW6LVTDKPEDQ2F24/events.json","paper":"https://pith.science/paper/LOHGZTDB"},"agent_actions":{"view_html":"https://pith.science/pith/LOHGZTDB3KRW6LVTDKPEDQ2F24","download_json":"https://pith.science/pith/LOHGZTDB3KRW6LVTDKPEDQ2F24.json","view_paper":"https://pith.science/paper/LOHGZTDB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.06033&json=true","fetch_graph":"https://pith.science/api/pith-number/LOHGZTDB3KRW6LVTDKPEDQ2F24/graph.json","fetch_events":"https://pith.science/api/pith-number/LOHGZTDB3KRW6LVTDKPEDQ2F24/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LOHGZTDB3KRW6LVTDKPEDQ2F24/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LOHGZTDB3KRW6LVTDKPEDQ2F24/action/storage_attestation","attest_author":"https://pith.science/pith/LOHGZTDB3KRW6LVTDKPEDQ2F24/action/author_attestation","sign_citation":"https://pith.science/pith/LOHGZTDB3KRW6LVTDKPEDQ2F24/action/citation_signature","submit_replication":"https://pith.science/pith/LOHGZTDB3KRW6LVTDKPEDQ2F24/action/replication_record"}},"created_at":"2026-05-18T01:08:22.490660+00:00","updated_at":"2026-05-18T01:08:22.490660+00:00"}