{"id":"W4361003657","doi":"10.1145/3588869","title":"Conflict Optimization for Binary CSP Applied to Minimum Partition into Plane Subgraphs and Graph Coloring","year":2023,"lang":"en","type":"article","venue":"ACM Journal of Experimental Algorithmics","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Agence Nationale de la Recherche","keywords":"Graph coloring; Constraint satisfaction problem; Partition (number theory); Computer science; Vertex (graph theory); Implementation; Binary number; Graph; Graph partition; Theoretical computer science; Mathematical optimization; Combinatorics; Mathematics; Artificial intelligence; Arithmetic","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.002834446,0.001144019,0.001006581,0.001023301,0.000993644,0.001893638,0.001714121,0.001011011,0.005458936],"category_scores_gemma":[0.01093856,0.0005506791,0.001077929,0.002699499,0.001300059,0.002349991,0.002314957,0.002460688,0.0005824982],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002228515,"about_ca_system_score_gemma":0.003526391,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01103566,"about_ca_topic_score_gemma":0.008016452,"domain_scores_codex":[0.9968863,0.001515749,0.0001131208,0.0003553495,0.0007282234,0.0004011708],"domain_scores_gemma":[0.9949857,0.003688312,0.0002945203,0.0004023348,0.0004282468,0.0002009997],"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.0004058102,0.0002697114,0.0007603705,0.0003401391,0.00007376165,0.00007180595,0.0002098734,0.7251651,0.003776996,0.1645245,0.01020853,0.09419339],"study_design_scores_gemma":[0.00004858637,0.00005106381,0.0001178414,0.00001360503,0.00001263792,0.00002198773,0.00003901389,0.9384384,0.001712716,0.0576851,0.001849989,0.000009061693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02597036,0.0003201115,0.9613932,0.0006560491,0.0001124795,0.0001873487,0.0002847419,0.0006631348,0.01041256],"genre_scores_gemma":[0.3638619,0.0004385945,0.6294782,0.0003443873,0.0001438686,0.0003486353,0.0006926125,0.0005343975,0.004157407],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01103566,"threshold_uncertainty_score":0.02194285,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1174703531014551,"score_gpt":0.3966672885918802,"score_spread":0.2791969354904251,"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."}}