{"id":"W2155131920","doi":"10.1007/s10114-010-9006-6","title":"The existence of even regular factors of regular graphs on the number of cut edges","year":2010,"lang":"en","type":"article","venue":"Acta Mathematica Sinica English Series","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Lethbridge; Wilfrid Laurier University","funders":"","keywords":"Multigraph; Combinatorics; Integer (computer science); Mathematics; Factor (programming language); Characterization (materials science); Discrete mathematics; Two-graph; Graph; Computer science; Physics; Line graph","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.001728229,0.0002335683,0.0004811153,0.0000803563,0.0002254421,0.00006894614,0.003209292,0.0001139528,0.00004634023],"category_scores_gemma":[0.005212895,0.0001277197,0.0002407676,0.0006902238,0.002075657,0.000599705,0.0005663045,0.0004162496,0.000003671259],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007942429,"about_ca_system_score_gemma":0.00008356511,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003495255,"about_ca_topic_score_gemma":0.000007444133,"domain_scores_codex":[0.9974577,0.0002782804,0.0007262572,0.0003404439,0.0008301244,0.0003671919],"domain_scores_gemma":[0.9911398,0.004680474,0.0005908813,0.002844456,0.0006634261,0.00008092994],"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.0000386112,0.0001255326,0.0002505317,0.0001099237,0.00006646197,8.109748e-7,0.004720549,9.838426e-7,0.01208092,0.9818897,0.0002727953,0.0004431775],"study_design_scores_gemma":[0.0001455931,0.0001696812,0.0009377499,0.0001570925,0.00001688736,0.000007154581,0.002458456,0.00005790892,0.292773,0.7009619,0.002148456,0.0001660125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9874553,0.0000482558,0.0007216288,0.001134685,0.0003397086,0.0004701946,0.00001761616,0.00007775909,0.009734827],"genre_scores_gemma":[0.9888114,0.00007039205,0.01060761,0.00001369014,0.00002423945,0.0000290692,9.43712e-7,0.00002300483,0.0004196787],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2809277,"threshold_uncertainty_score":0.7647846,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02358314849516185,"score_gpt":0.2832969816802185,"score_spread":0.2597138331850566,"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."}}