{"id":"W1528496018","doi":"10.1023/a:1014444525059","title":"An Optimal Strategy for the Constrained Cycle Cover Problem","year":2002,"lang":"en","type":"article","venue":"Annals of Mathematics and Artificial Intelligence","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"HEC Montréal; Université de Montréal; Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Mathematical optimization; Cover (algebra); Decomposition; Constraint (computer-aided design); Set cover problem; Set (abstract data type); Complex system; Theoretical computer science; Mathematics; Artificial intelligence; Engineering","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009001438,0.001189097,0.001593157,0.001479658,0.0008774094,0.001650987,0.001890192,0.002855013,0.01041632],"category_scores_gemma":[0.005398404,0.0007974097,0.0009190943,0.001309003,0.001120213,0.002377294,0.002229458,0.001687397,0.0006821937],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001274184,"about_ca_system_score_gemma":0.001634194,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00378713,"about_ca_topic_score_gemma":0.003428239,"domain_scores_codex":[0.9994643,0.0001813149,0.00002214381,0.00009602059,0.0001359779,0.0001002056],"domain_scores_gemma":[0.9984871,0.001060027,0.00007026841,0.0000886186,0.0001208949,0.0001731001],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004674218,0.000401802,0.0006390669,0.000433176,0.0001074545,0.0002660606,0.0003128938,0.4304953,0.006845746,0.3771461,0.01861876,0.1642662],"study_design_scores_gemma":[0.00008048967,0.0001116609,0.0001214249,0.00003992382,0.00002550703,0.0000603221,0.00005830316,0.8695685,0.0006637441,0.126267,0.002986189,0.00001684597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06444114,0.000644601,0.9010758,0.001262216,0.0001515885,0.0003965762,0.0002437477,0.0002661958,0.03151817],"genre_scores_gemma":[0.556942,0.0008912074,0.4200604,0.0004872663,0.0001662867,0.0006545607,0.0005906401,0.0003292031,0.01987836],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01041632,"threshold_uncertainty_score":0.03484607,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1737186458389376,"score_gpt":0.3546069838677639,"score_spread":0.1808883380288263,"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."}}