{"id":"W4226530376","doi":"10.4230/lipics.socg.2022.71","title":"Conflict-Based Local Search for Minimum Partition into Plane Subgraphs (CG Challenge)","year":2022,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Agence Nationale de la Recherche","keywords":"Partition (number theory); Plane (geometry); Combinatorics; Partition problem; Line segment; Mathematics; Set (abstract data type); Computer science; Line (geometry); Geometry","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.001131683,0.0007682772,0.00145679,0.0006694484,0.0007916439,0.00107397,0.001935563,0.001802525,0.007177134],"category_scores_gemma":[0.00608653,0.0005505226,0.001056961,0.001294809,0.001233093,0.002178977,0.002054701,0.001952054,0.001032892],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008440692,"about_ca_system_score_gemma":0.001185079,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002587694,"about_ca_topic_score_gemma":0.004137436,"domain_scores_codex":[0.998987,0.0004916145,0.00003048208,0.0001969617,0.0001643737,0.0001295765],"domain_scores_gemma":[0.9972485,0.002040099,0.000139155,0.0003078368,0.0001419109,0.000122372],"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.0007075176,0.0003641072,0.002020318,0.0005887212,0.0001640909,0.0003955641,0.0005288026,0.6784463,0.006279091,0.09537155,0.04530356,0.1698304],"study_design_scores_gemma":[0.0001632977,0.00009675929,0.0002419073,0.0000341513,0.000037539,0.00009306509,0.0002051229,0.8952255,0.002163698,0.09732514,0.004396734,0.00001691767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1274266,0.001291967,0.8514672,0.00280135,0.0001516126,0.0002237241,0.001391638,0.00269189,0.01255397],"genre_scores_gemma":[0.498901,0.0004038329,0.4901008,0.0008642533,0.0001088766,0.0004317477,0.002976158,0.0009828177,0.005230541],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007177134,"threshold_uncertainty_score":0.02400994,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03651706458180236,"score_gpt":0.2986221419772685,"score_spread":0.2621050773954661,"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."}}