{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:PJIPWB6UJDV54W5RAKH6LFE7JQ","short_pith_number":"pith:PJIPWB6U","schema_version":"1.0","canonical_sha256":"7a50fb07d448ebde5bb1028fe5949f4c1154eda71f7f3ddd2e6b59db3f46fe4f","source":{"kind":"arxiv","id":"1102.4523","version":1},"attestation_state":"computed","paper":{"title":"On Dynamic Optimality for Binary Search Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Manoj Gupta, Navin Goyal","submitted_at":"2011-02-22T14:47:19Z","abstract_excerpt":"Does there exist O(1)-competitive (self-adjusting) binary search tree (BST) algorithms? This is a well-studied problem. A simple offline BST algorithm GreedyFuture was proposed independently by Lucas and Munro, and they conjectured it to be O(1)-competitive. Recently, Demaine et al. gave a geometric view of the BST problem. This view allowed them to give an online algorithm GreedyArb with the same cost as GreedyFuture. However, no o(n)-competitive ratio was known for GreedyArb. In this paper we make progress towards proving O(1)-competitive ratio for GreedyArb by showing that it is O(\\log n)-c"},"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":"1102.4523","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-02-22T14:47:19Z","cross_cats_sorted":[],"title_canon_sha256":"d9c9d128e925796dc3335edc9de9969c769559220b51abe436c322bc63f62290","abstract_canon_sha256":"3b3629927a4f411b2454f05aa7c4cbe37d6340b9c3839d442727223ac468ccf3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:28:08.714712Z","signature_b64":"rCZTqoIwVhZ2uebZCzjszcUqYnr60N4mxLDSkJrQ/du5jL2CDCQcHKxHxKnX+dIirNudJrdpc/KzZh3NP3goCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a50fb07d448ebde5bb1028fe5949f4c1154eda71f7f3ddd2e6b59db3f46fe4f","last_reissued_at":"2026-05-18T04:28:08.713959Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:28:08.713959Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Dynamic Optimality for Binary Search Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Manoj Gupta, Navin Goyal","submitted_at":"2011-02-22T14:47:19Z","abstract_excerpt":"Does there exist O(1)-competitive (self-adjusting) binary search tree (BST) algorithms? This is a well-studied problem. A simple offline BST algorithm GreedyFuture was proposed independently by Lucas and Munro, and they conjectured it to be O(1)-competitive. Recently, Demaine et al. gave a geometric view of the BST problem. This view allowed them to give an online algorithm GreedyArb with the same cost as GreedyFuture. However, no o(n)-competitive ratio was known for GreedyArb. In this paper we make progress towards proving O(1)-competitive ratio for GreedyArb by showing that it is O(\\log n)-c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.4523","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":"1102.4523","created_at":"2026-05-18T04:28:08.714070+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.4523v1","created_at":"2026-05-18T04:28:08.714070+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.4523","created_at":"2026-05-18T04:28:08.714070+00:00"},{"alias_kind":"pith_short_12","alias_value":"PJIPWB6UJDV5","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_16","alias_value":"PJIPWB6UJDV54W5R","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_8","alias_value":"PJIPWB6U","created_at":"2026-05-18T12:26:39.201973+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/PJIPWB6UJDV54W5RAKH6LFE7JQ","json":"https://pith.science/pith/PJIPWB6UJDV54W5RAKH6LFE7JQ.json","graph_json":"https://pith.science/api/pith-number/PJIPWB6UJDV54W5RAKH6LFE7JQ/graph.json","events_json":"https://pith.science/api/pith-number/PJIPWB6UJDV54W5RAKH6LFE7JQ/events.json","paper":"https://pith.science/paper/PJIPWB6U"},"agent_actions":{"view_html":"https://pith.science/pith/PJIPWB6UJDV54W5RAKH6LFE7JQ","download_json":"https://pith.science/pith/PJIPWB6UJDV54W5RAKH6LFE7JQ.json","view_paper":"https://pith.science/paper/PJIPWB6U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.4523&json=true","fetch_graph":"https://pith.science/api/pith-number/PJIPWB6UJDV54W5RAKH6LFE7JQ/graph.json","fetch_events":"https://pith.science/api/pith-number/PJIPWB6UJDV54W5RAKH6LFE7JQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PJIPWB6UJDV54W5RAKH6LFE7JQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PJIPWB6UJDV54W5RAKH6LFE7JQ/action/storage_attestation","attest_author":"https://pith.science/pith/PJIPWB6UJDV54W5RAKH6LFE7JQ/action/author_attestation","sign_citation":"https://pith.science/pith/PJIPWB6UJDV54W5RAKH6LFE7JQ/action/citation_signature","submit_replication":"https://pith.science/pith/PJIPWB6UJDV54W5RAKH6LFE7JQ/action/replication_record"}},"created_at":"2026-05-18T04:28:08.714070+00:00","updated_at":"2026-05-18T04:28:08.714070+00:00"}