{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:WXCIRD2HMMXKX4Y7IP7T646DZX","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":"ff9da789c5f25401d221ca665ffacceeae7ffe76733d77b7a1d3e520e00fbc1b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-02-15T02:10:34Z","title_canon_sha256":"6848051cc0aa25e6036a7a8a56e297dd0616583d06267d209e2d6a96d84c8641"},"schema_version":"1.0","source":{"id":"1702.04441","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.04441","created_at":"2026-05-18T00:49:41Z"},{"alias_kind":"arxiv_version","alias_value":"1702.04441v3","created_at":"2026-05-18T00:49:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.04441","created_at":"2026-05-18T00:49:41Z"},{"alias_kind":"pith_short_12","alias_value":"WXCIRD2HMMXK","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WXCIRD2HMMXKX4Y7","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WXCIRD2H","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:62f8aaa8f08cb6f40c71dd31781613d9ff47192ac4576418973f91db838a2bcb","target":"graph","created_at":"2026-05-18T00:49:41Z","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":"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","authors_text":"Anna Malova, Petr Kuznetsov, Srivatsan Ravi, Vincent Gramoli, Vitaly Aksenov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-02-15T02:10:34Z","title":"A Concurrency-Optimal Binary Search Tree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.04441","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:ecff1a13f1ae9f11ed7aa7ee6d84bc062cf1dec12e808cc66f362872f185859e","target":"record","created_at":"2026-05-18T00:49:41Z","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":"ff9da789c5f25401d221ca665ffacceeae7ffe76733d77b7a1d3e520e00fbc1b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-02-15T02:10:34Z","title_canon_sha256":"6848051cc0aa25e6036a7a8a56e297dd0616583d06267d209e2d6a96d84c8641"},"schema_version":"1.0","source":{"id":"1702.04441","kind":"arxiv","version":3}},"canonical_sha256":"b5c4888f47632eabf31f43ff3f73c3cdc4c943a6e52acb901371aa1358065748","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b5c4888f47632eabf31f43ff3f73c3cdc4c943a6e52acb901371aa1358065748","first_computed_at":"2026-05-18T00:49:41.706265Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:41.706265Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MLopmAUr78UTre8YhafDH+9ZLoBnCx9Omw88F5nbUav+vjcOyD2Dwb3rukTDgc/D0kofya3LO6tWa/4OL1mPDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:41.706769Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.04441","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ecff1a13f1ae9f11ed7aa7ee6d84bc062cf1dec12e808cc66f362872f185859e","sha256:62f8aaa8f08cb6f40c71dd31781613d9ff47192ac4576418973f91db838a2bcb"],"state_sha256":"bad97e6592a6d530b71b603740ef79893e6300ced24270d4fb876f654df3ea73"}