{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:IPH7O46X6VJV2AOUZJ4FILDJAZ","short_pith_number":"pith:IPH7O46X","canonical_record":{"source":{"id":"1806.10498","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-27T14:27:02Z","cross_cats_sorted":[],"title_canon_sha256":"357369b2bf22f9e60418b983436d0d1459c32abb5ac465a961676bd62099a8ee","abstract_canon_sha256":"e4b88a401c457cd912f177ae482b6fb1eb7731332a80f1fb86fa31b56de99fb9"},"schema_version":"1.0"},"canonical_sha256":"43cff773d7f5535d01d4ca78542c690644c7051b8266832102a4dc21d518d52f","source":{"kind":"arxiv","id":"1806.10498","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:IPH7O46X6VJV2AOUZJ4FILDJAZ","target":"record","payload":{"canonical_record":{"source":{"id":"1806.10498","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-27T14:27:02Z","cross_cats_sorted":[],"title_canon_sha256":"357369b2bf22f9e60418b983436d0d1459c32abb5ac465a961676bd62099a8ee","abstract_canon_sha256":"e4b88a401c457cd912f177ae482b6fb1eb7731332a80f1fb86fa31b56de99fb9"},"schema_version":"1.0"},"canonical_sha256":"43cff773d7f5535d01d4ca78542c690644c7051b8266832102a4dc21d518d52f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:12.197867Z","signature_b64":"gY6xgg/cRqbBPc1zSCetMUAb3Zhqws2hy+PkH3C2x/fdPKdaYhDLJXPD4GbobXUWWS1ClMKU0jM0et8gBsA8Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43cff773d7f5535d01d4ca78542c690644c7051b8266832102a4dc21d518d52f","last_reissued_at":"2026-05-18T00:12:12.197342Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:12.197342Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.10498","source_version":1,"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:12:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qE9VSxAwCSoN1isGq7SWSPxLJS6XaTqc1y7LUgKd3v+ayZ+/onPTMxYpirDYy1o4Ajp6lO6Ed2mThicVL+vlAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:47:46.702602Z"},"content_sha256":"99f231f8b3a2c0159c91db06205e118ee180aa45bd845cbc63b0ed265bcd556f","schema_version":"1.0","event_id":"sha256:99f231f8b3a2c0159c91db06205e118ee180aa45bd845cbc63b0ed265bcd556f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:IPH7O46X6VJV2AOUZJ4FILDJAZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dynamic Trees with Almost-Optimal Access Cost","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"J. Ian Munro, John Iacono, Mordecai Golin, Stefan Langerman, Yakov Nekrich","submitted_at":"2018-06-27T14:27:02Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.10498","kind":"arxiv","version":1},"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:12:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rd2nrssYk+PG4TofPOxAU0nzSJl29SCfRIDVpSKlnb3QupGC7EiiaYexknBF/JWMtuRZbMhNnwmGFQOQHAZOAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:47:46.703222Z"},"content_sha256":"12feb31673f1ead0d242ec35fb8d53666ded332b70d9d562780a2005d5bc22a8","schema_version":"1.0","event_id":"sha256:12feb31673f1ead0d242ec35fb8d53666ded332b70d9d562780a2005d5bc22a8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IPH7O46X6VJV2AOUZJ4FILDJAZ/bundle.json","state_url":"https://pith.science/pith/IPH7O46X6VJV2AOUZJ4FILDJAZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IPH7O46X6VJV2AOUZJ4FILDJAZ/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-05-27T19:47:46Z","links":{"resolver":"https://pith.science/pith/IPH7O46X6VJV2AOUZJ4FILDJAZ","bundle":"https://pith.science/pith/IPH7O46X6VJV2AOUZJ4FILDJAZ/bundle.json","state":"https://pith.science/pith/IPH7O46X6VJV2AOUZJ4FILDJAZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IPH7O46X6VJV2AOUZJ4FILDJAZ/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A7gFQb/GfMWQCgIkLmqM58OHd0QwiHV/UXSJfLL4QODx0kqlZe7TAhera2WlM70oNE5UjfVdvLLDtU24L/5RAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T19:47:46.706240Z","bundle_sha256":"aa1652b0f4b92b907cc1e2c0feefdf788d62694947a13f94dff1cadaa8bfac27"}}