{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:74KVOFFOGUTX6AGVBHIFIYJLXX","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":"c9de4a59c2e92f6bed158a80d055623bbc26b665ed61154afa8351b419a09e83","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-05T22:52:51Z","title_canon_sha256":"a48a9066a7ac7c9c32907d7b4978d6382f764d275b647c06b77b35b8c7f59404"},"schema_version":"1.0","source":{"id":"1809.01759","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.01759","created_at":"2026-05-18T00:06:17Z"},{"alias_kind":"arxiv_version","alias_value":"1809.01759v1","created_at":"2026-05-18T00:06:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.01759","created_at":"2026-05-18T00:06:17Z"},{"alias_kind":"pith_short_12","alias_value":"74KVOFFOGUTX","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"74KVOFFOGUTX6AGV","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"74KVOFFO","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:7aa665d43bc40f9cfe1c8d83c823af4c242e164c34e573f291ae1d4a35840f8c","target":"graph","created_at":"2026-05-18T00:06:17Z","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":"We study multi-finger binary search trees (BSTs), a far-reaching extension of the classical BST model, with connections to the well-studied $k$-server problem. Finger search is a popular technique for speeding up BST operations when a query sequence has locality of reference. BSTs with multiple fingers can exploit more general regularities in the input. In this paper we consider the cost of serving a sequence of queries in an optimal (offline) BST with $k$ fingers, a powerful benchmark against which other algorithms can be measured.\n  We show that the $k$-finger optimum can be matched by a sta","authors_text":"Kurt Mehlhorn, L\\'aszl\\'o Kozma, Mayank Goswami, Parinya Chalermsook, Thatchaphol Saranurak","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-05T22:52:51Z","title":"Multi-finger binary search trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.01759","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:787c66022b150dedb702a4347d8a9bc3c3d5d013389ebbce56b8365553c8a8b9","target":"record","created_at":"2026-05-18T00:06:17Z","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":"c9de4a59c2e92f6bed158a80d055623bbc26b665ed61154afa8351b419a09e83","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-05T22:52:51Z","title_canon_sha256":"a48a9066a7ac7c9c32907d7b4978d6382f764d275b647c06b77b35b8c7f59404"},"schema_version":"1.0","source":{"id":"1809.01759","kind":"arxiv","version":1}},"canonical_sha256":"ff155714ae35277f00d509d054612bbde81377b4e4cf21cb4ebcd0c884a6ac97","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ff155714ae35277f00d509d054612bbde81377b4e4cf21cb4ebcd0c884a6ac97","first_computed_at":"2026-05-18T00:06:17.908613Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:17.908613Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rE0qIPMu0z6tMi5yBe8hi9bfuze+6JoXdAgC3TmeGNl/rc5Wf6AVBhw5fiTvWV4HLPbkyVK8mxTo7GJjPc7TBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:17.909113Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.01759","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:787c66022b150dedb702a4347d8a9bc3c3d5d013389ebbce56b8365553c8a8b9","sha256:7aa665d43bc40f9cfe1c8d83c823af4c242e164c34e573f291ae1d4a35840f8c"],"state_sha256":"1c80556bf20c82a18a826c4725b1876ec500d15ce1d66220e019cba65b55a89a"}