{"id":"W3000335563","doi":"10.1145/3332466.3374542","title":"Non-blocking interpolation search trees with doubly-logarithmic running time","year":2020,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"FP7 Ideas: European Research Council; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Blocking (statistics); Interpolation (computer graphics); Logarithm; Computer science; Key (lock); Algorithm; Running time; Mathematics; Artificial intelligence; Computer network","routes":{"ca_aff":true,"ca_fund":true,"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.001575498,0.000909496,0.00082291,0.0009566484,0.0008618594,0.001465345,0.001914492,0.0006800357,0.009140317],"category_scores_gemma":[0.00737778,0.0004912351,0.0007085766,0.003023539,0.0007570137,0.004227101,0.001784797,0.001309876,0.003678792],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009012449,"about_ca_system_score_gemma":0.003409663,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002052595,"about_ca_topic_score_gemma":0.004871905,"domain_scores_codex":[0.9987105,0.0002295265,0.0001362128,0.0002052534,0.0004621179,0.0002562987],"domain_scores_gemma":[0.9957931,0.001998844,0.0004088609,0.0009745559,0.0006298792,0.0001947988],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002158089,0.0006871931,0.00367951,0.001392516,0.0001296891,0.0001810116,0.000438945,0.11866,0.0337899,0.1719753,0.02259169,0.6443162],"study_design_scores_gemma":[0.0005219758,0.0006893636,0.0007693789,0.0001287438,0.0001090403,0.0003697601,0.000164234,0.7239653,0.02493517,0.2257287,0.02254454,0.00007378485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03701225,0.001372499,0.9425828,0.0003654345,0.0001119163,0.0002515731,0.0005910846,0.00517551,0.01253694],"genre_scores_gemma":[0.2904559,0.0007652732,0.6968341,0.0002105306,0.00009648672,0.0005456964,0.002009553,0.0008059857,0.008276411],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009140317,"threshold_uncertainty_score":0.03057742,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01982339414437483,"score_gpt":0.2524205885531453,"score_spread":0.2325971944087704,"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."}}