{"id":"W2591699638","doi":"","title":"Vertex-disjoint cycles containing specified edges in a bipartite graph","year":2001,"lang":"en","type":"article","venue":"The Australasian Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Mathematics; Bipartite graph; Disjoint sets; Complete bipartite graph; Vertex (graph theory); Graph; Discrete mathematics","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.00054664,0.0007347448,0.0007301853,0.002068764,0.00256258,0.002443997,0.001719611,0.002109861,0.007063494],"category_scores_gemma":[0.004417011,0.0008318924,0.0006208213,0.002899902,0.001189781,0.002185982,0.0017156,0.0008820459,0.001371984],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009371301,"about_ca_system_score_gemma":0.001448147,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00327834,"about_ca_topic_score_gemma":0.004765198,"domain_scores_codex":[0.9990619,0.0002375997,0.00008650926,0.0002275898,0.0001868575,0.0001995742],"domain_scores_gemma":[0.995886,0.001887418,0.0006249101,0.0004032753,0.0005785617,0.0006197667],"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.001890096,0.0005690205,0.008452346,0.0009936533,0.0002277369,0.003801079,0.002406104,0.03913888,0.04778668,0.8045013,0.013617,0.07661618],"study_design_scores_gemma":[0.0003096386,0.0002375413,0.003005755,0.0003134505,0.0002789043,0.001418937,0.001286238,0.1480716,0.02735471,0.7897582,0.02785321,0.000111852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7082264,0.0005457439,0.2389396,0.001172983,0.0001745131,0.0007183396,0.003531544,0.000964867,0.04572598],"genre_scores_gemma":[0.8246289,0.0004686544,0.1469212,0.0005293823,0.00005410859,0.0009155602,0.003104134,0.000284897,0.02309315],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007063494,"threshold_uncertainty_score":0.02362978,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01967958250240626,"score_gpt":0.224978922846505,"score_spread":0.2052993403440987,"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."}}