{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:WXCIRD2HMMXKX4Y7IP7T646DZX","short_pith_number":"pith:WXCIRD2H","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"},"canonical_sha256":"b5c4888f47632eabf31f43ff3f73c3cdc4c943a6e52acb901371aa1358065748","source":{"kind":"arxiv","id":"1702.04441","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:WXCIRD2HMMXKX4Y7IP7T646DZX","target":"record","payload":{"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"},"canonical_sha256":"b5c4888f47632eabf31f43ff3f73c3cdc4c943a6e52acb901371aa1358065748","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"},"source_kind":"arxiv","source_id":"1702.04441","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:49:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J5FSAKk3wRvhzi8arn8EP+D2BunF/uf3KUqNt/Wicby17ORq4cR4oOgs6CPLnWD4DUniTHBlgnrexiK4aHFdCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:42:47.226095Z"},"content_sha256":"ecff1a13f1ae9f11ed7aa7ee6d84bc062cf1dec12e808cc66f362872f185859e","schema_version":"1.0","event_id":"sha256:ecff1a13f1ae9f11ed7aa7ee6d84bc062cf1dec12e808cc66f362872f185859e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:WXCIRD2HMMXKX4Y7IP7T646DZX","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:49:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GC338wBYT+NwJhxZPAj6nlkrmTcjQuMa/pC6UDXuuYT3fXRX2Q1IGOoHNz8cfBtT+ac7YuQVX0mdjNipVS1/AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:42:47.226447Z"},"content_sha256":"62f8aaa8f08cb6f40c71dd31781613d9ff47192ac4576418973f91db838a2bcb","schema_version":"1.0","event_id":"sha256:62f8aaa8f08cb6f40c71dd31781613d9ff47192ac4576418973f91db838a2bcb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WXCIRD2HMMXKX4Y7IP7T646DZX/bundle.json","state_url":"https://pith.science/pith/WXCIRD2HMMXKX4Y7IP7T646DZX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WXCIRD2HMMXKX4Y7IP7T646DZX/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-03T07:42:47Z","links":{"resolver":"https://pith.science/pith/WXCIRD2HMMXKX4Y7IP7T646DZX","bundle":"https://pith.science/pith/WXCIRD2HMMXKX4Y7IP7T646DZX/bundle.json","state":"https://pith.science/pith/WXCIRD2HMMXKX4Y7IP7T646DZX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WXCIRD2HMMXKX4Y7IP7T646DZX/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wqI4Y/GyRq1rYn93HSeBZnyxXBqv6l3aeUfMXQUlAIlFjHac0Qa8sYcWuune5Bhy/rTLwQKf2TYtbB/85O2SBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T07:42:47.228329Z","bundle_sha256":"3530ebb016228bf6d8ae7a73ee5f184f87c34a01bc472c88314203bfd078f277"}}