{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:32DAKR3NUPZXFY3LG3HX2BMQUN","short_pith_number":"pith:32DAKR3N","canonical_record":{"source":{"id":"1603.04892","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-15T21:38:57Z","cross_cats_sorted":[],"title_canon_sha256":"d5d30055fd68a4aed40373da1ddbe898456cffd390626572eaa60ebeab4e38db","abstract_canon_sha256":"ad0b9eb48fec1effe7bc85b7e5bb01758e49c62381a3cb706a7eabcf233657b5"},"schema_version":"1.0"},"canonical_sha256":"de8605476da3f372e36b36cf7d0590a378904d5987f7a74462c52774788514b8","source":{"kind":"arxiv","id":"1603.04892","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.04892","created_at":"2026-05-18T01:18:59Z"},{"alias_kind":"arxiv_version","alias_value":"1603.04892v1","created_at":"2026-05-18T01:18:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.04892","created_at":"2026-05-18T01:18:59Z"},{"alias_kind":"pith_short_12","alias_value":"32DAKR3NUPZX","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"32DAKR3NUPZXFY3L","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"32DAKR3N","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:32DAKR3NUPZXFY3LG3HX2BMQUN","target":"record","payload":{"canonical_record":{"source":{"id":"1603.04892","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-15T21:38:57Z","cross_cats_sorted":[],"title_canon_sha256":"d5d30055fd68a4aed40373da1ddbe898456cffd390626572eaa60ebeab4e38db","abstract_canon_sha256":"ad0b9eb48fec1effe7bc85b7e5bb01758e49c62381a3cb706a7eabcf233657b5"},"schema_version":"1.0"},"canonical_sha256":"de8605476da3f372e36b36cf7d0590a378904d5987f7a74462c52774788514b8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:59.749291Z","signature_b64":"RDTC6XCwP8kCm0cvGm0TWGl1lE1EsHH6XM7jboBr6Sx2ToVFq0q0e1ur5jMIKuzck2/fIoHQNsZ/eCx2WwUNAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de8605476da3f372e36b36cf7d0590a378904d5987f7a74462c52774788514b8","last_reissued_at":"2026-05-18T01:18:59.748677Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:59.748677Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.04892","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-18T01:18:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5aDqVri2AAgjOdRFDozGVp+7s2fk6Ub1QA5TNv3ZdbBCvxM09GJPHvVKEmP6WDpWGIAY5NLRf+6GNHDpo9vsAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:26:27.328136Z"},"content_sha256":"528d1a4e2a68028b444ab43af321773844a17c1fe58c4773fa8eef6368288218","schema_version":"1.0","event_id":"sha256:528d1a4e2a68028b444ab43af321773844a17c1fe58c4773fa8eef6368288218"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:32DAKR3NUPZXFY3LG3HX2BMQUN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The landscape of bounds for binary search trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Kurt Mehlhorn, L\\'aszl\\'o Kozma, Mayank Goswami, Parinya Chalermsook, Thatchaphol Saranurak","submitted_at":"2016-03-15T21:38:57Z","abstract_excerpt":"Binary search trees (BSTs) with rotations can adapt to various kinds of structure in search sequences, achieving amortized access times substantially better than the Theta(log n) worst-case guarantee. Classical examples of structural properties include static optimality, sequential access, working set, key-independent optimality, and dynamic finger, all of which are now known to be achieved by the two famous online BST algorithms (Splay and Greedy). (...)\n  In this paper, we introduce novel properties that explain the efficiency of sequences not captured by any of the previously known properti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.04892","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-18T01:18:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5r1KnSq3ptD1EUOScOCgvM9r8tyIeKEoq3I7yfuY+Onj6N1MpBGY70ZSGgKu6dx+x8a6YSvPXKW5ny0VkcvADA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:26:27.328801Z"},"content_sha256":"3867f9609e28fab37d6dbf16c2942a205d53abe42ea8f9b3ebc3c84771e5762c","schema_version":"1.0","event_id":"sha256:3867f9609e28fab37d6dbf16c2942a205d53abe42ea8f9b3ebc3c84771e5762c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/32DAKR3NUPZXFY3LG3HX2BMQUN/bundle.json","state_url":"https://pith.science/pith/32DAKR3NUPZXFY3LG3HX2BMQUN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/32DAKR3NUPZXFY3LG3HX2BMQUN/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-25T18:26:27Z","links":{"resolver":"https://pith.science/pith/32DAKR3NUPZXFY3LG3HX2BMQUN","bundle":"https://pith.science/pith/32DAKR3NUPZXFY3LG3HX2BMQUN/bundle.json","state":"https://pith.science/pith/32DAKR3NUPZXFY3LG3HX2BMQUN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/32DAKR3NUPZXFY3LG3HX2BMQUN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:32DAKR3NUPZXFY3LG3HX2BMQUN","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":"ad0b9eb48fec1effe7bc85b7e5bb01758e49c62381a3cb706a7eabcf233657b5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-15T21:38:57Z","title_canon_sha256":"d5d30055fd68a4aed40373da1ddbe898456cffd390626572eaa60ebeab4e38db"},"schema_version":"1.0","source":{"id":"1603.04892","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.04892","created_at":"2026-05-18T01:18:59Z"},{"alias_kind":"arxiv_version","alias_value":"1603.04892v1","created_at":"2026-05-18T01:18:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.04892","created_at":"2026-05-18T01:18:59Z"},{"alias_kind":"pith_short_12","alias_value":"32DAKR3NUPZX","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"32DAKR3NUPZXFY3L","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"32DAKR3N","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:3867f9609e28fab37d6dbf16c2942a205d53abe42ea8f9b3ebc3c84771e5762c","target":"graph","created_at":"2026-05-18T01:18:59Z","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":"Binary search trees (BSTs) with rotations can adapt to various kinds of structure in search sequences, achieving amortized access times substantially better than the Theta(log n) worst-case guarantee. Classical examples of structural properties include static optimality, sequential access, working set, key-independent optimality, and dynamic finger, all of which are now known to be achieved by the two famous online BST algorithms (Splay and Greedy). (...)\n  In this paper, we introduce novel properties that explain the efficiency of sequences not captured by any of the previously known properti","authors_text":"Kurt Mehlhorn, L\\'aszl\\'o Kozma, Mayank Goswami, Parinya Chalermsook, Thatchaphol Saranurak","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-15T21:38:57Z","title":"The landscape of bounds for binary search trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.04892","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:528d1a4e2a68028b444ab43af321773844a17c1fe58c4773fa8eef6368288218","target":"record","created_at":"2026-05-18T01:18:59Z","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":"ad0b9eb48fec1effe7bc85b7e5bb01758e49c62381a3cb706a7eabcf233657b5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-15T21:38:57Z","title_canon_sha256":"d5d30055fd68a4aed40373da1ddbe898456cffd390626572eaa60ebeab4e38db"},"schema_version":"1.0","source":{"id":"1603.04892","kind":"arxiv","version":1}},"canonical_sha256":"de8605476da3f372e36b36cf7d0590a378904d5987f7a74462c52774788514b8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"de8605476da3f372e36b36cf7d0590a378904d5987f7a74462c52774788514b8","first_computed_at":"2026-05-18T01:18:59.748677Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:59.748677Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RDTC6XCwP8kCm0cvGm0TWGl1lE1EsHH6XM7jboBr6Sx2ToVFq0q0e1ur5jMIKuzck2/fIoHQNsZ/eCx2WwUNAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:59.749291Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.04892","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:528d1a4e2a68028b444ab43af321773844a17c1fe58c4773fa8eef6368288218","sha256:3867f9609e28fab37d6dbf16c2942a205d53abe42ea8f9b3ebc3c84771e5762c"],"state_sha256":"7e52df2ab8e4e40d09636ca948891ff5e1397b0727c54a0bf596ea6c5747f73d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MoQtbvHtF89oASkJ6uu0MDhkAal/ib+z4ahsUvf9U3xewbTzKq7cYdhXVHx5uYWHPoz5aBdD8IuXG97I7+NeCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:26:27.332291Z","bundle_sha256":"4819c0e020dfb90a3dee9f4e2301bf84296f750184ab1226f4f353ad2c3b0433"}}