{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:7GY5TL7C5RKMB2Y52WPGLZCUO2","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":"c1367c77505e186ba0e6e6e12c351f432e1b76363291d9d729e89f0f9f1073d2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-11-13T16:39:40Z","title_canon_sha256":"0eba1ff9ba8c28f433f8b9a72aabbe38e0bf2399ef762eaaab5a07e79a3edb1d"},"schema_version":"1.0","source":{"id":"1311.3200","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.3200","created_at":"2026-05-18T03:07:03Z"},{"alias_kind":"arxiv_version","alias_value":"1311.3200v2","created_at":"2026-05-18T03:07:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.3200","created_at":"2026-05-18T03:07:03Z"},{"alias_kind":"pith_short_12","alias_value":"7GY5TL7C5RKM","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"7GY5TL7C5RKMB2Y5","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"7GY5TL7C","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:129e715c79feedc6adddcc130a931c1b1a8e7aca172c08d1aa06e9c6d229acae","target":"graph","created_at":"2026-05-18T03:07:03Z","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":"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. ","authors_text":"Dan Alistarh, Keren Censor-Hillel, Nir Shavit","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-11-13T16:39:40Z","title":"Are Lock-Free Concurrent Algorithms Practically Wait-Free?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.3200","kind":"arxiv","version":2},"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:59f03442ed2394e8339675d640a3a4b56c8d8b97db7869db14dcf8f19c990521","target":"record","created_at":"2026-05-18T03:07:03Z","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":"c1367c77505e186ba0e6e6e12c351f432e1b76363291d9d729e89f0f9f1073d2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-11-13T16:39:40Z","title_canon_sha256":"0eba1ff9ba8c28f433f8b9a72aabbe38e0bf2399ef762eaaab5a07e79a3edb1d"},"schema_version":"1.0","source":{"id":"1311.3200","kind":"arxiv","version":2}},"canonical_sha256":"f9b1d9afe2ec54c0eb1dd59e65e45476ad345a0b23101895d22ea4623275a858","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f9b1d9afe2ec54c0eb1dd59e65e45476ad345a0b23101895d22ea4623275a858","first_computed_at":"2026-05-18T03:07:03.393874Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:07:03.393874Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Uz0WElgnv5Db9/waOYj+Zz3WwwthtO8G1Gc33Jw5P8f4L/t5MUMgHV6ePljQHrH9lO5R9XG6ZzGm6Vz0tndPAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:07:03.394520Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.3200","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:59f03442ed2394e8339675d640a3a4b56c8d8b97db7869db14dcf8f19c990521","sha256:129e715c79feedc6adddcc130a931c1b1a8e7aca172c08d1aa06e9c6d229acae"],"state_sha256":"590d5791ce5c973ca48023e028150dc016ef4ca480b4f387df93d818518585db"}