{"id":"W3206580908","doi":"10.1609/aaai.v36i4.20293","title":"Finding Backdoors to Integer Programs: A Monte Carlo Tree Search Framework","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"ca_institutions":"Vector Institute; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Backdoor; Computer science; Integer programming; Benchmark (surveying); Search tree; Monte Carlo method; Theoretical computer science; Tree (set theory); Integer (computer science); Mathematical optimization; Algorithm; Mathematics; Search algorithm; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00357369,0.001123844,0.001689828,0.001931552,0.0008755324,0.002258711,0.002171282,0.002180073,0.004369562],"category_scores_gemma":[0.01501988,0.001077629,0.00206616,0.002395033,0.002057681,0.002600728,0.001915975,0.003547702,0.0007582858],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001936004,"about_ca_system_score_gemma":0.003262338,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006026135,"about_ca_topic_score_gemma":0.008624146,"domain_scores_codex":[0.9978665,0.001063001,0.00007043822,0.000247908,0.0005340462,0.0002183035],"domain_scores_gemma":[0.9921041,0.006302189,0.0004377831,0.0004455304,0.0004761122,0.0002342281],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008766163,0.00008161157,0.0008639908,0.00009445762,0.00006287124,0.00007107673,0.00007059412,0.8841417,0.0004988604,0.07928481,0.002482503,0.03225985],"study_design_scores_gemma":[0.00001026641,0.00001305937,0.00002917381,0.00001200493,0.000005687475,0.00001107338,0.000006113454,0.9779029,0.00009919809,0.02127766,0.0006287403,0.0000041269],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009297681,0.0005696957,0.9856574,0.0004959896,0.00005011295,0.0001091138,0.0001526374,0.0006339921,0.003033358],"genre_scores_gemma":[0.2861168,0.0007715778,0.7077187,0.0005402854,0.000161622,0.0006080391,0.0007453244,0.0004653094,0.002872299],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006026135,"threshold_uncertainty_score":0.01889968,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09239255901222973,"score_gpt":0.3095931301770247,"score_spread":0.217200571164795,"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."}}