{"id":"W2607184796","doi":"10.1137/1.9781611975062.2","title":"Quicksort Is Optimal For Many Equal Keys","year":2018,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quicksort; Combinatorics; Constant (computer programming); Mathematics; Sorting; Conjecture; Asymptotically optimal algorithm; Upper and lower bounds; Value (mathematics); Discrete mathematics; Sorting algorithm; Algorithm; Computer science; Statistics; Mathematical analysis","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.00323823,0.001286352,0.002442838,0.001373279,0.002513648,0.006109083,0.002701943,0.002250593,0.01753625],"category_scores_gemma":[0.02997059,0.001102202,0.001787077,0.003139093,0.003280846,0.01908496,0.003847369,0.003544618,0.004136721],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004061437,"about_ca_system_score_gemma":0.003558559,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001265471,"about_ca_topic_score_gemma":0.001616317,"domain_scores_codex":[0.99419,0.0008072383,0.0003799511,0.001905727,0.00141523,0.001301929],"domain_scores_gemma":[0.9768732,0.01465319,0.001456262,0.004856571,0.001379111,0.0007816757],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.003680721,0.0006133838,0.005824993,0.001860023,0.0003401042,0.0003815825,0.0009200574,0.1060137,0.02207867,0.5905185,0.03871734,0.2290509],"study_design_scores_gemma":[0.0002189521,0.000479795,0.0007386598,0.0001668778,0.000195442,0.0008181273,0.0003812751,0.1391686,0.01783179,0.8231688,0.01672979,0.0001020425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.497061,0.005621649,0.402453,0.005719691,0.0008788033,0.0002681602,0.001904356,0.005424256,0.08066908],"genre_scores_gemma":[0.855939,0.001648723,0.1205076,0.0014376,0.0004240534,0.000221969,0.001228452,0.001372642,0.01722],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.01753625,"threshold_uncertainty_score":0.05866462,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1073360535337749,"score_gpt":0.296285575397509,"score_spread":0.1889495218637341,"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."}}