{"id":"W1979499253","doi":"","title":"Dynamic optimality for skip lists and B-trees","year":2008,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Upper and lower bounds; Binary tree; Computer science; Binary search tree; Tree (set theory); Set (abstract data type); Weight-balanced tree; Branching (polymer chemistry); Combinatorics; Class (philosophy); Sequence (biology); Optimal binary search tree; Context (archaeology); Search tree; Ternary search tree; Binary number; Binary decision diagram; Discrete mathematics; Theoretical computer science; Mathematics; Interval tree; Algorithm; Search algorithm; Tree structure; Arithmetic; Artificial intelligence","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001212611,0.00004782564,0.00006050107,0.00003253181,0.0001232395,0.00005493621,0.0001959491,0.00002190947,0.00001806704],"category_scores_gemma":[0.00002450594,0.00003950932,0.00001985129,0.00009122207,0.00004287806,0.0002505771,0.0000907029,0.0000282422,0.000008184326],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008610756,"about_ca_system_score_gemma":0.00002799375,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000163825,"about_ca_topic_score_gemma":0.00002590337,"domain_scores_codex":[0.9995128,0.00001553763,0.00008128793,0.0001744572,0.00008512466,0.0001308268],"domain_scores_gemma":[0.9996402,0.0000502523,0.00001548704,0.0001707842,0.00005646961,0.00006679334],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003492996,0.0004716878,0.01346866,0.0001250457,0.0000607248,0.00003093467,0.004690917,0.01368295,0.001067728,0.8589048,0.02505253,0.08240903],"study_design_scores_gemma":[0.0002607823,0.00004982541,0.006499034,0.000002021317,5.167116e-7,0.00001528278,0.000005546794,0.9883134,0.00007386005,0.001814601,0.002890385,0.00007477407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007285806,0.00003876783,0.9862455,0.00153652,0.00004272809,0.0001577152,0.000001351424,0.0001127413,0.004578852],"genre_scores_gemma":[0.434523,0.00006446765,0.5602877,0.0003548953,0.000005522968,0.00001384943,0.000002268977,0.000003097687,0.004745232],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9746304,"threshold_uncertainty_score":0.1611143,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02942393810886324,"score_gpt":0.2859440844393497,"score_spread":0.2565201463304865,"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."}}