{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00166108,0.0001388577,0.0002958733,0.0007289487,0.0003178807,0.0001844007,0.0004287415,0.00007538337,0.00002813259],"category_scores_gemma":[0.0008465176,0.0001181271,0.0001186429,0.001046591,0.0000810097,0.0002573864,0.000147715,0.0001125958,0.00002075202],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000432359,"about_ca_system_score_gemma":0.00004976258,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009490159,"about_ca_topic_score_gemma":0.000001246453,"domain_scores_codex":[0.9981608,0.000046279,0.0006700433,0.0002624171,0.0005990957,0.0002613099],"domain_scores_gemma":[0.998159,0.0007783017,0.0003134692,0.0002520038,0.0002731894,0.0002240489],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002791327,0.00111639,0.004097091,0.00003821712,0.0006083968,0.0001220733,0.02214382,0.3797562,0.5022487,0.007174487,0.04184027,0.03806303],"study_design_scores_gemma":[0.01326095,0.00760048,0.007785878,0.0003285391,0.0003513293,0.0005486027,0.06585818,0.4566504,0.3622741,0.06073105,0.02248936,0.002121083],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9556123,0.0006490466,0.04137502,0.0009244258,0.001010791,0.0002880818,0.00002345308,0.00004492474,0.00007195612],"genre_scores_gemma":[0.8590944,0.000116427,0.1402493,0.000166339,0.0002442016,0.00003195648,0.00002084581,0.00001818739,0.00005833379],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1399746,"threshold_uncertainty_score":0.4817085,"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."}}