{"id":"W3176592665","doi":"10.1145/3453483.3454089","title":"Phased synthesis of divide and conquer programs","year":2021,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Divide and conquer algorithms; Computer science; Implementation; Function (biology); Set (abstract data type); Task (project management); Theoretical computer science; Computation; Parallel computing; Algorithm; Computer engineering; Programming language","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":[],"consensus_categories":[],"category_scores_codex":[0.0002283644,0.00003656966,0.00007282438,0.00001808299,0.00001886215,0.00003676928,0.0001524214,0.00002063781,0.00001754972],"category_scores_gemma":[0.0001864882,0.00003108719,0.00001536565,0.0001539876,0.00003998021,0.0001823205,0.00005936257,0.00002311285,0.000003659906],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004524872,"about_ca_system_score_gemma":0.00002386253,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008226019,"about_ca_topic_score_gemma":0.00000167589,"domain_scores_codex":[0.999536,0.00006197162,0.0001042013,0.0001344157,0.00009230559,0.00007111787],"domain_scores_gemma":[0.9995075,0.0000901657,0.00003550959,0.0002696656,0.00006933951,0.00002786193],"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.000001417354,0.00005971611,0.0009816722,0.00002298193,0.000008362331,0.000001941001,0.0001216992,6.993234e-7,0.01855637,0.2715198,0.00003866503,0.7086867],"study_design_scores_gemma":[0.00009941115,0.00002937706,0.003171101,0.00001814425,0.000005041417,0.00001300158,0.00002686593,0.008659041,0.9810379,0.003105891,0.003760649,0.00007363036],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0171046,0.00007802557,0.9725738,0.0002777466,0.00006790951,0.0000543149,2.752372e-7,0.00005213748,0.009791153],"genre_scores_gemma":[0.4226562,0.000006406306,0.5771698,0.00003843,0.000004560124,0.000007723579,2.148006e-7,0.000001334962,0.0001153246],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9624815,"threshold_uncertainty_score":0.1267699,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03161390019939872,"score_gpt":0.2848018162148728,"score_spread":0.2531879160154741,"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."}}