{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001575952,0.0004455432,0.0003858999,0.0003862073,0.0006561827,0.001896248,0.001927268,0.0006409172,0.003762185],"category_scores_gemma":[0.004030437,0.0004604259,0.0006228161,0.0004785974,0.002723172,0.003966405,0.002879007,0.002217751,0.0009025219],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006348054,"about_ca_system_score_gemma":0.0008765846,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006357639,"about_ca_topic_score_gemma":0.0009404778,"domain_scores_codex":[0.9988866,0.0002885813,0.00009102462,0.0001496338,0.0004683578,0.0001158435],"domain_scores_gemma":[0.9974409,0.0008602492,0.000164352,0.00117408,0.0002682494,0.00009218821],"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.0002377696,0.00008931695,0.001735575,0.0002211535,0.00002318311,0.0002698881,0.001291973,0.0257583,0.03112086,0.7945228,0.004684761,0.1400445],"study_design_scores_gemma":[0.00007150663,0.0001353645,0.0003681114,0.00007184122,0.00004378009,0.0003626504,0.0001729948,0.22787,0.08383843,0.6356531,0.05133839,0.00007389415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02102384,0.00008171412,0.9696884,0.0002151417,0.00005737552,0.00003371084,0.00004662155,0.003933868,0.004919467],"genre_scores_gemma":[0.4097139,0.0002003593,0.5749872,0.000467837,0.00007935616,0.0002255073,0.0001488086,0.003632528,0.01054455],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003762185,"threshold_uncertainty_score":0.01258576,"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."}}