{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001728247,0.0007406147,0.001527076,0.002272281,0.0020195,0.004476123,0.002872151,0.001460065,0.01240113],"category_scores_gemma":[0.009299477,0.000823952,0.001248085,0.003863475,0.002042249,0.01170704,0.004601347,0.002547951,0.005807836],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002176896,"about_ca_system_score_gemma":0.002839762,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003137402,"about_ca_topic_score_gemma":0.004272659,"domain_scores_codex":[0.9965681,0.0005588768,0.0003445602,0.0006254168,0.001432283,0.0004708367],"domain_scores_gemma":[0.9963573,0.001152069,0.0003330423,0.001221458,0.0006599944,0.0002760699],"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.0004737515,0.0002232572,0.00266719,0.0006025474,0.00009084766,0.0002427011,0.0007624605,0.03266966,0.00686457,0.6168273,0.04586188,0.2927139],"study_design_scores_gemma":[0.0001492621,0.0002544124,0.0004160263,0.0001690828,0.00007378779,0.0004571417,0.0002189014,0.1540753,0.006321305,0.6891305,0.1486377,0.00009658038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02216428,0.00403491,0.9408719,0.001610609,0.0005127991,0.0003555696,0.002050375,0.008800327,0.01959917],"genre_scores_gemma":[0.2478567,0.003026028,0.7160386,0.001512223,0.0006049231,0.0007192569,0.004243363,0.002014112,0.02398488],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01240113,"threshold_uncertainty_score":0.04148591,"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."}}