{"id":"W3208389462","doi":"10.5281/zenodo.1523170","title":"Dataset for EASY: Efficient Arbiter SYnthesis from Multi-threaded Code","year":2018,"lang":"en","type":"dataset","venue":"Spiral (Imperial College London)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Arbiter; Programming language; Computer science; Code (set theory); Parallel computing; Set (abstract data type)","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"],"consensus_categories":[],"category_scores_codex":[0.000680592,0.0008797856,0.001128464,0.000401667,0.0005526792,0.0005617842,0.003947854,0.000744478,0.0001807267],"category_scores_gemma":[0.0006196226,0.0008302859,0.000352467,0.0005346291,0.0002338531,0.0002603696,0.001342853,0.0004328806,0.000304675],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001856033,"about_ca_system_score_gemma":0.0003920018,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004948771,"about_ca_topic_score_gemma":0.0002062483,"domain_scores_codex":[0.995311,0.0003079263,0.001001151,0.00180116,0.000655906,0.0009229],"domain_scores_gemma":[0.9954578,0.0006004092,0.0006377185,0.002687922,0.0003003234,0.0003157716],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001764137,0.000246464,0.000001196856,0.00006224976,0.00009205722,0.00004322947,0.00002160137,0.0001747263,0.00005476328,0.0001640211,0.9987901,0.0001732189],"study_design_scores_gemma":[0.00146806,0.0003151795,0.00000435052,0.0001810299,0.0001116856,0.00001161889,0.000003055005,0.05066881,0.002276712,0.0002309496,0.9437056,0.001022914],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"dataset","genre_gemma":"dataset","genre_scores_codex":[0.00009808131,0.000151308,0.1120147,0.0001538197,0.002769826,0.001396643,0.8830101,0.0003846013,0.00002089496],"genre_scores_gemma":[0.0001136155,0.00004345779,0.1557951,0.0009870605,0.001524789,0.0004419643,0.840935,0.00005683267,0.0001022008],"genre_candidate":"dataset","genre_consensus":"dataset","teacher_disagreement_score":0.05508442,"threshold_uncertainty_score":0.9994148,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03104550367406657,"score_gpt":0.2896779092711758,"score_spread":0.2586324055971093,"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."}}