{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006684843,0.0002081777,0.000224821,0.0002690782,0.000500078,0.0003480907,0.0019873,0.00006318445,0.0003131977],"category_scores_gemma":[0.0003343559,0.0001788637,0.0001323627,0.00168146,0.0001436058,0.000383775,0.0009691384,0.0006164197,0.00006949464],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001510791,"about_ca_system_score_gemma":0.0001532369,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007117637,"about_ca_topic_score_gemma":0.00002062974,"domain_scores_codex":[0.9977077,0.00004210823,0.0004809014,0.0005644849,0.000798448,0.0004063296],"domain_scores_gemma":[0.9987491,0.00009893534,0.0002128728,0.0003308213,0.0004653099,0.0001429939],"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.00005960504,0.0001331362,0.001078349,0.00001644539,0.00001547702,9.130183e-7,0.006387986,0.004046476,0.002881096,0.6892931,0.0001256357,0.2959618],"study_design_scores_gemma":[0.0001142786,0.001649917,0.001726892,0.0006404666,0.0000344599,0.0000449317,0.01709748,0.7126034,0.155763,0.1071386,0.001975439,0.001211123],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4875934,0.00002723655,0.4593311,0.02711152,0.002134839,0.002418414,0.00001752856,0.0004923896,0.02087361],"genre_scores_gemma":[0.9838458,0.00000871343,0.01520565,0.0003968859,0.00004244064,0.0001180438,4.078684e-7,0.00001397438,0.000368137],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.708557,"threshold_uncertainty_score":0.729385,"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."}}