{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001045343,0.0006645853,0.0006596304,0.00129513,0.0003962937,0.000829624,0.003960813,0.0003990433,0.0000979258],"category_scores_gemma":[0.0001019453,0.0006084444,0.000171063,0.0007831681,0.0006522019,0.0004598582,0.0008909738,0.001271012,0.0003087443],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004715023,"about_ca_system_score_gemma":0.0009293812,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002641919,"about_ca_topic_score_gemma":0.00008972416,"domain_scores_codex":[0.9946288,0.00007364657,0.0006905333,0.001870149,0.001701082,0.001035791],"domain_scores_gemma":[0.996586,0.0006738345,0.000323948,0.001706184,0.0003435081,0.0003665597],"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.000003746832,0.00007686049,0.00002643302,0.00001308777,0.000005257803,0.00003800772,0.0002779146,0.5019386,0.000008913331,0.004247311,0.0001032756,0.4932606],"study_design_scores_gemma":[0.0005424886,0.0002994175,0.00006369335,0.0002695879,0.000003915382,0.00001336747,7.555534e-8,0.9861614,0.0005326963,0.006117547,0.005305945,0.0006898597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000009891301,0.0002487698,0.9892107,0.002271128,0.00127337,0.0006014204,0.000009814511,0.000336348,0.006038533],"genre_scores_gemma":[0.07806682,0.00004049464,0.9144721,0.005831146,0.0005441136,0.00002213192,0.00002165264,0.00006382328,0.0009377329],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4925707,"threshold_uncertainty_score":0.9996367,"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."}}