{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001090528,0.004133876,0.001463631,0.003216015,0.0008316122,0.001882558,0.00457692,0.003166938,0.02859079],"category_scores_gemma":[0.00811071,0.000866045,0.001908639,0.003989416,0.0006334828,0.001171065,0.001890408,0.001852,0.03196551],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001583795,"about_ca_system_score_gemma":0.002437203,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01339507,"about_ca_topic_score_gemma":0.0330297,"domain_scores_codex":[0.9984267,0.0002241289,0.0001967086,0.0003703664,0.0006103052,0.0001717359],"domain_scores_gemma":[0.9964747,0.001563074,0.0002845722,0.0007527823,0.0007638177,0.0001609739],"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.0005638883,0.0001678891,0.00221767,0.004546963,0.0002094719,0.000178928,0.00004650061,0.008288876,0.001388169,0.001156199,0.9591925,0.02204289],"study_design_scores_gemma":[0.003325429,0.0003792772,0.008108847,0.001114928,0.0002757598,0.0003868747,0.00009590278,0.0325555,0.008579954,0.007503084,0.9375432,0.0001312721],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"dataset","genre_gemma":"dataset","genre_scores_codex":[0.002670816,0.0009815188,0.001214446,0.0002544813,0.00008321772,0.0001049698,0.9843184,0.007607724,0.002764381],"genre_scores_gemma":[0.003132728,0.0002404388,0.002234653,0.00009488255,0.00001125193,0.00020471,0.9929895,0.0003916375,0.0007000336],"genre_candidate":"dataset","genre_consensus":"dataset","teacher_disagreement_score":0.02859079,"threshold_uncertainty_score":0.09564573,"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."}}