{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:PJIPWB6UJDV54W5RAKH6LFE7JQ","short_pith_number":"pith:PJIPWB6U","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"},"canonical_sha256":"7a50fb07d448ebde5bb1028fe5949f4c1154eda71f7f3ddd2e6b59db3f46fe4f","source":{"kind":"arxiv","id":"1102.4523","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.4523","created_at":"2026-05-18T04:28:08Z"},{"alias_kind":"arxiv_version","alias_value":"1102.4523v1","created_at":"2026-05-18T04:28:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.4523","created_at":"2026-05-18T04:28:08Z"},{"alias_kind":"pith_short_12","alias_value":"PJIPWB6UJDV5","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"PJIPWB6UJDV54W5R","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"PJIPWB6U","created_at":"2026-05-18T12:26:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:PJIPWB6UJDV54W5RAKH6LFE7JQ","target":"record","payload":{"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"},"canonical_sha256":"7a50fb07d448ebde5bb1028fe5949f4c1154eda71f7f3ddd2e6b59db3f46fe4f","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"},"source_kind":"arxiv","source_id":"1102.4523","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-18T04:28:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kug9UDXM/plgo8x0uOfDzNGrBvFjOf7p8GLVDxTyxyBiWZOrP0tu1HYqD4yddqt2LDSNuhHNjjVioYorrsufAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:33:07.271929Z"},"content_sha256":"789816f2b12519f90708e60b40bc28535dea86f3dfbe8af0fad4cb104100b093","schema_version":"1.0","event_id":"sha256:789816f2b12519f90708e60b40bc28535dea86f3dfbe8af0fad4cb104100b093"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:PJIPWB6UJDV54W5RAKH6LFE7JQ","target":"graph","payload":{"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"},"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-18T04:28:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A71f+YXYdh66/p8HWcPF+xfl4h+bx9K2Mj0E/VjBaBIhhpdk/E/cdxpW78gDCfUdxJvkK5u6PxnX2QHzyd5zAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:33:07.272276Z"},"content_sha256":"6ec96a506767edf5668dd4bc2193cea9044d5ff79a845403b757f9b827ec7aca","schema_version":"1.0","event_id":"sha256:6ec96a506767edf5668dd4bc2193cea9044d5ff79a845403b757f9b827ec7aca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PJIPWB6UJDV54W5RAKH6LFE7JQ/bundle.json","state_url":"https://pith.science/pith/PJIPWB6UJDV54W5RAKH6LFE7JQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PJIPWB6UJDV54W5RAKH6LFE7JQ/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-05-30T06:33:07Z","links":{"resolver":"https://pith.science/pith/PJIPWB6UJDV54W5RAKH6LFE7JQ","bundle":"https://pith.science/pith/PJIPWB6UJDV54W5RAKH6LFE7JQ/bundle.json","state":"https://pith.science/pith/PJIPWB6UJDV54W5RAKH6LFE7JQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PJIPWB6UJDV54W5RAKH6LFE7JQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:PJIPWB6UJDV54W5RAKH6LFE7JQ","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":"3b3629927a4f411b2454f05aa7c4cbe37d6340b9c3839d442727223ac468ccf3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-02-22T14:47:19Z","title_canon_sha256":"d9c9d128e925796dc3335edc9de9969c769559220b51abe436c322bc63f62290"},"schema_version":"1.0","source":{"id":"1102.4523","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.4523","created_at":"2026-05-18T04:28:08Z"},{"alias_kind":"arxiv_version","alias_value":"1102.4523v1","created_at":"2026-05-18T04:28:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.4523","created_at":"2026-05-18T04:28:08Z"},{"alias_kind":"pith_short_12","alias_value":"PJIPWB6UJDV5","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"PJIPWB6UJDV54W5R","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"PJIPWB6U","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:6ec96a506767edf5668dd4bc2193cea9044d5ff79a845403b757f9b827ec7aca","target":"graph","created_at":"2026-05-18T04:28:08Z","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":"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","authors_text":"Manoj Gupta, Navin Goyal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-02-22T14:47:19Z","title":"On Dynamic Optimality for Binary Search Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.4523","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:789816f2b12519f90708e60b40bc28535dea86f3dfbe8af0fad4cb104100b093","target":"record","created_at":"2026-05-18T04:28:08Z","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":"3b3629927a4f411b2454f05aa7c4cbe37d6340b9c3839d442727223ac468ccf3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-02-22T14:47:19Z","title_canon_sha256":"d9c9d128e925796dc3335edc9de9969c769559220b51abe436c322bc63f62290"},"schema_version":"1.0","source":{"id":"1102.4523","kind":"arxiv","version":1}},"canonical_sha256":"7a50fb07d448ebde5bb1028fe5949f4c1154eda71f7f3ddd2e6b59db3f46fe4f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7a50fb07d448ebde5bb1028fe5949f4c1154eda71f7f3ddd2e6b59db3f46fe4f","first_computed_at":"2026-05-18T04:28:08.713959Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:28:08.713959Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rCZTqoIwVhZ2uebZCzjszcUqYnr60N4mxLDSkJrQ/du5jL2CDCQcHKxHxKnX+dIirNudJrdpc/KzZh3NP3goCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:28:08.714712Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.4523","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:789816f2b12519f90708e60b40bc28535dea86f3dfbe8af0fad4cb104100b093","sha256:6ec96a506767edf5668dd4bc2193cea9044d5ff79a845403b757f9b827ec7aca"],"state_sha256":"a1880fc29923ac17303747d530fe18351c21c46d1d807d4c3073a2836e260b92"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E+8p+Owh2YOgWAMjBGBpAF7nvei4F4y1nKa6hkYUkDU42W0G7gT3EEQDCpG8EhLOkgxDXO+1uN371IdEaP5TBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T06:33:07.274357Z","bundle_sha256":"1fe3460ba4bf11a3741db9ae5c031e485a6d9e149f3e0755af16f0bdc4f5dd00"}}