{"id":"W2399041719","doi":"","title":"Dominating cycles in graphs with high connectivity.","year":2009,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005279485,0.0004105052,0.000498462,0.002064938,0.001325845,0.002330657,0.0008085507,0.001116281,0.005704079],"category_scores_gemma":[0.006486278,0.0005022807,0.0003715287,0.001799743,0.001478173,0.003021491,0.001536796,0.0009999012,0.0007621907],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008324955,"about_ca_system_score_gemma":0.0004182302,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009897796,"about_ca_topic_score_gemma":0.001711181,"domain_scores_codex":[0.9993888,0.0002068336,0.00002700698,0.0001407483,0.0001298212,0.0001066911],"domain_scores_gemma":[0.9942151,0.003849474,0.0005262953,0.000358287,0.0005020348,0.0005487448],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002571186,0.0000748031,0.005370189,0.0006021812,0.00007687716,0.00102348,0.0009532053,0.01846815,0.007692814,0.8930828,0.016234,0.05616441],"study_design_scores_gemma":[0.0000551331,0.00006652014,0.002177204,0.00009766057,0.00006472915,0.001295906,0.0005607461,0.03134941,0.003301356,0.9440635,0.01693985,0.00002785652],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7024543,0.007099175,0.2022877,0.004608477,0.0004143379,0.0001731386,0.001311446,0.0005965618,0.08105481],"genre_scores_gemma":[0.9624734,0.001829027,0.02413986,0.0003843147,0.0002389115,0.00009515912,0.0006352245,0.00008081605,0.01012321],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005704079,"threshold_uncertainty_score":0.01908201,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0106548617144005,"score_gpt":0.2649386056327673,"score_spread":0.2542837439183668,"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."}}