{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:74KVOFFOGUTX6AGVBHIFIYJLXX","short_pith_number":"pith:74KVOFFO","schema_version":"1.0","canonical_sha256":"ff155714ae35277f00d509d054612bbde81377b4e4cf21cb4ebcd0c884a6ac97","source":{"kind":"arxiv","id":"1809.01759","version":1},"attestation_state":"computed","paper":{"title":"Multi-finger binary search trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Kurt Mehlhorn, L\\'aszl\\'o Kozma, Mayank Goswami, Parinya Chalermsook, Thatchaphol Saranurak","submitted_at":"2018-09-05T22:52:51Z","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"},"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":"1809.01759","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-05T22:52:51Z","cross_cats_sorted":[],"title_canon_sha256":"a48a9066a7ac7c9c32907d7b4978d6382f764d275b647c06b77b35b8c7f59404","abstract_canon_sha256":"c9de4a59c2e92f6bed158a80d055623bbc26b665ed61154afa8351b419a09e83"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:17.909113Z","signature_b64":"rE0qIPMu0z6tMi5yBe8hi9bfuze+6JoXdAgC3TmeGNl/rc5Wf6AVBhw5fiTvWV4HLPbkyVK8mxTo7GJjPc7TBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff155714ae35277f00d509d054612bbde81377b4e4cf21cb4ebcd0c884a6ac97","last_reissued_at":"2026-05-18T00:06:17.908613Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:17.908613Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-finger binary search trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Kurt Mehlhorn, L\\'aszl\\'o Kozma, Mayank Goswami, Parinya Chalermsook, Thatchaphol Saranurak","submitted_at":"2018-09-05T22:52:51Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.01759","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1809.01759","created_at":"2026-05-18T00:06:17.908689+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.01759v1","created_at":"2026-05-18T00:06:17.908689+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.01759","created_at":"2026-05-18T00:06:17.908689+00:00"},{"alias_kind":"pith_short_12","alias_value":"74KVOFFOGUTX","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"74KVOFFOGUTX6AGV","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"74KVOFFO","created_at":"2026-05-18T12:32:11.075285+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/74KVOFFOGUTX6AGVBHIFIYJLXX","json":"https://pith.science/pith/74KVOFFOGUTX6AGVBHIFIYJLXX.json","graph_json":"https://pith.science/api/pith-number/74KVOFFOGUTX6AGVBHIFIYJLXX/graph.json","events_json":"https://pith.science/api/pith-number/74KVOFFOGUTX6AGVBHIFIYJLXX/events.json","paper":"https://pith.science/paper/74KVOFFO"},"agent_actions":{"view_html":"https://pith.science/pith/74KVOFFOGUTX6AGVBHIFIYJLXX","download_json":"https://pith.science/pith/74KVOFFOGUTX6AGVBHIFIYJLXX.json","view_paper":"https://pith.science/paper/74KVOFFO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.01759&json=true","fetch_graph":"https://pith.science/api/pith-number/74KVOFFOGUTX6AGVBHIFIYJLXX/graph.json","fetch_events":"https://pith.science/api/pith-number/74KVOFFOGUTX6AGVBHIFIYJLXX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/74KVOFFOGUTX6AGVBHIFIYJLXX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/74KVOFFOGUTX6AGVBHIFIYJLXX/action/storage_attestation","attest_author":"https://pith.science/pith/74KVOFFOGUTX6AGVBHIFIYJLXX/action/author_attestation","sign_citation":"https://pith.science/pith/74KVOFFOGUTX6AGVBHIFIYJLXX/action/citation_signature","submit_replication":"https://pith.science/pith/74KVOFFOGUTX6AGVBHIFIYJLXX/action/replication_record"}},"created_at":"2026-05-18T00:06:17.908689+00:00","updated_at":"2026-05-18T00:06:17.908689+00:00"}