{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:JF26QZ7KEDUDO4CGHTAUI7LI7V","short_pith_number":"pith:JF26QZ7K","schema_version":"1.0","canonical_sha256":"4975e867ea20e83770463cc1447d68fd601213f3e64d47b8279d78bc9c69e765","source":{"kind":"arxiv","id":"2211.09251","version":3},"attestation_state":"computed","paper":{"title":"On the Power of Learning-Augmented Search Trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Alicia Stepin, Jingbang Chen, Li Chen, Xinyuan Cao","submitted_at":"2022-11-16T22:50:40Z","abstract_excerpt":"We study learning-augmented binary search trees (BSTs) via Treaps with carefully designed priorities. The result is a simple search tree in which the depth of each item $x$ is determined by its predicted weight $w_x$. Specifically, each item $x$ is assigned a composite priority of $-\\lfloor\\log\\log(1/w_x)\\rfloor + U(0, 1)$ where $U(0, 1)$ is the uniform random variable. By choosing $w_x$ as the relative frequency of $x$, the resulting search trees achieve static optimality. This approach generalizes the recent learning-augmented BSTs [Lin-Luo-Woodruff ICML '22], which only work for Zipfian dis"},"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":"2211.09251","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-11-16T22:50:40Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"b4079e1e92c30da3c8e36adf6ebbde243185b208b528d3724030c8d0233b2fd4","abstract_canon_sha256":"5f8aebbc501b0c67544e2ac9fb6303fe647410b66392f6458c3089c6732789d9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:03:12.157787Z","signature_b64":"3noliZTlMRG7KQrralJsNAwv55lLoVoYvLw41mjdobvVuKEDo1Zn4NK6SwjrnjaijA4nkh1B/mZ13ALqyo9SCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4975e867ea20e83770463cc1447d68fd601213f3e64d47b8279d78bc9c69e765","last_reissued_at":"2026-07-05T11:03:12.157394Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:03:12.157394Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Power of Learning-Augmented Search Trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Alicia Stepin, Jingbang Chen, Li Chen, Xinyuan Cao","submitted_at":"2022-11-16T22:50:40Z","abstract_excerpt":"We study learning-augmented binary search trees (BSTs) via Treaps with carefully designed priorities. The result is a simple search tree in which the depth of each item $x$ is determined by its predicted weight $w_x$. Specifically, each item $x$ is assigned a composite priority of $-\\lfloor\\log\\log(1/w_x)\\rfloor + U(0, 1)$ where $U(0, 1)$ is the uniform random variable. By choosing $w_x$ as the relative frequency of $x$, the resulting search trees achieve static optimality. This approach generalizes the recent learning-augmented BSTs [Lin-Luo-Woodruff ICML '22], which only work for Zipfian dis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.09251","kind":"arxiv","version":3},"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/2211.09251/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":"2211.09251","created_at":"2026-07-05T11:03:12.157450+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.09251v3","created_at":"2026-07-05T11:03:12.157450+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.09251","created_at":"2026-07-05T11:03:12.157450+00:00"},{"alias_kind":"pith_short_12","alias_value":"JF26QZ7KEDUD","created_at":"2026-07-05T11:03:12.157450+00:00"},{"alias_kind":"pith_short_16","alias_value":"JF26QZ7KEDUDO4CG","created_at":"2026-07-05T11:03:12.157450+00:00"},{"alias_kind":"pith_short_8","alias_value":"JF26QZ7K","created_at":"2026-07-05T11:03:12.157450+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/JF26QZ7KEDUDO4CGHTAUI7LI7V","json":"https://pith.science/pith/JF26QZ7KEDUDO4CGHTAUI7LI7V.json","graph_json":"https://pith.science/api/pith-number/JF26QZ7KEDUDO4CGHTAUI7LI7V/graph.json","events_json":"https://pith.science/api/pith-number/JF26QZ7KEDUDO4CGHTAUI7LI7V/events.json","paper":"https://pith.science/paper/JF26QZ7K"},"agent_actions":{"view_html":"https://pith.science/pith/JF26QZ7KEDUDO4CGHTAUI7LI7V","download_json":"https://pith.science/pith/JF26QZ7KEDUDO4CGHTAUI7LI7V.json","view_paper":"https://pith.science/paper/JF26QZ7K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.09251&json=true","fetch_graph":"https://pith.science/api/pith-number/JF26QZ7KEDUDO4CGHTAUI7LI7V/graph.json","fetch_events":"https://pith.science/api/pith-number/JF26QZ7KEDUDO4CGHTAUI7LI7V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JF26QZ7KEDUDO4CGHTAUI7LI7V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JF26QZ7KEDUDO4CGHTAUI7LI7V/action/storage_attestation","attest_author":"https://pith.science/pith/JF26QZ7KEDUDO4CGHTAUI7LI7V/action/author_attestation","sign_citation":"https://pith.science/pith/JF26QZ7KEDUDO4CGHTAUI7LI7V/action/citation_signature","submit_replication":"https://pith.science/pith/JF26QZ7KEDUDO4CGHTAUI7LI7V/action/replication_record"}},"created_at":"2026-07-05T11:03:12.157450+00:00","updated_at":"2026-07-05T11:03:12.157450+00:00"}