{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:AAS443W5W4EMWOTDGAM26WV5DM","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":"ab851a29e2fd0ec98daff43addcff985f201fe92392c13794f51f229d133b7fd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-04-12T09:59:02Z","title_canon_sha256":"2163190aded9cd3f5db3af1ab9ffe20d71c6da2e49f87f2603573b2528efc6e6"},"schema_version":"1.0","source":{"id":"1404.3272","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.3272","created_at":"2026-05-18T02:52:13Z"},{"alias_kind":"arxiv_version","alias_value":"1404.3272v3","created_at":"2026-05-18T02:52:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3272","created_at":"2026-05-18T02:52:13Z"},{"alias_kind":"pith_short_12","alias_value":"AAS443W5W4EM","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"AAS443W5W4EMWOTD","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"AAS443W5","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:0106affa4986bbfdc4d4ce211a942b20cf7470945beb59d66c82c38f0e063bf6","target":"graph","created_at":"2026-05-18T02:52:13Z","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":"In this paper we present a novel algorithm for concurrent lock-free internal binary search trees (BST) and implement a Set abstract data type (ADT) based on that. We show that in the presented lock-free BST algorithm the amortized step complexity of each set operation - {\\sc Add}, {\\sc Remove} and {\\sc Contains} - is $O(H(n) + c)$, where, $H(n)$ is the height of BST with $n$ number of nodes and $c$ is the contention during the execution. Our algorithm adapts to contention measures according to read-write load. If the situation is read-heavy, the operations avoid helping pending concurrent {\\sc","authors_text":"Bapi Chatterjee, Nhan Nguyen, Philippas Tsigas","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-04-12T09:59:02Z","title":"Efficient Lock-free Binary Search Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3272","kind":"arxiv","version":3},"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:bc9fb2fde5c028215df3b8534a58e8534a65bab7b747fc2ede2951b6831d6349","target":"record","created_at":"2026-05-18T02:52:13Z","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":"ab851a29e2fd0ec98daff43addcff985f201fe92392c13794f51f229d133b7fd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-04-12T09:59:02Z","title_canon_sha256":"2163190aded9cd3f5db3af1ab9ffe20d71c6da2e49f87f2603573b2528efc6e6"},"schema_version":"1.0","source":{"id":"1404.3272","kind":"arxiv","version":3}},"canonical_sha256":"0025ce6eddb708cb3a633019af5abd1b177dee1f184835435fa25e6fdf8950af","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0025ce6eddb708cb3a633019af5abd1b177dee1f184835435fa25e6fdf8950af","first_computed_at":"2026-05-18T02:52:13.888160Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:13.888160Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jbUiyYHEb0r1zLyZ8mCdpCPxpF97s3UeDum30v76Qra8ckPCeJfS7aaTV0thsUyVmUBKEOYWidLs45uVXyfUDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:13.888791Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.3272","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bc9fb2fde5c028215df3b8534a58e8534a65bab7b747fc2ede2951b6831d6349","sha256:0106affa4986bbfdc4d4ce211a942b20cf7470945beb59d66c82c38f0e063bf6"],"state_sha256":"24a0e72015ae9a11a97fb6bf209f7e82e6775e48b65b410471162f141e2ddc33"}