{"id":"W1998044937","doi":"10.1016/s0012-365x(00)00181-3","title":"The ultimate categorical matching in a graph","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Combinatorics; Bipartite graph; Categorical variable; Factor-critical graph; Matching (statistics); Graph; Edge-transitive graph; Discrete mathematics; Graph power; Line graph; Statistics","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.001370588,0.0003998949,0.0010323,0.002586065,0.004056187,0.005157423,0.001879567,0.002841183,0.008630736],"category_scores_gemma":[0.004865432,0.0006415506,0.001202618,0.002670409,0.005409088,0.01281824,0.004376553,0.003906161,0.00122109],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001743203,"about_ca_system_score_gemma":0.0009872881,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00150597,"about_ca_topic_score_gemma":0.001371835,"domain_scores_codex":[0.9983245,0.0004962923,0.00009354556,0.0004718177,0.0003266565,0.0002871462],"domain_scores_gemma":[0.9976299,0.0009926996,0.0002179188,0.0003894025,0.000335987,0.0004341593],"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.00001288125,0.000007340895,0.00009005124,0.00001161681,0.000001893011,0.00001702737,0.0001039599,0.0001282648,0.0001430739,0.9975792,0.0004280729,0.001476693],"study_design_scores_gemma":[0.000004713226,0.000004248315,0.00005933595,0.000004631595,0.000003777164,0.00003213864,0.00006036412,0.000616049,0.000128809,0.99761,0.001471613,0.000004421623],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4458476,0.001572549,0.3073309,0.0142655,0.0009579319,0.0001436516,0.001114448,0.0009509441,0.2278164],"genre_scores_gemma":[0.9395084,0.0004983083,0.03097863,0.001234093,0.0004428653,0.00009568696,0.0005493444,0.0001930485,0.02649968],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008630736,"threshold_uncertainty_score":0.02887267,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02454482641561275,"score_gpt":0.3128628851969006,"score_spread":0.2883180587812879,"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."}}