{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003265097,0.0005006348,0.0004900008,0.0001826095,0.0005738501,0.0009485209,0.001526053,0.00009041795,0.00004793292],"category_scores_gemma":[0.0003086722,0.0004627549,0.0001864565,0.0007614041,0.0001337584,0.0008184049,0.0008590441,0.000494956,0.001311107],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001039393,"about_ca_system_score_gemma":0.0001066026,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003214493,"about_ca_topic_score_gemma":0.000001809051,"domain_scores_codex":[0.9949423,0.001028602,0.0008170123,0.001376461,0.0008099027,0.00102572],"domain_scores_gemma":[0.9970486,0.0002677461,0.0004203893,0.001336989,0.0003394637,0.0005868016],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002363794,0.0009986813,0.0002152773,0.00008328574,0.0003430681,0.002086154,0.01415242,0.00678004,0.0456804,0.04238156,0.05765399,0.8293887],"study_design_scores_gemma":[0.001212645,0.002134018,0.001718376,0.0004326658,0.00004637743,0.0005064373,0.0004596751,0.4097053,0.01564169,0.00005306323,0.5662604,0.001829425],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001231872,0.00004840893,0.8655875,0.003063328,0.001736668,0.0003298886,0.0000141657,0.0005843408,0.1274038],"genre_scores_gemma":[0.1067205,0.000007125393,0.8875043,0.001578796,0.00159206,0.00002088778,0.000007592433,0.00009450338,0.002474225],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8275594,"threshold_uncertainty_score":0.9997824,"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."}}