{"id":"W1997068591","doi":"10.1145/1162349.1162352","title":"Distribution sort with randomized cycling","year":2006,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Randomized algorithm; sort; Probabilistic logic; Out-of-core algorithm; Merge sort; Algorithm; Merge (version control); Computation; Task (project management); Parallel computing; Sorting algorithm","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.001965139,0.0005702214,0.0007308599,0.0009978171,0.001316593,0.00195614,0.002635094,0.001060981,0.005010111],"category_scores_gemma":[0.008058168,0.0005052942,0.0006759791,0.001910631,0.001563198,0.003986348,0.002718671,0.001591771,0.001320442],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002097847,"about_ca_system_score_gemma":0.003678902,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002670234,"about_ca_topic_score_gemma":0.00274465,"domain_scores_codex":[0.9980544,0.0005246471,0.0001144231,0.0003920121,0.0005929112,0.0003216589],"domain_scores_gemma":[0.9957481,0.001387144,0.0003445467,0.001669438,0.0006142578,0.0002364823],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001320321,0.0003574137,0.003233226,0.0002404902,0.00005506257,0.0001255652,0.0003497047,0.2688794,0.01745911,0.4443592,0.01097813,0.2526425],"study_design_scores_gemma":[0.0002165065,0.0002707581,0.0003059676,0.00002148125,0.00002835833,0.0001994825,0.00007506458,0.7837684,0.01889759,0.1799139,0.01625949,0.00004302628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06270707,0.0002253403,0.921627,0.0006205223,0.00009921163,0.0002421464,0.00018765,0.003984408,0.01030667],"genre_scores_gemma":[0.5850619,0.0002251835,0.4004987,0.0005426665,0.00009483475,0.0005046042,0.0005120398,0.0006164001,0.01194364],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005010111,"threshold_uncertainty_score":0.01676047,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008534024332847286,"score_gpt":0.2320190184497336,"score_spread":0.2234849941168863,"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."}}