{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004849723,0.0002926457,0.0003875695,0.0002182129,0.0002221897,0.0002392736,0.002516877,0.0002260279,0.000008522373],"category_scores_gemma":[0.00005205251,0.0003097962,0.0001950316,0.0002880256,0.00007066415,0.0003710406,0.001637615,0.0005336002,0.00004889467],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001846843,"about_ca_system_score_gemma":0.0005843279,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001345839,"about_ca_topic_score_gemma":0.00002419193,"domain_scores_codex":[0.9980133,0.0001313476,0.000204267,0.001092564,0.0001473257,0.0004112036],"domain_scores_gemma":[0.9975151,0.0002147606,0.0002413961,0.001460474,0.0002829248,0.0002852998],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001314505,0.0002957357,0.002206784,0.0002044898,0.00008978989,0.00009800483,0.0004598384,0.9193427,0.00008550517,0.05871829,0.01382549,0.004541949],"study_design_scores_gemma":[0.0006690631,0.00008239086,0.0001162576,0.0001060735,0.00002610292,7.141436e-7,0.00003736009,0.9670902,0.0002641674,0.02448949,0.006739718,0.0003785007],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01585808,0.00006915515,0.9812577,0.0001313613,0.0007889495,0.0004182871,0.0000977142,0.00028409,0.001094625],"genre_scores_gemma":[0.9427459,0.000007872551,0.05643735,0.0001061905,0.0001410254,0.00000243438,0.0001345788,0.00001986277,0.0004048168],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9268878,"threshold_uncertainty_score":0.9999354,"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."}}