{"id":"W2626245353","doi":"10.1145/3062341.3062355","title":"Synthesis of divide and conquer parallelism for loops","year":2017,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Ontario Ministry of Research, Innovation and Science","keywords":"Divide and conquer algorithms; Computer science; Joins; Parallel computing; Programmer; Traverse; Code (set theory); Parallelism (grammar); Programming language; Code generation; Theoretical computer science; Operating system; Set (abstract data type)","routes":{"ca_aff":true,"ca_fund":true,"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.0002033108,0.00005672514,0.0001177498,0.000030983,0.0001790576,0.0001255115,0.0005550414,0.00003274264,0.000003153712],"category_scores_gemma":[0.0002094769,0.00004691624,0.00002852722,0.00001524295,0.0000607579,0.0001997602,0.0002047691,0.00002039978,0.000001106598],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002780294,"about_ca_system_score_gemma":0.00001354084,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003574715,"about_ca_topic_score_gemma":0.000002491917,"domain_scores_codex":[0.9995563,0.00001289375,0.0001164561,0.0001575866,0.00006135047,0.00009540162],"domain_scores_gemma":[0.9991524,0.0001623042,0.0001132589,0.0004677554,0.00007148674,0.00003285827],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001347858,0.00007072424,0.004634748,0.00007644055,0.00004668039,0.00000207059,0.000276856,0.0005138272,0.0003988507,0.7785409,0.01848844,0.196937],"study_design_scores_gemma":[0.0007532829,0.0001623072,0.01798055,0.0001096044,0.00002171521,0.00001146044,0.000009968784,0.770345,0.1127667,0.08315826,0.01417891,0.0005021791],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001606094,0.00004089013,0.9886951,0.00117987,0.00004649796,0.0001008852,9.481049e-7,0.0001154877,0.008214261],"genre_scores_gemma":[0.6625789,0.00002805442,0.3368215,0.0000813289,0.00001253186,0.0000124328,1.755424e-7,0.000002468414,0.0004626146],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7698312,"threshold_uncertainty_score":0.1913189,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02488637193809053,"score_gpt":0.2847567466395196,"score_spread":0.259870374701429,"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."}}