{"id":"W2951035508","doi":"10.48550/arxiv.1509.05053","title":"Array Layouts for Comparison-Based Searching","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":2,"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); Latency (audio); Binary tree; Parallel computing; Binary number; 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.001577329,0.001221765,0.001023151,0.002065672,0.001085658,0.00356821,0.003235216,0.001332583,0.03255351],"category_scores_gemma":[0.01046956,0.0008818638,0.001029965,0.004415728,0.001287477,0.007100579,0.002232191,0.001597958,0.01385851],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00152538,"about_ca_system_score_gemma":0.001729155,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001561467,"about_ca_topic_score_gemma":0.002481225,"domain_scores_codex":[0.998242,0.0004069186,0.0001995228,0.0004366984,0.0005620198,0.0001527199],"domain_scores_gemma":[0.9949378,0.001824111,0.000461678,0.001810141,0.0008337834,0.0001324138],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007077851,0.0001636429,0.001498158,0.001242614,0.00009471314,0.0002525751,0.0005053697,0.03167945,0.02710651,0.3044564,0.04957768,0.5827151],"study_design_scores_gemma":[0.0002477156,0.0007208614,0.0009562553,0.0003982505,0.0001272815,0.001166752,0.0003666409,0.1208078,0.05260177,0.4558886,0.3664963,0.0002216548],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007921093,0.003744197,0.9471664,0.000864312,0.0005825717,0.0002113511,0.001299825,0.01630162,0.02190856],"genre_scores_gemma":[0.07977864,0.00155027,0.904981,0.0006176034,0.0002280387,0.00034928,0.001353874,0.002934878,0.008206355],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03255351,"threshold_uncertainty_score":0.1089024,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1701607317119399,"score_gpt":0.242655251639003,"score_spread":0.07249451992706316,"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."}}