{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:IPH7O46X6VJV2AOUZJ4FILDJAZ","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":"e4b88a401c457cd912f177ae482b6fb1eb7731332a80f1fb86fa31b56de99fb9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-27T14:27:02Z","title_canon_sha256":"357369b2bf22f9e60418b983436d0d1459c32abb5ac465a961676bd62099a8ee"},"schema_version":"1.0","source":{"id":"1806.10498","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.10498","created_at":"2026-05-18T00:12:12Z"},{"alias_kind":"arxiv_version","alias_value":"1806.10498v1","created_at":"2026-05-18T00:12:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.10498","created_at":"2026-05-18T00:12:12Z"},{"alias_kind":"pith_short_12","alias_value":"IPH7O46X6VJV","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IPH7O46X6VJV2AOU","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IPH7O46X","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:12feb31673f1ead0d242ec35fb8d53666ded332b70d9d562780a2005d5bc22a8","target":"graph","created_at":"2026-05-18T00:12:12Z","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":"An optimal binary search tree for an access sequence on elements is a static tree that minimizes the total search cost. Constructing perfectly optimal binary search trees is expensive so the most efficient algorithms construct almost optimal search trees. There exists a long literature of constructing almost optimal search trees dynamically, i.e., when the access pattern is not known in advance. All of these trees, e.g., splay trees and treaps, provide a multiplicative approximation to the optimal search cost.\n  In this paper we show how to maintain an almost optimal weighted binary search tre","authors_text":"J. Ian Munro, John Iacono, Mordecai Golin, Stefan Langerman, Yakov Nekrich","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-27T14:27:02Z","title":"Dynamic Trees with Almost-Optimal Access Cost"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.10498","kind":"arxiv","version":1},"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:99f231f8b3a2c0159c91db06205e118ee180aa45bd845cbc63b0ed265bcd556f","target":"record","created_at":"2026-05-18T00:12:12Z","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":"e4b88a401c457cd912f177ae482b6fb1eb7731332a80f1fb86fa31b56de99fb9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-27T14:27:02Z","title_canon_sha256":"357369b2bf22f9e60418b983436d0d1459c32abb5ac465a961676bd62099a8ee"},"schema_version":"1.0","source":{"id":"1806.10498","kind":"arxiv","version":1}},"canonical_sha256":"43cff773d7f5535d01d4ca78542c690644c7051b8266832102a4dc21d518d52f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"43cff773d7f5535d01d4ca78542c690644c7051b8266832102a4dc21d518d52f","first_computed_at":"2026-05-18T00:12:12.197342Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:12.197342Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gY6xgg/cRqbBPc1zSCetMUAb3Zhqws2hy+PkH3C2x/fdPKdaYhDLJXPD4GbobXUWWS1ClMKU0jM0et8gBsA8Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:12.197867Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.10498","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:99f231f8b3a2c0159c91db06205e118ee180aa45bd845cbc63b0ed265bcd556f","sha256:12feb31673f1ead0d242ec35fb8d53666ded332b70d9d562780a2005d5bc22a8"],"state_sha256":"a72c58e8afa5fc361848b069e6f7d77c536493ec278a59d7667dc40e362503b2"}