{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003820696,0.00007650792,0.0001020189,0.00003839078,0.0001399091,0.0001408541,0.0002677008,0.0000273838,0.00004926442],"category_scores_gemma":[0.00004683532,0.00005609518,0.0000414907,0.0001464806,0.00008229624,0.0002194327,0.00003078804,0.00003860148,0.000009340441],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000001329196,"about_ca_system_score_gemma":0.00001450645,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002935525,"about_ca_topic_score_gemma":0.00000181552,"domain_scores_codex":[0.9992895,0.00001360777,0.0002824917,0.0001510719,0.0001344994,0.0001288577],"domain_scores_gemma":[0.9991593,0.0003281182,0.0001070267,0.0001819793,0.0001774865,0.00004613004],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002930296,0.0001797472,4.19617e-7,0.0000260354,0.00001211491,3.689309e-7,0.0009363295,0.07199851,0.0007506257,0.6515154,0.0001563311,0.2744212],"study_design_scores_gemma":[0.00001156107,0.0001650562,0.000003128705,0.00000984881,0.00000364067,0.000003899022,0.0001777661,0.8234091,0.02497247,0.1509594,0.0002226492,0.00006147629],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0178597,0.0002343665,0.9799435,0.001271046,0.0000467465,0.0002192783,0.000007318592,0.00001845329,0.0003995659],"genre_scores_gemma":[0.9045234,0.0000884953,0.0951314,0.0001418011,0.0000506119,0.00001445998,0.000001467361,0.000003590754,0.00004475918],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8866637,"threshold_uncertainty_score":0.2287495,"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."}}