{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:7GY5TL7C5RKMB2Y52WPGLZCUO2","short_pith_number":"pith:7GY5TL7C","schema_version":"1.0","canonical_sha256":"f9b1d9afe2ec54c0eb1dd59e65e45476ad345a0b23101895d22ea4623275a858","source":{"kind":"arxiv","id":"1311.3200","version":2},"attestation_state":"computed","paper":{"title":"Are Lock-Free Concurrent Algorithms Practically Wait-Free?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Dan Alistarh, Keren Censor-Hillel, Nir Shavit","submitted_at":"2013-11-13T16:39:40Z","abstract_excerpt":"Lock-free concurrent algorithms guarantee that some concurrent operation will always make progress in a finite number of steps. Yet programmers prefer to treat concurrent code as if it were wait-free, guaranteeing that all operations always make progress. Unfortunately, designing wait-free algorithms is generally a very complex task, and the resulting algorithms are not always efficient. While obtaining efficient wait-free algorithms has been a long-time goal for the theory community, most non-blocking commercial code is only lock-free.\n  This paper suggests a simple solution to this problem. "},"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":"1311.3200","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-11-13T16:39:40Z","cross_cats_sorted":[],"title_canon_sha256":"0eba1ff9ba8c28f433f8b9a72aabbe38e0bf2399ef762eaaab5a07e79a3edb1d","abstract_canon_sha256":"c1367c77505e186ba0e6e6e12c351f432e1b76363291d9d729e89f0f9f1073d2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:07:03.394520Z","signature_b64":"Uz0WElgnv5Db9/waOYj+Zz3WwwthtO8G1Gc33Jw5P8f4L/t5MUMgHV6ePljQHrH9lO5R9XG6ZzGm6Vz0tndPAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f9b1d9afe2ec54c0eb1dd59e65e45476ad345a0b23101895d22ea4623275a858","last_reissued_at":"2026-05-18T03:07:03.393874Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:07:03.393874Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Are Lock-Free Concurrent Algorithms Practically Wait-Free?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Dan Alistarh, Keren Censor-Hillel, Nir Shavit","submitted_at":"2013-11-13T16:39:40Z","abstract_excerpt":"Lock-free concurrent algorithms guarantee that some concurrent operation will always make progress in a finite number of steps. Yet programmers prefer to treat concurrent code as if it were wait-free, guaranteeing that all operations always make progress. Unfortunately, designing wait-free algorithms is generally a very complex task, and the resulting algorithms are not always efficient. While obtaining efficient wait-free algorithms has been a long-time goal for the theory community, most non-blocking commercial code is only lock-free.\n  This paper suggests a simple solution to this problem. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.3200","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":"1311.3200","created_at":"2026-05-18T03:07:03.393952+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.3200v2","created_at":"2026-05-18T03:07:03.393952+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.3200","created_at":"2026-05-18T03:07:03.393952+00:00"},{"alias_kind":"pith_short_12","alias_value":"7GY5TL7C5RKM","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_16","alias_value":"7GY5TL7C5RKMB2Y5","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_8","alias_value":"7GY5TL7C","created_at":"2026-05-18T12:27:36.564083+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2001.04235","citing_title":"Notes on Theory of Distributed Systems","ref_index":26,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7GY5TL7C5RKMB2Y52WPGLZCUO2","json":"https://pith.science/pith/7GY5TL7C5RKMB2Y52WPGLZCUO2.json","graph_json":"https://pith.science/api/pith-number/7GY5TL7C5RKMB2Y52WPGLZCUO2/graph.json","events_json":"https://pith.science/api/pith-number/7GY5TL7C5RKMB2Y52WPGLZCUO2/events.json","paper":"https://pith.science/paper/7GY5TL7C"},"agent_actions":{"view_html":"https://pith.science/pith/7GY5TL7C5RKMB2Y52WPGLZCUO2","download_json":"https://pith.science/pith/7GY5TL7C5RKMB2Y52WPGLZCUO2.json","view_paper":"https://pith.science/paper/7GY5TL7C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.3200&json=true","fetch_graph":"https://pith.science/api/pith-number/7GY5TL7C5RKMB2Y52WPGLZCUO2/graph.json","fetch_events":"https://pith.science/api/pith-number/7GY5TL7C5RKMB2Y52WPGLZCUO2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7GY5TL7C5RKMB2Y52WPGLZCUO2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7GY5TL7C5RKMB2Y52WPGLZCUO2/action/storage_attestation","attest_author":"https://pith.science/pith/7GY5TL7C5RKMB2Y52WPGLZCUO2/action/author_attestation","sign_citation":"https://pith.science/pith/7GY5TL7C5RKMB2Y52WPGLZCUO2/action/citation_signature","submit_replication":"https://pith.science/pith/7GY5TL7C5RKMB2Y52WPGLZCUO2/action/replication_record"}},"created_at":"2026-05-18T03:07:03.393952+00:00","updated_at":"2026-05-18T03:07:03.393952+00:00"}