{"id":"W1573954828","doi":"10.1007/11561071_29","title":"Cache-Oblivious Comparison-Based Algorithms on Multisets","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Cache; Cache algorithms; Block (permutation group theory); CPU cache; Randomized algorithm; Context (archaeology); Cache-oblivious algorithm; Factor (programming language); Block size; Constant (computer programming); Algorithm; Upper and lower bounds; Parallel computing; Mathematics; Key (lock); Combinatorics","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.002176337,0.001264431,0.00282687,0.002245526,0.002585519,0.003044814,0.00528889,0.00190247,0.01103293],"category_scores_gemma":[0.009934993,0.001259179,0.001386872,0.006531599,0.001940493,0.009925185,0.005566577,0.003431019,0.002426378],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002574633,"about_ca_system_score_gemma":0.002288966,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001650765,"about_ca_topic_score_gemma":0.002759269,"domain_scores_codex":[0.9970018,0.0007195842,0.0002229008,0.0005427295,0.001103945,0.0004091316],"domain_scores_gemma":[0.991916,0.003725523,0.0003547241,0.00311154,0.000690133,0.0002020908],"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.002353983,0.0004148822,0.0009431067,0.000705571,0.0002070561,0.0001475733,0.0005130845,0.1680058,0.01179785,0.2311562,0.02951518,0.5542397],"study_design_scores_gemma":[0.0002143412,0.0002689493,0.0003168552,0.0000969964,0.00009812367,0.0002411899,0.00009875435,0.5061718,0.01143625,0.4710662,0.009936133,0.00005437047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04932858,0.002798893,0.9255091,0.0007661694,0.0003617494,0.0002132412,0.0004402549,0.005820585,0.01476146],"genre_scores_gemma":[0.3485007,0.0007911558,0.6328394,0.0004170202,0.0002500863,0.0004845088,0.0008760554,0.001096134,0.01474496],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01103293,"threshold_uncertainty_score":0.03690886,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03047518635121663,"score_gpt":0.2883903574020444,"score_spread":0.2579151710508278,"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."}}