{"id":"W4206308010","doi":"10.1137/1.9781611977073.78","title":"Selectable Heaps and Optimal Lazy Search Trees","year":2022,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Heap (data structure); Priority queue; Amortized analysis; Merge (version control); Combinatorics; Queue; Binary logarithm; Binary search tree; Data structure; Mathematics; Time complexity; Computer science; Discrete mathematics; Parallel computing; Algorithm; Binary tree; Programming language","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001017119,0.0003819531,0.0006033145,0.0009903762,0.0008219974,0.002344795,0.002018559,0.0005894987,0.003698442],"category_scores_gemma":[0.004603147,0.0005175442,0.0005986645,0.001818215,0.0013878,0.004892876,0.001820116,0.001135674,0.001298924],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001189311,"about_ca_system_score_gemma":0.001590162,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001367338,"about_ca_topic_score_gemma":0.002494129,"domain_scores_codex":[0.9985475,0.0001790169,0.0001869035,0.000269191,0.0005726693,0.0002446776],"domain_scores_gemma":[0.9977558,0.000824814,0.0003631107,0.0007177116,0.0002413025,0.00009724218],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001160171,0.0002490459,0.004162274,0.0007185009,0.00008588634,0.0002454892,0.0006615433,0.07229783,0.04550311,0.3953631,0.008930541,0.4706225],"study_design_scores_gemma":[0.0003048623,0.0006268257,0.001644231,0.0001567022,0.0001700827,0.0005402446,0.0002998335,0.3941266,0.08121819,0.4783996,0.04236044,0.0001524203],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09226381,0.001432888,0.8927423,0.0003661831,0.00008779958,0.0001159378,0.0004635583,0.005150565,0.007376958],"genre_scores_gemma":[0.357506,0.0006129255,0.6355728,0.000190491,0.00009458056,0.0002640005,0.0006328977,0.0006488442,0.004477497],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003698442,"threshold_uncertainty_score":0.01237249,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05916056070832934,"score_gpt":0.24760370635386,"score_spread":0.1884431456455307,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}