{"id":"W2153601281","doi":"10.1016/j.dam.2014.07.005","title":"About the minimum mean cycle-canceling algorithm","year":2014,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Algorithm; Function (biology); Constructive; Mathematical optimization; Linear programming; Acceleration; Time complexity; Computer science","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.0006322417,0.0002528235,0.0002905074,0.00006752457,0.0004152679,0.0003083936,0.001799617,0.00007025213,0.00001840087],"category_scores_gemma":[0.00004216859,0.0001756456,0.0001318094,0.0003983903,0.0001685816,0.0001425555,0.0004873954,0.0002545415,0.0001391252],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002131277,"about_ca_system_score_gemma":0.00003295131,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005898809,"about_ca_topic_score_gemma":0.000004117706,"domain_scores_codex":[0.998226,0.00003124325,0.0004028375,0.0004059314,0.0004896318,0.0004443752],"domain_scores_gemma":[0.9979428,0.0004029798,0.000188732,0.001277543,0.00004918878,0.0001387565],"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.000001005038,0.00004114302,8.908709e-7,0.00004114085,0.00002295751,0.000001019122,0.004220843,0.00007665764,0.0001762822,0.8623335,0.000313176,0.1327714],"study_design_scores_gemma":[0.0002231067,0.00002341533,0.000008023438,0.0000362207,0.00001323388,0.000009490169,0.0004852268,0.6295894,0.0006720499,0.3622665,0.006418854,0.0002544444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001248328,0.00008055564,0.9660543,0.0004450113,0.0002823677,0.0002725943,0.000004229118,0.0002636825,0.03134894],"genre_scores_gemma":[0.09158986,0.00003207341,0.9067142,0.001017427,0.0003394712,0.00009541346,0.000007329862,0.00003650969,0.0001676992],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6295128,"threshold_uncertainty_score":0.7162618,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01711157059309324,"score_gpt":0.2439486201853526,"score_spread":0.2268370495922594,"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."}}