{"id":"W2220328383","doi":"10.1145/3053370","title":"Array Layouts for Comparison-Based Searching","year":2017,"lang":"en","type":"article","venue":"ACM Journal of Experimental Algorithmics","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Cache; Binary search algorithm; Value (mathematics); Parallel computing; Binary tree; Binary number; Latency (audio); Algorithm; Search algorithm; Arithmetic; Mathematics","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.001444467,0.00109068,0.0009014493,0.00173974,0.0009955771,0.002910432,0.002823073,0.001176421,0.0270891],"category_scores_gemma":[0.01030409,0.0007366525,0.000814827,0.004315272,0.001115202,0.006000708,0.001902532,0.001370347,0.01142218],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001341147,"about_ca_system_score_gemma":0.001582006,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001199882,"about_ca_topic_score_gemma":0.001982459,"domain_scores_codex":[0.9983657,0.0004296208,0.0001770696,0.0003461551,0.00054638,0.0001349843],"domain_scores_gemma":[0.9951454,0.001754327,0.0004218521,0.001744248,0.0008130016,0.0001211793],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0006932633,0.0001739525,0.001340894,0.001069001,0.00008456983,0.0002294142,0.0003851129,0.04103215,0.02645071,0.3475991,0.04319296,0.5377489],"study_design_scores_gemma":[0.0002702942,0.0007623711,0.0008065517,0.0002889437,0.000108912,0.001018321,0.0002872928,0.1353342,0.04996468,0.5146514,0.2963261,0.000180986],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006703267,0.002723938,0.9609267,0.0006575514,0.0004611314,0.0001900565,0.001041091,0.01019318,0.01710323],"genre_scores_gemma":[0.07988312,0.001281188,0.9078268,0.0004929058,0.0001901128,0.0003825683,0.001053291,0.00188333,0.007006536],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0270891,"threshold_uncertainty_score":0.09062201,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05509203364200714,"score_gpt":0.3722407228452136,"score_spread":0.3171486892032064,"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."}}