{"id":"W3101241038","doi":"","title":"Nearly-Optimal Mergesorts: Fast, Practical Sorting Methods That Optimally Adapt to Existing Runs.","year":2018,"lang":"en","type":"article","venue":"European Symposium on Algorithms","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Merge sort; Exploit; Computer science; Sorting; Overhead (engineering); Implementation; Sorting algorithm; Parallel computing; Sorting network; Algorithm; Operating system","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.002039383,0.001601384,0.0009099139,0.001282966,0.0009368307,0.001580577,0.003270176,0.001607013,0.007201441],"category_scores_gemma":[0.01067921,0.001012101,0.0008700709,0.00220011,0.001127833,0.004188862,0.002504853,0.001526729,0.004499943],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007737988,"about_ca_system_score_gemma":0.002690922,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001416673,"about_ca_topic_score_gemma":0.003362155,"domain_scores_codex":[0.9984097,0.0003474398,0.0001303407,0.0003213091,0.0005824446,0.0002086884],"domain_scores_gemma":[0.9961631,0.001343169,0.0003649464,0.001553277,0.00038651,0.0001889329],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.001380524,0.0003821287,0.003217323,0.0007151786,0.0002533878,0.0002557195,0.0006126348,0.1938774,0.03618157,0.05020875,0.02902418,0.6838912],"study_design_scores_gemma":[0.0003887854,0.0004551609,0.0006869566,0.00009677616,0.0001243005,0.0005639439,0.0002642423,0.8221321,0.03424698,0.1073015,0.03363868,0.0001006393],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04690134,0.001344218,0.924211,0.0003486302,0.0002199847,0.0002662383,0.0005576785,0.01678609,0.009364857],"genre_scores_gemma":[0.2253722,0.0006341108,0.7633585,0.000239739,0.00008695971,0.0003618277,0.001496648,0.00234766,0.006102324],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007201441,"threshold_uncertainty_score":0.02409118,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06278732108924912,"score_gpt":0.3571014157708277,"score_spread":0.2943140946815785,"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."}}