{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014027,0.000635691,0.0006875781,0.0008180172,0.0007645535,0.0006885933,0.001836746,0.0004681873,0.00008118853],"category_scores_gemma":[0.00006166517,0.0006796911,0.0005650632,0.0004645865,0.0001468001,0.0007902076,0.001363321,0.0009438879,0.00004826634],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003719691,"about_ca_system_score_gemma":0.0006263644,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004179182,"about_ca_topic_score_gemma":0.00003958233,"domain_scores_codex":[0.9957027,0.0001246944,0.001477895,0.0007422492,0.001090612,0.0008617851],"domain_scores_gemma":[0.9966777,0.0005058032,0.0006445876,0.001166599,0.0006959485,0.000309369],"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.001490503,0.002821557,0.0007215361,0.01247608,0.001181874,0.00003128958,0.04079827,0.618449,0.0001892939,0.1556375,0.03121988,0.1349832],"study_design_scores_gemma":[0.002891339,0.0007678628,0.0001001813,0.0001501826,0.00005457596,0.00001320933,0.0006084225,0.8386733,0.001689721,0.003972633,0.1502496,0.0008290451],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02374718,0.0002113756,0.9664146,0.001457145,0.002539132,0.003004124,0.001448848,0.0003114156,0.0008662171],"genre_scores_gemma":[0.8782885,0.0001175681,0.09468743,0.002078852,0.0006181307,0.002656598,0.02105878,0.00009522233,0.0003989234],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8717271,"threshold_uncertainty_score":0.9995654,"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."}}