{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0009549098,0.0008593409,0.001298742,0.00007057546,0.0008352665,0.0001272659,0.0004632643,0.001947957,0.0002433259],"category_scores_gemma":[0.00007695199,0.0007217708,0.001422,0.00001686494,0.0006791217,0.00002922333,0.0003516476,0.0006553649,0.000007498123],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007087724,"about_ca_system_score_gemma":0.000133012,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.989799e-7,"about_ca_topic_score_gemma":7.423175e-7,"domain_scores_codex":[0.997125,0.000004926477,0.001043885,0.000741159,0.0004479778,0.0006370773],"domain_scores_gemma":[0.9969605,0.00116268,0.0008222251,0.0006725324,0.0001804577,0.0002016097],"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.0001143194,0.00002669401,4.468687e-8,0.0009550607,0.0007996974,2.945185e-7,0.004730084,1.174263e-7,0.00004410611,0.888288,0.1013893,0.003652232],"study_design_scores_gemma":[0.002087614,0.0002297154,7.284311e-9,0.0002304532,0.0009117881,0.00000744183,0.0007595372,0.0001042425,0.0008198016,0.8496825,0.1444353,0.0007316745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.00426251,0.0001696596,0.06655186,0.0001811449,0.001847002,0.01258171,0.003474056,0.0005183067,0.9104137],"genre_scores_gemma":[0.0009740486,0.00005117522,0.3203762,0.0007193275,0.007040637,0.00090658,0.0001527035,0.0006481543,0.6691312],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.2538243,"threshold_uncertainty_score":0.9995233,"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."}}