{"id":"W4400486032","doi":"10.61091/jcmcc120-09","title":"Sufficient Conditions for a Graph k G Admitting all [ 1 , k ] -factors","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Combinatorics; Graph; Mathematics; Computer science","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.001539837,0.001539386,0.001675675,0.002054668,0.002686548,0.002475355,0.001426854,0.002542227,0.009830626],"category_scores_gemma":[0.01681011,0.0010558,0.00221236,0.00145613,0.002604434,0.004626981,0.002852925,0.001912472,0.00199128],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001514979,"about_ca_system_score_gemma":0.002349382,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004300878,"about_ca_topic_score_gemma":0.006065068,"domain_scores_codex":[0.9970834,0.0003832942,0.0002940145,0.001065231,0.0003714356,0.0008025687],"domain_scores_gemma":[0.9857062,0.006613831,0.001813933,0.0009162052,0.002518677,0.00243113],"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.005131149,0.0009468929,0.0379816,0.002098609,0.0004338844,0.006660404,0.003156868,0.05249326,0.04564001,0.7758138,0.0261064,0.04353714],"study_design_scores_gemma":[0.0007763291,0.001792928,0.0145662,0.0007704918,0.0003954658,0.005753032,0.004873756,0.1421897,0.04612301,0.7388562,0.04341896,0.0004839858],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.71957,0.00169009,0.1956379,0.003353622,0.0005627863,0.0009288688,0.01054842,0.002240626,0.0654676],"genre_scores_gemma":[0.931,0.0006333087,0.05528515,0.0004704053,0.0002466762,0.0003070573,0.007730021,0.0002375705,0.004089699],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009830626,"threshold_uncertainty_score":0.03288668,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01441221117993918,"score_gpt":0.2501763823458746,"score_spread":0.2357641711659355,"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."}}