{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:AAS443W5W4EMWOTDGAM26WV5DM","short_pith_number":"pith:AAS443W5","schema_version":"1.0","canonical_sha256":"0025ce6eddb708cb3a633019af5abd1b177dee1f184835435fa25e6fdf8950af","source":{"kind":"arxiv","id":"1404.3272","version":3},"attestation_state":"computed","paper":{"title":"Efficient Lock-free Binary Search Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Bapi Chatterjee, Nhan Nguyen, Philippas Tsigas","submitted_at":"2014-04-12T09:59:02Z","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"},"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":"1404.3272","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-04-12T09:59:02Z","cross_cats_sorted":[],"title_canon_sha256":"2163190aded9cd3f5db3af1ab9ffe20d71c6da2e49f87f2603573b2528efc6e6","abstract_canon_sha256":"ab851a29e2fd0ec98daff43addcff985f201fe92392c13794f51f229d133b7fd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:13.888791Z","signature_b64":"jbUiyYHEb0r1zLyZ8mCdpCPxpF97s3UeDum30v76Qra8ckPCeJfS7aaTV0thsUyVmUBKEOYWidLs45uVXyfUDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0025ce6eddb708cb3a633019af5abd1b177dee1f184835435fa25e6fdf8950af","last_reissued_at":"2026-05-18T02:52:13.888160Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:13.888160Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Lock-free Binary Search Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Bapi Chatterjee, Nhan Nguyen, Philippas Tsigas","submitted_at":"2014-04-12T09:59:02Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3272","kind":"arxiv","version":3},"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":"1404.3272","created_at":"2026-05-18T02:52:13.888255+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.3272v3","created_at":"2026-05-18T02:52:13.888255+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3272","created_at":"2026-05-18T02:52:13.888255+00:00"},{"alias_kind":"pith_short_12","alias_value":"AAS443W5W4EM","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"AAS443W5W4EMWOTD","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"AAS443W5","created_at":"2026-05-18T12:28:19.803747+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/AAS443W5W4EMWOTDGAM26WV5DM","json":"https://pith.science/pith/AAS443W5W4EMWOTDGAM26WV5DM.json","graph_json":"https://pith.science/api/pith-number/AAS443W5W4EMWOTDGAM26WV5DM/graph.json","events_json":"https://pith.science/api/pith-number/AAS443W5W4EMWOTDGAM26WV5DM/events.json","paper":"https://pith.science/paper/AAS443W5"},"agent_actions":{"view_html":"https://pith.science/pith/AAS443W5W4EMWOTDGAM26WV5DM","download_json":"https://pith.science/pith/AAS443W5W4EMWOTDGAM26WV5DM.json","view_paper":"https://pith.science/paper/AAS443W5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.3272&json=true","fetch_graph":"https://pith.science/api/pith-number/AAS443W5W4EMWOTDGAM26WV5DM/graph.json","fetch_events":"https://pith.science/api/pith-number/AAS443W5W4EMWOTDGAM26WV5DM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AAS443W5W4EMWOTDGAM26WV5DM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AAS443W5W4EMWOTDGAM26WV5DM/action/storage_attestation","attest_author":"https://pith.science/pith/AAS443W5W4EMWOTDGAM26WV5DM/action/author_attestation","sign_citation":"https://pith.science/pith/AAS443W5W4EMWOTDGAM26WV5DM/action/citation_signature","submit_replication":"https://pith.science/pith/AAS443W5W4EMWOTDGAM26WV5DM/action/replication_record"}},"created_at":"2026-05-18T02:52:13.888255+00:00","updated_at":"2026-05-18T02:52:13.888255+00:00"}