{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:CUAV5ISCVFT2R3Y23ZOVKPRFTH","short_pith_number":"pith:CUAV5ISC","schema_version":"1.0","canonical_sha256":"15015ea242a967a8ef1ade5d553e2599f4ef523fcaa480345dbc4fff970acdf8","source":{"kind":"arxiv","id":"1503.03105","version":2},"attestation_state":"computed","paper":{"title":"Self-Adjusting Binary Search Trees: What Makes Them Tick?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Kurt Mehlhorn, Laszlo Kozma, Mayank Goswami, Parinya Chalermsook, Thatchaphol Saranurak","submitted_at":"2015-03-10T21:46:34Z","abstract_excerpt":"Splay trees (Sleator and Tarjan) satisfy the so-called access lemma. Many of the nice properties of splay trees follow from it. What makes self-adjusting binary search trees (BSTs) satisfy the access lemma? After each access, self-adjusting BSTs replace the search path by a tree on the same set of nodes (the after-tree). We identify two simple combinatorial properties of the search path and the after-tree that imply the access lemma. Our main result (i) implies the access lemma for all minimally self-adjusting BST algorithms for which it was known to hold: splay trees and their generalization "},"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":"1503.03105","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-10T21:46:34Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"7cad58372393c557511d3069b2d5dd65e90c17a70f77fc3db228afc123b68028","abstract_canon_sha256":"bcaa026070c36d45758f84c541ec51a7e32d9dee0f4820f7eab8bd5710840b15"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:04.849498Z","signature_b64":"PbuuCJxiuoC8EiIBWIY5sfSK1wmQsiM+DofwBuGTMy0GzDmGFsWT3NZ/FJRV1sMp5zrO75hI+jd3yXoqf6chDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15015ea242a967a8ef1ade5d553e2599f4ef523fcaa480345dbc4fff970acdf8","last_reissued_at":"2026-05-18T01:35:04.848836Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:04.848836Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Self-Adjusting Binary Search Trees: What Makes Them Tick?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Kurt Mehlhorn, Laszlo Kozma, Mayank Goswami, Parinya Chalermsook, Thatchaphol Saranurak","submitted_at":"2015-03-10T21:46:34Z","abstract_excerpt":"Splay trees (Sleator and Tarjan) satisfy the so-called access lemma. Many of the nice properties of splay trees follow from it. What makes self-adjusting binary search trees (BSTs) satisfy the access lemma? After each access, self-adjusting BSTs replace the search path by a tree on the same set of nodes (the after-tree). We identify two simple combinatorial properties of the search path and the after-tree that imply the access lemma. Our main result (i) implies the access lemma for all minimally self-adjusting BST algorithms for which it was known to hold: splay trees and their generalization "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.03105","kind":"arxiv","version":2},"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":"1503.03105","created_at":"2026-05-18T01:35:04.848940+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.03105v2","created_at":"2026-05-18T01:35:04.848940+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.03105","created_at":"2026-05-18T01:35:04.848940+00:00"},{"alias_kind":"pith_short_12","alias_value":"CUAV5ISCVFT2","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"CUAV5ISCVFT2R3Y2","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"CUAV5ISC","created_at":"2026-05-18T12:29:17.054201+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/CUAV5ISCVFT2R3Y23ZOVKPRFTH","json":"https://pith.science/pith/CUAV5ISCVFT2R3Y23ZOVKPRFTH.json","graph_json":"https://pith.science/api/pith-number/CUAV5ISCVFT2R3Y23ZOVKPRFTH/graph.json","events_json":"https://pith.science/api/pith-number/CUAV5ISCVFT2R3Y23ZOVKPRFTH/events.json","paper":"https://pith.science/paper/CUAV5ISC"},"agent_actions":{"view_html":"https://pith.science/pith/CUAV5ISCVFT2R3Y23ZOVKPRFTH","download_json":"https://pith.science/pith/CUAV5ISCVFT2R3Y23ZOVKPRFTH.json","view_paper":"https://pith.science/paper/CUAV5ISC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.03105&json=true","fetch_graph":"https://pith.science/api/pith-number/CUAV5ISCVFT2R3Y23ZOVKPRFTH/graph.json","fetch_events":"https://pith.science/api/pith-number/CUAV5ISCVFT2R3Y23ZOVKPRFTH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CUAV5ISCVFT2R3Y23ZOVKPRFTH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CUAV5ISCVFT2R3Y23ZOVKPRFTH/action/storage_attestation","attest_author":"https://pith.science/pith/CUAV5ISCVFT2R3Y23ZOVKPRFTH/action/author_attestation","sign_citation":"https://pith.science/pith/CUAV5ISCVFT2R3Y23ZOVKPRFTH/action/citation_signature","submit_replication":"https://pith.science/pith/CUAV5ISCVFT2R3Y23ZOVKPRFTH/action/replication_record"}},"created_at":"2026-05-18T01:35:04.848940+00:00","updated_at":"2026-05-18T01:35:04.848940+00:00"}