{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006231121,0.0008000325,0.001297938,0.001940548,0.001353443,0.002787421,0.001053993,0.0009889591,0.009466467],"category_scores_gemma":[0.004665039,0.0009205847,0.0007904029,0.002011732,0.001201124,0.003311667,0.0009238216,0.00130861,0.0008574022],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001520071,"about_ca_system_score_gemma":0.0009836705,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002832511,"about_ca_topic_score_gemma":0.004934629,"domain_scores_codex":[0.9993856,0.0001526,0.00003607744,0.000170667,0.000131674,0.0001233786],"domain_scores_gemma":[0.9967266,0.001915178,0.000356986,0.0003309548,0.0002999683,0.0003702197],"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.0001773656,0.0000694575,0.0007453845,0.0002020192,0.00004215024,0.0001351127,0.0003589546,0.02806343,0.003310898,0.9336489,0.003745435,0.02950089],"study_design_scores_gemma":[0.00005411096,0.00005396254,0.0004247021,0.00005863754,0.00003241919,0.0001380598,0.0001418322,0.05978118,0.001738816,0.93248,0.005075141,0.00002127037],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4116436,0.001537301,0.5227658,0.001038717,0.0001302611,0.0002349187,0.001398917,0.0006091082,0.06064124],"genre_scores_gemma":[0.875277,0.00127652,0.09798282,0.0002752725,0.0001129787,0.0002406925,0.0009339229,0.0003308551,0.02356988],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009466467,"threshold_uncertainty_score":0.03166848,"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."}}