{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:7KQJTIEUB3OZDMVVXFU7S64L4Z","short_pith_number":"pith:7KQJTIEU","schema_version":"1.0","canonical_sha256":"faa099a0940edd91b2b5b969f97b8be66040aa423ba9d0c34b510b3d0fec4700","source":{"kind":"arxiv","id":"2411.14387","version":1},"attestation_state":"computed","paper":{"title":"Hardness Amplification for Dynamic Binary Search Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Omri Weinstein, Shunhua Jiang, Sorrachai Yingchareonthawornchai, Victor Lecomte","submitted_at":"2024-11-21T18:23:28Z","abstract_excerpt":"We prove direct-sum theorems for Wilber's two lower bounds [Wilber, FOCS'86] on the cost of access sequences in the binary search tree (BST) model. These bounds are central to the question of dynamic optimality [Sleator and Tarjan, JACM'85]: the Alternation bound is the only bound to have yielded online BST algorithms beating $\\log n$ competitive ratio, while the Funnel bound has repeatedly been conjectured to exactly characterize the cost of executing an access sequence using the optimal tree [Wilber, FOCS'86, Kozma'16], and has been explicitly linked to splay trees [Levy and Tarjan, SODA'19]"},"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":"2411.14387","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-11-21T18:23:28Z","cross_cats_sorted":[],"title_canon_sha256":"3c76102d333ddda8a8838771ec3f1483ff74aa51d697d5f96e90202e842ad30a","abstract_canon_sha256":"dce04825e3275b647172406dda6546ea9ff70cfe3004b24f01753d41bf94a63a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:38:46.213393Z","signature_b64":"5YSfLX11eMdPq9vh3pZsRimwHXvGE0pfb0lnF/AbB/OLSK9rPk82efzkIhbuouxS3SyYSAbX5qcb4vCOKoDVBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"faa099a0940edd91b2b5b969f97b8be66040aa423ba9d0c34b510b3d0fec4700","last_reissued_at":"2026-07-05T09:38:46.212797Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:38:46.212797Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hardness Amplification for Dynamic Binary Search Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Omri Weinstein, Shunhua Jiang, Sorrachai Yingchareonthawornchai, Victor Lecomte","submitted_at":"2024-11-21T18:23:28Z","abstract_excerpt":"We prove direct-sum theorems for Wilber's two lower bounds [Wilber, FOCS'86] on the cost of access sequences in the binary search tree (BST) model. These bounds are central to the question of dynamic optimality [Sleator and Tarjan, JACM'85]: the Alternation bound is the only bound to have yielded online BST algorithms beating $\\log n$ competitive ratio, while the Funnel bound has repeatedly been conjectured to exactly characterize the cost of executing an access sequence using the optimal tree [Wilber, FOCS'86, Kozma'16], and has been explicitly linked to splay trees [Levy and Tarjan, SODA'19]"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.14387","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.14387/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2411.14387","created_at":"2026-07-05T09:38:46.212859+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.14387v1","created_at":"2026-07-05T09:38:46.212859+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.14387","created_at":"2026-07-05T09:38:46.212859+00:00"},{"alias_kind":"pith_short_12","alias_value":"7KQJTIEUB3OZ","created_at":"2026-07-05T09:38:46.212859+00:00"},{"alias_kind":"pith_short_16","alias_value":"7KQJTIEUB3OZDMVV","created_at":"2026-07-05T09:38:46.212859+00:00"},{"alias_kind":"pith_short_8","alias_value":"7KQJTIEU","created_at":"2026-07-05T09:38:46.212859+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/7KQJTIEUB3OZDMVVXFU7S64L4Z","json":"https://pith.science/pith/7KQJTIEUB3OZDMVVXFU7S64L4Z.json","graph_json":"https://pith.science/api/pith-number/7KQJTIEUB3OZDMVVXFU7S64L4Z/graph.json","events_json":"https://pith.science/api/pith-number/7KQJTIEUB3OZDMVVXFU7S64L4Z/events.json","paper":"https://pith.science/paper/7KQJTIEU"},"agent_actions":{"view_html":"https://pith.science/pith/7KQJTIEUB3OZDMVVXFU7S64L4Z","download_json":"https://pith.science/pith/7KQJTIEUB3OZDMVVXFU7S64L4Z.json","view_paper":"https://pith.science/paper/7KQJTIEU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.14387&json=true","fetch_graph":"https://pith.science/api/pith-number/7KQJTIEUB3OZDMVVXFU7S64L4Z/graph.json","fetch_events":"https://pith.science/api/pith-number/7KQJTIEUB3OZDMVVXFU7S64L4Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7KQJTIEUB3OZDMVVXFU7S64L4Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7KQJTIEUB3OZDMVVXFU7S64L4Z/action/storage_attestation","attest_author":"https://pith.science/pith/7KQJTIEUB3OZDMVVXFU7S64L4Z/action/author_attestation","sign_citation":"https://pith.science/pith/7KQJTIEUB3OZDMVVXFU7S64L4Z/action/citation_signature","submit_replication":"https://pith.science/pith/7KQJTIEUB3OZDMVVXFU7S64L4Z/action/replication_record"}},"created_at":"2026-07-05T09:38:46.212859+00:00","updated_at":"2026-07-05T09:38:46.212859+00:00"}