{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:CX4SQSUETK6W4HMGHPDHVZO477","short_pith_number":"pith:CX4SQSUE","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"},"canonical_sha256":"15f9284a849abd6e1d863bc67ae5dcffd60f25638bf8065e398960520c02a616","source":{"kind":"arxiv","id":"1003.0139","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1003.0139","created_at":"2026-05-18T02:08:48Z"},{"alias_kind":"arxiv_version","alias_value":"1003.0139v1","created_at":"2026-05-18T02:08:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1003.0139","created_at":"2026-05-18T02:08:48Z"},{"alias_kind":"pith_short_12","alias_value":"CX4SQSUETK6W","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"CX4SQSUETK6W4HMG","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"CX4SQSUE","created_at":"2026-05-18T12:26:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:CX4SQSUETK6W4HMGHPDHVZO477","target":"record","payload":{"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"},"canonical_sha256":"15f9284a849abd6e1d863bc67ae5dcffd60f25638bf8065e398960520c02a616","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"},"source_kind":"arxiv","source_id":"1003.0139","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:08:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qcTh3GevPs1BczSwjziiefZ0P17J5fnIDJUqwKKEYz3oswRdllvK66kqg63kl4p/5b9rNlkIkuiNLtsjTbDgCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T18:12:10.261099Z"},"content_sha256":"9150839469e3a4d25452aa6b8bb9a902ca4c0e6b8af8508083f6aaa5662e3c86","schema_version":"1.0","event_id":"sha256:9150839469e3a4d25452aa6b8bb9a902ca4c0e6b8af8508083f6aaa5662e3c86"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:CX4SQSUETK6W4HMGHPDHVZO477","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:08:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bAOK/PrW7yvWCibX5UFNQHBQnEtFxqccMVE4IL4PB/qzVDJ9AWhzT7LGRLXf+mgZnYcFn3AHMsCQ2SjdgnI7Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T18:12:10.261465Z"},"content_sha256":"39186a16e9da72a3a9eeb549aa2488f109de67cdb894d527004d0a6ceada360e","schema_version":"1.0","event_id":"sha256:39186a16e9da72a3a9eeb549aa2488f109de67cdb894d527004d0a6ceada360e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CX4SQSUETK6W4HMGHPDHVZO477/bundle.json","state_url":"https://pith.science/pith/CX4SQSUETK6W4HMGHPDHVZO477/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CX4SQSUETK6W4HMGHPDHVZO477/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T18:12:10Z","links":{"resolver":"https://pith.science/pith/CX4SQSUETK6W4HMGHPDHVZO477","bundle":"https://pith.science/pith/CX4SQSUETK6W4HMGHPDHVZO477/bundle.json","state":"https://pith.science/pith/CX4SQSUETK6W4HMGHPDHVZO477/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CX4SQSUETK6W4HMGHPDHVZO477/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:CX4SQSUETK6W4HMGHPDHVZO477","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":"d8d1851d72bed7c7d149e845b5588519c99c4e349a733ad4664356e121528961","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-02-27T23:39:35Z","title_canon_sha256":"6a7aa248b2b53bff75e4959fc9c50fdc954f5b4c737629579290516ea1f6f879"},"schema_version":"1.0","source":{"id":"1003.0139","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1003.0139","created_at":"2026-05-18T02:08:48Z"},{"alias_kind":"arxiv_version","alias_value":"1003.0139v1","created_at":"2026-05-18T02:08:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1003.0139","created_at":"2026-05-18T02:08:48Z"},{"alias_kind":"pith_short_12","alias_value":"CX4SQSUETK6W","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"CX4SQSUETK6W4HMG","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"CX4SQSUE","created_at":"2026-05-18T12:26:06Z"}],"graph_snapshots":[{"event_id":"sha256:39186a16e9da72a3a9eeb549aa2488f109de67cdb894d527004d0a6ceada360e","target":"graph","created_at":"2026-05-18T02:08:48Z","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 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.","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)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-02-27T23:39:35Z","title":"An O(loglog n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1003.0139","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:9150839469e3a4d25452aa6b8bb9a902ca4c0e6b8af8508083f6aaa5662e3c86","target":"record","created_at":"2026-05-18T02:08:48Z","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":"d8d1851d72bed7c7d149e845b5588519c99c4e349a733ad4664356e121528961","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-02-27T23:39:35Z","title_canon_sha256":"6a7aa248b2b53bff75e4959fc9c50fdc954f5b4c737629579290516ea1f6f879"},"schema_version":"1.0","source":{"id":"1003.0139","kind":"arxiv","version":1}},"canonical_sha256":"15f9284a849abd6e1d863bc67ae5dcffd60f25638bf8065e398960520c02a616","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"15f9284a849abd6e1d863bc67ae5dcffd60f25638bf8065e398960520c02a616","first_computed_at":"2026-05-18T02:08:48.452098Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:08:48.452098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"B6cZDKBk1hf+nsWs0PfBEwWyAWF2uKXen5XxHSV2UjphEH7KlcmJ15Y2yfn7NSx99YfbL5DWprNwjg0zSTAhDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:08:48.452700Z","signed_message":"canonical_sha256_bytes"},"source_id":"1003.0139","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9150839469e3a4d25452aa6b8bb9a902ca4c0e6b8af8508083f6aaa5662e3c86","sha256:39186a16e9da72a3a9eeb549aa2488f109de67cdb894d527004d0a6ceada360e"],"state_sha256":"d14c2e96145cdef4fc4d38124fef106ebdf881eabd5d8f63938a404d8f73a992"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mEOPCsXkj4pfINmvPoRMuf3uYjS8BuuRv04OVXVLYUMi2S6Z2/2IpJGKG9zCVaGkG0ZlSXWGe2Tt284/JcV0Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T18:12:10.263585Z","bundle_sha256":"2453cb764c3ae690061cc916b8660b6d56e19058026a169b5ba1dfe9752b62c6"}}