{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:N7VOQVDMTGCGB7FSM2S76E7ALU","short_pith_number":"pith:N7VOQVDM","schema_version":"1.0","canonical_sha256":"6feae8546c998460fcb266a5ff13e05d1c72278e0dd021bec442b3723a0b4e43","source":{"kind":"arxiv","id":"1805.04779","version":1},"attestation_state":"computed","paper":{"title":"Persistent Non-Blocking Binary Search Trees Supporting Wait-Free Range Queries","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Eric Ruppert, Panagiota Fatourou","submitted_at":"2018-05-12T20:58:12Z","abstract_excerpt":"This paper presents the first implementation of a search tree data structure in an asynchronous shared-memory system that provides a wait-free algorithm for executing range queries on the tree, in addition to non-blocking algorithms for Insert, Delete and Find, using single-word Compare-and-Swap (CAS). The implementation is linearizable and tolerates any number of crash failures. Insert and Delete operations that operate on different parts of the tree run fully in parallel (without any interference with one another). We employ a lightweight helping mechanism, where each Insert, Delete and Find"},"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.04779","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DC","submitted_at":"2018-05-12T20:58:12Z","cross_cats_sorted":[],"title_canon_sha256":"ffa00a898d83ddae4309715607da6f4a66da5d1bedd79bffa3db816dd026ef5d","abstract_canon_sha256":"5351196f21cc716f13d0158c0c5ee03b07ae173cff1e0110a2ed6ed52ef49f44"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:04.603529Z","signature_b64":"Az3TnBwmKk+WyRTswxJveFEmxS+JhgBVrB26vId3YgJm79DIQUvbmbePGU7HsbBHLN+pC1KR1X7u4JdB2pkYDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6feae8546c998460fcb266a5ff13e05d1c72278e0dd021bec442b3723a0b4e43","last_reissued_at":"2026-05-18T00:16:04.603109Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:04.603109Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Persistent Non-Blocking Binary Search Trees Supporting Wait-Free Range Queries","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Eric Ruppert, Panagiota Fatourou","submitted_at":"2018-05-12T20:58:12Z","abstract_excerpt":"This paper presents the first implementation of a search tree data structure in an asynchronous shared-memory system that provides a wait-free algorithm for executing range queries on the tree, in addition to non-blocking algorithms for Insert, Delete and Find, using single-word Compare-and-Swap (CAS). The implementation is linearizable and tolerates any number of crash failures. Insert and Delete operations that operate on different parts of the tree run fully in parallel (without any interference with one another). We employ a lightweight helping mechanism, where each Insert, Delete and Find"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.04779","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.04779","created_at":"2026-05-18T00:16:04.603179+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.04779v1","created_at":"2026-05-18T00:16:04.603179+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.04779","created_at":"2026-05-18T00:16:04.603179+00:00"},{"alias_kind":"pith_short_12","alias_value":"N7VOQVDMTGCG","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"N7VOQVDMTGCGB7FS","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"N7VOQVDM","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/N7VOQVDMTGCGB7FSM2S76E7ALU","json":"https://pith.science/pith/N7VOQVDMTGCGB7FSM2S76E7ALU.json","graph_json":"https://pith.science/api/pith-number/N7VOQVDMTGCGB7FSM2S76E7ALU/graph.json","events_json":"https://pith.science/api/pith-number/N7VOQVDMTGCGB7FSM2S76E7ALU/events.json","paper":"https://pith.science/paper/N7VOQVDM"},"agent_actions":{"view_html":"https://pith.science/pith/N7VOQVDMTGCGB7FSM2S76E7ALU","download_json":"https://pith.science/pith/N7VOQVDMTGCGB7FSM2S76E7ALU.json","view_paper":"https://pith.science/paper/N7VOQVDM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.04779&json=true","fetch_graph":"https://pith.science/api/pith-number/N7VOQVDMTGCGB7FSM2S76E7ALU/graph.json","fetch_events":"https://pith.science/api/pith-number/N7VOQVDMTGCGB7FSM2S76E7ALU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N7VOQVDMTGCGB7FSM2S76E7ALU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N7VOQVDMTGCGB7FSM2S76E7ALU/action/storage_attestation","attest_author":"https://pith.science/pith/N7VOQVDMTGCGB7FSM2S76E7ALU/action/author_attestation","sign_citation":"https://pith.science/pith/N7VOQVDMTGCGB7FSM2S76E7ALU/action/citation_signature","submit_replication":"https://pith.science/pith/N7VOQVDMTGCGB7FSM2S76E7ALU/action/replication_record"}},"created_at":"2026-05-18T00:16:04.603179+00:00","updated_at":"2026-05-18T00:16:04.603179+00:00"}