{"id":"W2778034045","doi":"10.1145/3158149","title":"Strategy synthesis for linear arithmetic games","year":2017,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Reachability; Computer science; Combinatorial game theory; Satisfiability; Dimension (graph theory); Game tree; Game theory; Repeated game; Theoretical computer science; Sequential game; Mathematical economics; Mathematics; Combinatorics","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":["metaresearch","open_science"],"consensus_categories":[],"category_scores_codex":[0.0008816681,0.0001340464,0.0001755843,0.00006267583,0.0003736763,0.0004009415,0.00560471,0.00006884993,0.000001358536],"category_scores_gemma":[0.01077942,0.00009178014,0.0001171435,0.0001043775,0.0001488889,0.0004803858,0.0007899685,0.000116924,0.000003294595],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002120952,"about_ca_system_score_gemma":0.00002039435,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001848979,"about_ca_topic_score_gemma":7.541272e-7,"domain_scores_codex":[0.9989742,0.000009069301,0.0002046004,0.0003021797,0.0002540786,0.0002558962],"domain_scores_gemma":[0.9978813,0.0001641595,0.0004817655,0.0012199,0.0002114266,0.00004145077],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00002296545,0.00009111762,0.001403302,0.0002404045,0.00003204577,3.180727e-7,0.0005612883,0.000004373607,0.006285807,0.1235535,0.0002464076,0.8675584],"study_design_scores_gemma":[0.0003780859,0.0004408424,0.01478899,0.0004150259,0.00006420086,0.00001514429,0.0007434444,0.007087735,0.9464869,0.02340668,0.005775603,0.0003973297],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.9199799,0.0006616059,0.04684114,0.01438697,0.001357264,0.003891836,0.00002367272,0.001033191,0.01182441],"genre_scores_gemma":[0.4472399,0.000005168195,0.5523515,0.00003118099,0.00006223983,0.0001252873,1.290365e-7,0.00001029264,0.0001742959],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9402011,"threshold_uncertainty_score":0.9997755,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04933114638016753,"score_gpt":0.3478667795385895,"score_spread":0.2985356331584219,"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."}}