{"id":"W3093219505","doi":"","title":"Lazy Search Trees","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Binary search tree; Data structure; Priority queue; Binary logarithm; Log-log plot; Mathematics; Merge (version control); Upper and lower bounds; Partition (number theory); Pointer (user interface); Time complexity; Sequence (biology); Binary tree; Computer science; Discrete mathematics; Queue; Parallel computing","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001337817,0.0002499639,0.0002729679,0.0001432164,0.0001534733,0.0001951573,0.002940444,0.0002051751,0.0000506264],"category_scores_gemma":[0.00001598439,0.0002649279,0.0001604761,0.0004727963,0.00007092191,0.0004251218,0.006810618,0.0006595868,0.0003169577],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008737874,"about_ca_system_score_gemma":0.0001987994,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002270267,"about_ca_topic_score_gemma":0.00001758576,"domain_scores_codex":[0.9981217,0.0001199799,0.0001361334,0.001179542,0.0001313314,0.0003113251],"domain_scores_gemma":[0.9981201,0.0000670086,0.0000987528,0.001367739,0.00009567053,0.0002507209],"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.00007121568,0.0002741762,0.00275352,0.0001971189,0.000211191,0.002975372,0.0009736216,0.1814869,0.0003129904,0.7781506,0.01494697,0.0176463],"study_design_scores_gemma":[0.0002957083,0.00004955581,0.001700562,0.00006629204,0.00002048181,0.000003310636,0.00003646759,0.9610776,0.0001772718,0.03067199,0.005513325,0.0003873862],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0272491,0.00007651324,0.9671761,0.0004630653,0.0005205038,0.0001796586,0.00003998592,0.0003844711,0.003910581],"genre_scores_gemma":[0.9904545,0.00016248,0.007808901,0.0001597472,0.0001519097,4.147753e-7,0.00004034838,0.00001436848,0.001207339],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9632054,"threshold_uncertainty_score":0.9999803,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1268476958281181,"score_gpt":0.2040472924003642,"score_spread":0.07719959657224607,"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."}}