{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:WV25QWHX5L7SHMYVMVWJA3TVML","short_pith_number":"pith:WV25QWHX","schema_version":"1.0","canonical_sha256":"b575d858f7eaff23b315656c906e7562f682a12bdb98e59e551a9fbadb7dc905","source":{"kind":"arxiv","id":"1803.10067","version":2},"attestation_state":"computed","paper":{"title":"Safe Non-blocking Synchronization in Ada 202x","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Bernd Burgstaller, Johann Blieberger","submitted_at":"2018-03-27T13:31:19Z","abstract_excerpt":"The mutual-exclusion property of locks stands in the way to scalability of parallel programs on many-core architectures. Locks do not allow progress guarantees, because a task may fail inside a critical section and keep holding a lock that blocks other tasks from accessing shared data. With non-blocking synchronization, the drawbacks of locks are avoided by synchronizing access to shared data by atomic read-modify-write operations. To incorporate non-blocking synchronization in Ada~202x, programmers must be able to reason about the behavior and performance of tasks in the absence of protected "},"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":"1803.10067","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-03-27T13:31:19Z","cross_cats_sorted":[],"title_canon_sha256":"8d8f06914c8b5fc58c97bce314a53f6cda3ad3e1c2f3bac0c09b6cf325014eca","abstract_canon_sha256":"a1d900fd9754aead7c11df9db1675658dca65ddacfa02de3e6c8899b54e40566"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:58.451695Z","signature_b64":"waAEFXE6rF6Fp8jOZexIJ0h9436NfeC4VaQnuonxytQEucJ2YJ4ZFI3hLY4ltIbOVAB+FMESft+I6jgMiUlaCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b575d858f7eaff23b315656c906e7562f682a12bdb98e59e551a9fbadb7dc905","last_reissued_at":"2026-05-18T00:12:58.451190Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:58.451190Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Safe Non-blocking Synchronization in Ada 202x","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Bernd Burgstaller, Johann Blieberger","submitted_at":"2018-03-27T13:31:19Z","abstract_excerpt":"The mutual-exclusion property of locks stands in the way to scalability of parallel programs on many-core architectures. Locks do not allow progress guarantees, because a task may fail inside a critical section and keep holding a lock that blocks other tasks from accessing shared data. With non-blocking synchronization, the drawbacks of locks are avoided by synchronizing access to shared data by atomic read-modify-write operations. To incorporate non-blocking synchronization in Ada~202x, programmers must be able to reason about the behavior and performance of tasks in the absence of protected "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.10067","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1803.10067","created_at":"2026-05-18T00:12:58.451264+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.10067v2","created_at":"2026-05-18T00:12:58.451264+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.10067","created_at":"2026-05-18T00:12:58.451264+00:00"},{"alias_kind":"pith_short_12","alias_value":"WV25QWHX5L7S","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"WV25QWHX5L7SHMYV","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"WV25QWHX","created_at":"2026-05-18T12:33:01.666342+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/WV25QWHX5L7SHMYVMVWJA3TVML","json":"https://pith.science/pith/WV25QWHX5L7SHMYVMVWJA3TVML.json","graph_json":"https://pith.science/api/pith-number/WV25QWHX5L7SHMYVMVWJA3TVML/graph.json","events_json":"https://pith.science/api/pith-number/WV25QWHX5L7SHMYVMVWJA3TVML/events.json","paper":"https://pith.science/paper/WV25QWHX"},"agent_actions":{"view_html":"https://pith.science/pith/WV25QWHX5L7SHMYVMVWJA3TVML","download_json":"https://pith.science/pith/WV25QWHX5L7SHMYVMVWJA3TVML.json","view_paper":"https://pith.science/paper/WV25QWHX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.10067&json=true","fetch_graph":"https://pith.science/api/pith-number/WV25QWHX5L7SHMYVMVWJA3TVML/graph.json","fetch_events":"https://pith.science/api/pith-number/WV25QWHX5L7SHMYVMVWJA3TVML/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WV25QWHX5L7SHMYVMVWJA3TVML/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WV25QWHX5L7SHMYVMVWJA3TVML/action/storage_attestation","attest_author":"https://pith.science/pith/WV25QWHX5L7SHMYVMVWJA3TVML/action/author_attestation","sign_citation":"https://pith.science/pith/WV25QWHX5L7SHMYVMVWJA3TVML/action/citation_signature","submit_replication":"https://pith.science/pith/WV25QWHX5L7SHMYVMVWJA3TVML/action/replication_record"}},"created_at":"2026-05-18T00:12:58.451264+00:00","updated_at":"2026-05-18T00:12:58.451264+00:00"}