{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:BSCXTQY2JST3GQT32DIPJ4RYNL","short_pith_number":"pith:BSCXTQY2","schema_version":"1.0","canonical_sha256":"0c8579c31a4ca7b3427bd0d0f4f2386acb1168276be0a089e21ee973b17824ea","source":{"kind":"arxiv","id":"1304.6897","version":1},"attestation_state":"computed","paper":{"title":"The Power and Limitations of Static Binary Search Trees with Lazy Finger","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"John Iacono, Karim Dou\\\"ieb, Prosenjit Bose, Stefan Langerman","submitted_at":"2013-04-25T12:46:53Z","abstract_excerpt":"A static binary search tree where every search starts from where the previous one ends (lazy finger) is considered. Such a search method is more powerful than that of the classic optimal static trees, where every search starts from the root (root finger), and less powerful than when rotations are allowed---where finding the best rotation based tree is the topic of the dynamic optimality conjecture of Sleator and Tarjan. The runtime of the classic root-finger tree can be expressed in terms of the entropy of the distribution of the searches, but we show that this is not the case for the optimal "},"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":"1304.6897","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-25T12:46:53Z","cross_cats_sorted":[],"title_canon_sha256":"c0236944f195129abc4977d30965c8eb460869d14a60e96c083be077118edc06","abstract_canon_sha256":"0f42db8ad26a635939978a7c2e95eff468e2180d76c3df59fe4e4952dbbfdc88"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:10.847604Z","signature_b64":"wqmZLtQUQU4q8nUCjf7giKkIwb2Byi3a8HuoWoLCjlFrQVjRTBjsJesLS6D+t2dqleq2PUQ7QGrhRG4m48RXCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c8579c31a4ca7b3427bd0d0f4f2386acb1168276be0a089e21ee973b17824ea","last_reissued_at":"2026-05-18T03:27:10.846750Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:10.846750Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Power and Limitations of Static Binary Search Trees with Lazy Finger","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"John Iacono, Karim Dou\\\"ieb, Prosenjit Bose, Stefan Langerman","submitted_at":"2013-04-25T12:46:53Z","abstract_excerpt":"A static binary search tree where every search starts from where the previous one ends (lazy finger) is considered. Such a search method is more powerful than that of the classic optimal static trees, where every search starts from the root (root finger), and less powerful than when rotations are allowed---where finding the best rotation based tree is the topic of the dynamic optimality conjecture of Sleator and Tarjan. The runtime of the classic root-finger tree can be expressed in terms of the entropy of the distribution of the searches, but we show that this is not the case for the optimal "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.6897","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":"1304.6897","created_at":"2026-05-18T03:27:10.846870+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.6897v1","created_at":"2026-05-18T03:27:10.846870+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6897","created_at":"2026-05-18T03:27:10.846870+00:00"},{"alias_kind":"pith_short_12","alias_value":"BSCXTQY2JST3","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"BSCXTQY2JST3GQT3","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"BSCXTQY2","created_at":"2026-05-18T12:27:40.988391+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/BSCXTQY2JST3GQT32DIPJ4RYNL","json":"https://pith.science/pith/BSCXTQY2JST3GQT32DIPJ4RYNL.json","graph_json":"https://pith.science/api/pith-number/BSCXTQY2JST3GQT32DIPJ4RYNL/graph.json","events_json":"https://pith.science/api/pith-number/BSCXTQY2JST3GQT32DIPJ4RYNL/events.json","paper":"https://pith.science/paper/BSCXTQY2"},"agent_actions":{"view_html":"https://pith.science/pith/BSCXTQY2JST3GQT32DIPJ4RYNL","download_json":"https://pith.science/pith/BSCXTQY2JST3GQT32DIPJ4RYNL.json","view_paper":"https://pith.science/paper/BSCXTQY2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.6897&json=true","fetch_graph":"https://pith.science/api/pith-number/BSCXTQY2JST3GQT32DIPJ4RYNL/graph.json","fetch_events":"https://pith.science/api/pith-number/BSCXTQY2JST3GQT32DIPJ4RYNL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BSCXTQY2JST3GQT32DIPJ4RYNL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BSCXTQY2JST3GQT32DIPJ4RYNL/action/storage_attestation","attest_author":"https://pith.science/pith/BSCXTQY2JST3GQT32DIPJ4RYNL/action/author_attestation","sign_citation":"https://pith.science/pith/BSCXTQY2JST3GQT32DIPJ4RYNL/action/citation_signature","submit_replication":"https://pith.science/pith/BSCXTQY2JST3GQT32DIPJ4RYNL/action/replication_record"}},"created_at":"2026-05-18T03:27:10.846870+00:00","updated_at":"2026-05-18T03:27:10.846870+00:00"}