{"id":"W3156620473","doi":"10.1145/3473593","title":"Getting to the point: index sets and parallelism-preserving autodiff for pointful array programming","year":2021,"lang":"en","type":"preprint","venue":"Proceedings of the ACM on Programming Languages","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto; Google (Canada)","funders":"","keywords":"Computer science; Parallelism (grammar); Search engine indexing; Benchmark (surveying); Associative property; Programming language; Parallel computing; Functional programming; Data parallelism; Programming style; Implicit parallelism; Function (biology); Point (geometry); Array data structure; Mathematics; Artificial intelligence","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","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.001784519,0.0005109006,0.0005716433,0.0002228701,0.0005536402,0.001751434,0.006688559,0.0002851293,0.000001496269],"category_scores_gemma":[0.004011482,0.0003455862,0.0003097889,0.0005777995,0.0001093543,0.0002819416,0.009465948,0.0008172315,7.004749e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007437402,"about_ca_system_score_gemma":0.0000962062,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00010177,"about_ca_topic_score_gemma":0.00001141834,"domain_scores_codex":[0.9968601,0.00005480791,0.0006437496,0.001120723,0.0006264375,0.0006941074],"domain_scores_gemma":[0.9964449,0.0003624161,0.000820064,0.001592519,0.0006387988,0.0001412824],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001091344,0.0004803954,0.005560561,0.004044394,0.0005238885,0.000009086668,0.04932405,0.006310177,0.003380245,0.008866552,0.01020351,0.911188],"study_design_scores_gemma":[0.006506317,0.003667565,0.01937598,0.03844612,0.001203379,0.0005867733,0.0413788,0.3474248,0.2940351,0.1200742,0.1146276,0.01267336],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.335123,0.004840177,0.5444992,0.09717654,0.001482999,0.01162049,0.00002706215,0.003815251,0.001415351],"genre_scores_gemma":[0.3514495,0.00003008858,0.6468522,0.0007377743,0.0001648174,0.0005620689,0.000006917275,0.00005127228,0.0001452817],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8985146,"threshold_uncertainty_score":0.9998996,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01894816289790268,"score_gpt":0.2911922973149375,"score_spread":0.2722441344170348,"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."}}