{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:DNHZDDDU6ZH45KHK2IEXEKFOIA","short_pith_number":"pith:DNHZDDDU","canonical_record":{"source":{"id":"1304.7604","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-29T09:52:14Z","cross_cats_sorted":[],"title_canon_sha256":"ae2b604419822cdb321bdf57079dfb16797398d1e5871a79852a27da10ec40ee","abstract_canon_sha256":"8375885c43831638bb4fcbb941c25092f203a17bdcae9950d544a3dd72775efe"},"schema_version":"1.0"},"canonical_sha256":"1b4f918c74f64fcea8ead2097228ae401e6bd355c337ced268578be2a9ba72ea","source":{"kind":"arxiv","id":"1304.7604","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.7604","created_at":"2026-05-18T03:26:53Z"},{"alias_kind":"arxiv_version","alias_value":"1304.7604v1","created_at":"2026-05-18T03:26:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.7604","created_at":"2026-05-18T03:26:53Z"},{"alias_kind":"pith_short_12","alias_value":"DNHZDDDU6ZH4","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"DNHZDDDU6ZH45KHK","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"DNHZDDDU","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:DNHZDDDU6ZH45KHK2IEXEKFOIA","target":"record","payload":{"canonical_record":{"source":{"id":"1304.7604","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-29T09:52:14Z","cross_cats_sorted":[],"title_canon_sha256":"ae2b604419822cdb321bdf57079dfb16797398d1e5871a79852a27da10ec40ee","abstract_canon_sha256":"8375885c43831638bb4fcbb941c25092f203a17bdcae9950d544a3dd72775efe"},"schema_version":"1.0"},"canonical_sha256":"1b4f918c74f64fcea8ead2097228ae401e6bd355c337ced268578be2a9ba72ea","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:53.545269Z","signature_b64":"7uViC/U2hmpFAR/5a78pFdHB/bmfzdKD48q3IgCHgzpfymjNUnHd60bdAsWMlID1kFWmQDJEefHFQ5nBmfuxBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b4f918c74f64fcea8ead2097228ae401e6bd355c337ced268578be2a9ba72ea","last_reissued_at":"2026-05-18T03:26:53.544302Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:53.544302Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.7604","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-18T03:26:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KoFxYcP8NqPsxTZsy4SHM80QA7fz6571cx+uI2aSqb7hN27Zkc8rpzaqBKtvUkZdUEf8ZwthpGSzfitqGQTzCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T18:11:05.523279Z"},"content_sha256":"cda431574f60f7e08d335c039b5f1a42d64688c36de17a46178ed4891a4171c4","schema_version":"1.0","event_id":"sha256:cda431574f60f7e08d335c039b5f1a42d64688c36de17a46178ed4891a4171c4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:DNHZDDDU6ZH45KHK2IEXEKFOIA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Combining Binary Search Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Erik D. Demaine, John Iacono, \\\"Ozg\\\"ur \\\"Ozkan, Stefan Langerman","submitted_at":"2013-04-29T09:52:14Z","abstract_excerpt":"We present a general transformation for combining a constant number of binary search tree data structures (BSTs) into a single BST whose running time is within a constant factor of the minimum of any \"well-behaved\" bound on the running time of the given BSTs, for any online access sequence.\n  (A BST has a well behaved bound with $f(n)$ overhead if it spends at most \\bigoh{f(n)} time per access and its bound satisfies a weak sense of closure under subsequences.) In particular, we obtain a BST data structure that is \\bigoh{\\log\\log n} competitive, satisfies the working set bound (and thus satisf"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.7604","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-18T03:26:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2SM6kYfBIlBkG/aUg/Lg2C5wI+gjTKuG6Su1zabVPNux+w5Tid8DsAEJm7F7DcUFhZHhlRDeBMxfPaQq7tI7Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T18:11:05.523632Z"},"content_sha256":"ccac3ff156425a4a361a5b8847733ce8cd8d7bdb78aa4f9f2795a0227b7d5271","schema_version":"1.0","event_id":"sha256:ccac3ff156425a4a361a5b8847733ce8cd8d7bdb78aa4f9f2795a0227b7d5271"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DNHZDDDU6ZH45KHK2IEXEKFOIA/bundle.json","state_url":"https://pith.science/pith/DNHZDDDU6ZH45KHK2IEXEKFOIA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DNHZDDDU6ZH45KHK2IEXEKFOIA/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-27T18:11:05Z","links":{"resolver":"https://pith.science/pith/DNHZDDDU6ZH45KHK2IEXEKFOIA","bundle":"https://pith.science/pith/DNHZDDDU6ZH45KHK2IEXEKFOIA/bundle.json","state":"https://pith.science/pith/DNHZDDDU6ZH45KHK2IEXEKFOIA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DNHZDDDU6ZH45KHK2IEXEKFOIA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:DNHZDDDU6ZH45KHK2IEXEKFOIA","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":"8375885c43831638bb4fcbb941c25092f203a17bdcae9950d544a3dd72775efe","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-29T09:52:14Z","title_canon_sha256":"ae2b604419822cdb321bdf57079dfb16797398d1e5871a79852a27da10ec40ee"},"schema_version":"1.0","source":{"id":"1304.7604","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.7604","created_at":"2026-05-18T03:26:53Z"},{"alias_kind":"arxiv_version","alias_value":"1304.7604v1","created_at":"2026-05-18T03:26:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.7604","created_at":"2026-05-18T03:26:53Z"},{"alias_kind":"pith_short_12","alias_value":"DNHZDDDU6ZH4","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"DNHZDDDU6ZH45KHK","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"DNHZDDDU","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:ccac3ff156425a4a361a5b8847733ce8cd8d7bdb78aa4f9f2795a0227b7d5271","target":"graph","created_at":"2026-05-18T03:26:53Z","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 a general transformation for combining a constant number of binary search tree data structures (BSTs) into a single BST whose running time is within a constant factor of the minimum of any \"well-behaved\" bound on the running time of the given BSTs, for any online access sequence.\n  (A BST has a well behaved bound with $f(n)$ overhead if it spends at most \\bigoh{f(n)} time per access and its bound satisfies a weak sense of closure under subsequences.) In particular, we obtain a BST data structure that is \\bigoh{\\log\\log n} competitive, satisfies the working set bound (and thus satisf","authors_text":"Erik D. Demaine, John Iacono, \\\"Ozg\\\"ur \\\"Ozkan, Stefan Langerman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-29T09:52:14Z","title":"Combining Binary Search Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.7604","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:cda431574f60f7e08d335c039b5f1a42d64688c36de17a46178ed4891a4171c4","target":"record","created_at":"2026-05-18T03:26:53Z","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":"8375885c43831638bb4fcbb941c25092f203a17bdcae9950d544a3dd72775efe","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-29T09:52:14Z","title_canon_sha256":"ae2b604419822cdb321bdf57079dfb16797398d1e5871a79852a27da10ec40ee"},"schema_version":"1.0","source":{"id":"1304.7604","kind":"arxiv","version":1}},"canonical_sha256":"1b4f918c74f64fcea8ead2097228ae401e6bd355c337ced268578be2a9ba72ea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b4f918c74f64fcea8ead2097228ae401e6bd355c337ced268578be2a9ba72ea","first_computed_at":"2026-05-18T03:26:53.544302Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:26:53.544302Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7uViC/U2hmpFAR/5a78pFdHB/bmfzdKD48q3IgCHgzpfymjNUnHd60bdAsWMlID1kFWmQDJEefHFQ5nBmfuxBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:26:53.545269Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.7604","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cda431574f60f7e08d335c039b5f1a42d64688c36de17a46178ed4891a4171c4","sha256:ccac3ff156425a4a361a5b8847733ce8cd8d7bdb78aa4f9f2795a0227b7d5271"],"state_sha256":"892dbf2fcb6a97d7820d076e52bfa383c2f41842782f79b021ae6b82d6fc1bdd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KChFXzVSW3kWjUay0xTpP7gnjJ2Zr3JbuIkzlzZkVl5e0A9F9hYBxVSwR8uNVSY4RIBq9Dyol3ivk3H8dJLWBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T18:11:05.525455Z","bundle_sha256":"d7da890d583dcafc7d7f2ea759a39a61d2b5f42585ee397e6dffe33b339a6399"}}