{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:DNHZDDDU6ZH45KHK2IEXEKFOIA","short_pith_number":"pith:DNHZDDDU","schema_version":"1.0","canonical_sha256":"1b4f918c74f64fcea8ead2097228ae401e6bd355c337ced268578be2a9ba72ea","source":{"kind":"arxiv","id":"1304.7604","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1304.7604","created_at":"2026-05-18T03:26:53.544482+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.7604v1","created_at":"2026-05-18T03:26:53.544482+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.7604","created_at":"2026-05-18T03:26:53.544482+00:00"},{"alias_kind":"pith_short_12","alias_value":"DNHZDDDU6ZH4","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"DNHZDDDU6ZH45KHK","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"DNHZDDDU","created_at":"2026-05-18T12:27:43.054852+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/DNHZDDDU6ZH45KHK2IEXEKFOIA","json":"https://pith.science/pith/DNHZDDDU6ZH45KHK2IEXEKFOIA.json","graph_json":"https://pith.science/api/pith-number/DNHZDDDU6ZH45KHK2IEXEKFOIA/graph.json","events_json":"https://pith.science/api/pith-number/DNHZDDDU6ZH45KHK2IEXEKFOIA/events.json","paper":"https://pith.science/paper/DNHZDDDU"},"agent_actions":{"view_html":"https://pith.science/pith/DNHZDDDU6ZH45KHK2IEXEKFOIA","download_json":"https://pith.science/pith/DNHZDDDU6ZH45KHK2IEXEKFOIA.json","view_paper":"https://pith.science/paper/DNHZDDDU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.7604&json=true","fetch_graph":"https://pith.science/api/pith-number/DNHZDDDU6ZH45KHK2IEXEKFOIA/graph.json","fetch_events":"https://pith.science/api/pith-number/DNHZDDDU6ZH45KHK2IEXEKFOIA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DNHZDDDU6ZH45KHK2IEXEKFOIA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DNHZDDDU6ZH45KHK2IEXEKFOIA/action/storage_attestation","attest_author":"https://pith.science/pith/DNHZDDDU6ZH45KHK2IEXEKFOIA/action/author_attestation","sign_citation":"https://pith.science/pith/DNHZDDDU6ZH45KHK2IEXEKFOIA/action/citation_signature","submit_replication":"https://pith.science/pith/DNHZDDDU6ZH45KHK2IEXEKFOIA/action/replication_record"}},"created_at":"2026-05-18T03:26:53.544482+00:00","updated_at":"2026-05-18T03:26:53.544482+00:00"}