{"id":"W2006549279","doi":"10.1016/j.disopt.2007.12.002","title":"Minimum cycle factors in quasi-transitive digraphs","year":2008,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Combinatorics; Digraph; Mathematics; Conjecture; Transitive relation; Discrete mathematics; Path (computing); Computer science","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":[],"consensus_categories":[],"category_scores_codex":[0.00005688422,0.0001312165,0.0001440377,0.0001381339,0.00006053342,0.00001241662,0.00006985429,0.00007710901,0.00004659355],"category_scores_gemma":[0.000008413016,0.0001284648,0.00005918494,0.0003300799,0.00003730076,0.000221035,0.000004583814,0.00008234705,0.000008139655],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002220465,"about_ca_system_score_gemma":0.000005264064,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002493269,"about_ca_topic_score_gemma":0.00001739279,"domain_scores_codex":[0.9993641,0.0000418751,0.0001879501,0.0001321127,0.00009600016,0.000177921],"domain_scores_gemma":[0.9997663,0.00002649461,0.00002027221,0.0001226744,0.00001641082,0.00004779159],"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.00001013508,0.00001832788,0.00737045,0.0000189421,0.00001546856,0.00000864394,0.003462648,0.9879148,0.0004532804,0.0006412019,0.00003266483,0.00005342419],"study_design_scores_gemma":[0.0005985959,0.00005146659,0.01501747,0.00006003356,0.00001170097,0.000009235708,0.001239207,0.9796914,0.002554758,0.0002821531,0.00009119717,0.0003927489],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8769119,0.0001374673,0.1136796,0.00001395015,0.0002517546,0.0001949857,0.00001998804,0.0002266321,0.008563748],"genre_scores_gemma":[0.999384,0.00008592539,0.0003282327,0.000007780572,0.00001987065,0.00001504684,0.00008421097,0.00002653644,0.00004835572],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1224721,"threshold_uncertainty_score":0.5238642,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006986559510435831,"score_gpt":0.189187229400176,"score_spread":0.1822006698897402,"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."}}