{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:WXCIRD2HMMXKX4Y7IP7T646DZX","short_pith_number":"pith:WXCIRD2H","schema_version":"1.0","canonical_sha256":"b5c4888f47632eabf31f43ff3f73c3cdc4c943a6e52acb901371aa1358065748","source":{"kind":"arxiv","id":"1702.04441","version":3},"attestation_state":"computed","paper":{"title":"A Concurrency-Optimal Binary Search Tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Anna Malova, Petr Kuznetsov, Srivatsan Ravi, Vincent Gramoli, Vitaly Aksenov","submitted_at":"2017-02-15T02:10:34Z","abstract_excerpt":"The paper presents the first \\emph{concurrency-optimal} implementation of a binary search tree (BST). The implementation, based on a standard sequential implementation of an internal tree, ensures that every \\emph{schedule} is accepted, i.e., interleaving of steps of the sequential code, unless linearizability is violated. To ensure this property, we use a novel read-write locking scheme that protects tree \\emph{edges} in addition to nodes.\n  Our implementation outperforms the state-of-the art BSTs on most basic workloads, which suggests that optimizing the set of accepted schedules of the seq"},"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":"1702.04441","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-02-15T02:10:34Z","cross_cats_sorted":[],"title_canon_sha256":"6848051cc0aa25e6036a7a8a56e297dd0616583d06267d209e2d6a96d84c8641","abstract_canon_sha256":"ff9da789c5f25401d221ca665ffacceeae7ffe76733d77b7a1d3e520e00fbc1b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:41.706769Z","signature_b64":"MLopmAUr78UTre8YhafDH+9ZLoBnCx9Omw88F5nbUav+vjcOyD2Dwb3rukTDgc/D0kofya3LO6tWa/4OL1mPDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5c4888f47632eabf31f43ff3f73c3cdc4c943a6e52acb901371aa1358065748","last_reissued_at":"2026-05-18T00:49:41.706265Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:41.706265Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Concurrency-Optimal Binary Search Tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Anna Malova, Petr Kuznetsov, Srivatsan Ravi, Vincent Gramoli, Vitaly Aksenov","submitted_at":"2017-02-15T02:10:34Z","abstract_excerpt":"The paper presents the first \\emph{concurrency-optimal} implementation of a binary search tree (BST). The implementation, based on a standard sequential implementation of an internal tree, ensures that every \\emph{schedule} is accepted, i.e., interleaving of steps of the sequential code, unless linearizability is violated. To ensure this property, we use a novel read-write locking scheme that protects tree \\emph{edges} in addition to nodes.\n  Our implementation outperforms the state-of-the art BSTs on most basic workloads, which suggests that optimizing the set of accepted schedules of the seq"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.04441","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":"1702.04441","created_at":"2026-05-18T00:49:41.706339+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.04441v3","created_at":"2026-05-18T00:49:41.706339+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.04441","created_at":"2026-05-18T00:49:41.706339+00:00"},{"alias_kind":"pith_short_12","alias_value":"WXCIRD2HMMXK","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"WXCIRD2HMMXKX4Y7","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"WXCIRD2H","created_at":"2026-05-18T12:31:53.515858+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/WXCIRD2HMMXKX4Y7IP7T646DZX","json":"https://pith.science/pith/WXCIRD2HMMXKX4Y7IP7T646DZX.json","graph_json":"https://pith.science/api/pith-number/WXCIRD2HMMXKX4Y7IP7T646DZX/graph.json","events_json":"https://pith.science/api/pith-number/WXCIRD2HMMXKX4Y7IP7T646DZX/events.json","paper":"https://pith.science/paper/WXCIRD2H"},"agent_actions":{"view_html":"https://pith.science/pith/WXCIRD2HMMXKX4Y7IP7T646DZX","download_json":"https://pith.science/pith/WXCIRD2HMMXKX4Y7IP7T646DZX.json","view_paper":"https://pith.science/paper/WXCIRD2H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.04441&json=true","fetch_graph":"https://pith.science/api/pith-number/WXCIRD2HMMXKX4Y7IP7T646DZX/graph.json","fetch_events":"https://pith.science/api/pith-number/WXCIRD2HMMXKX4Y7IP7T646DZX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WXCIRD2HMMXKX4Y7IP7T646DZX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WXCIRD2HMMXKX4Y7IP7T646DZX/action/storage_attestation","attest_author":"https://pith.science/pith/WXCIRD2HMMXKX4Y7IP7T646DZX/action/author_attestation","sign_citation":"https://pith.science/pith/WXCIRD2HMMXKX4Y7IP7T646DZX/action/citation_signature","submit_replication":"https://pith.science/pith/WXCIRD2HMMXKX4Y7IP7T646DZX/action/replication_record"}},"created_at":"2026-05-18T00:49:41.706339+00:00","updated_at":"2026-05-18T00:49:41.706339+00:00"}