{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:CX4SQSUETK6W4HMGHPDHVZO477","short_pith_number":"pith:CX4SQSUE","schema_version":"1.0","canonical_sha256":"15f9284a849abd6e1d863bc67ae5dcffd60f25638bf8065e398960520c02a616","source":{"kind":"arxiv","id":"1003.0139","version":1},"attestation_state":"computed","paper":{"title":"An O(loglog n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"(2) Department of Mathematics, Carleton University, Computer Science, Karim Dou\\\"ieb (1), Prosenjit Bose (1), Rolf Fagerberg (2) ((1) School of Computer Science, University of Southern Denmark), Vida Dujmovic (1)","submitted_at":"2010-02-27T23:39:35Z","abstract_excerpt":"We present the zipper tree, an $O(\\log \\log n)$-competitive online binary search tree that performs each access in $O(\\log n)$ worst-case time. This shows that for binary search trees, optimal worst-case access time and near-optimal amortized access time can be guaranteed simultaneously."},"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":"1003.0139","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-02-27T23:39:35Z","cross_cats_sorted":[],"title_canon_sha256":"6a7aa248b2b53bff75e4959fc9c50fdc954f5b4c737629579290516ea1f6f879","abstract_canon_sha256":"d8d1851d72bed7c7d149e845b5588519c99c4e349a733ad4664356e121528961"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:08:48.452700Z","signature_b64":"B6cZDKBk1hf+nsWs0PfBEwWyAWF2uKXen5XxHSV2UjphEH7KlcmJ15Y2yfn7NSx99YfbL5DWprNwjg0zSTAhDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15f9284a849abd6e1d863bc67ae5dcffd60f25638bf8065e398960520c02a616","last_reissued_at":"2026-05-18T02:08:48.452098Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:08:48.452098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An O(loglog n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"(2) Department of Mathematics, Carleton University, Computer Science, Karim Dou\\\"ieb (1), Prosenjit Bose (1), Rolf Fagerberg (2) ((1) School of Computer Science, University of Southern Denmark), Vida Dujmovic (1)","submitted_at":"2010-02-27T23:39:35Z","abstract_excerpt":"We present the zipper tree, an $O(\\log \\log n)$-competitive online binary search tree that performs each access in $O(\\log n)$ worst-case time. This shows that for binary search trees, optimal worst-case access time and near-optimal amortized access time can be guaranteed simultaneously."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1003.0139","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":"1003.0139","created_at":"2026-05-18T02:08:48.452190+00:00"},{"alias_kind":"arxiv_version","alias_value":"1003.0139v1","created_at":"2026-05-18T02:08:48.452190+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1003.0139","created_at":"2026-05-18T02:08:48.452190+00:00"},{"alias_kind":"pith_short_12","alias_value":"CX4SQSUETK6W","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_16","alias_value":"CX4SQSUETK6W4HMG","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_8","alias_value":"CX4SQSUE","created_at":"2026-05-18T12:26:06.534383+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/CX4SQSUETK6W4HMGHPDHVZO477","json":"https://pith.science/pith/CX4SQSUETK6W4HMGHPDHVZO477.json","graph_json":"https://pith.science/api/pith-number/CX4SQSUETK6W4HMGHPDHVZO477/graph.json","events_json":"https://pith.science/api/pith-number/CX4SQSUETK6W4HMGHPDHVZO477/events.json","paper":"https://pith.science/paper/CX4SQSUE"},"agent_actions":{"view_html":"https://pith.science/pith/CX4SQSUETK6W4HMGHPDHVZO477","download_json":"https://pith.science/pith/CX4SQSUETK6W4HMGHPDHVZO477.json","view_paper":"https://pith.science/paper/CX4SQSUE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1003.0139&json=true","fetch_graph":"https://pith.science/api/pith-number/CX4SQSUETK6W4HMGHPDHVZO477/graph.json","fetch_events":"https://pith.science/api/pith-number/CX4SQSUETK6W4HMGHPDHVZO477/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CX4SQSUETK6W4HMGHPDHVZO477/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CX4SQSUETK6W4HMGHPDHVZO477/action/storage_attestation","attest_author":"https://pith.science/pith/CX4SQSUETK6W4HMGHPDHVZO477/action/author_attestation","sign_citation":"https://pith.science/pith/CX4SQSUETK6W4HMGHPDHVZO477/action/citation_signature","submit_replication":"https://pith.science/pith/CX4SQSUETK6W4HMGHPDHVZO477/action/replication_record"}},"created_at":"2026-05-18T02:08:48.452190+00:00","updated_at":"2026-05-18T02:08:48.452190+00:00"}