{"id":"W190437119","doi":"","title":"On the matching polynomials of the complete n-partite graph.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Matching (statistics); Combinatorics; Graph; Discrete mathematics; Statistics","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.0005574275,0.0004501394,0.0005187169,0.001285219,0.001066574,0.001434568,0.0008974321,0.0007838353,0.009561598],"category_scores_gemma":[0.004402754,0.000283311,0.000506782,0.001366867,0.001719243,0.002775474,0.001180898,0.001680902,0.001860161],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008785759,"about_ca_system_score_gemma":0.0005935257,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003040656,"about_ca_topic_score_gemma":0.003753019,"domain_scores_codex":[0.9995143,0.0001410486,0.000009447172,0.00007178978,0.0001159786,0.000147492],"domain_scores_gemma":[0.9985875,0.0007645457,0.0002364992,0.0001205859,0.0001325287,0.0001583543],"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.0001492262,0.0000674837,0.0008696558,0.0001416497,0.00001683927,0.0001753378,0.0003389907,0.01333678,0.001613736,0.9447767,0.01154131,0.02697228],"study_design_scores_gemma":[0.00002320592,0.00002993251,0.0008658149,0.00002265535,0.00001194644,0.0001387671,0.0001179757,0.02940055,0.0005714675,0.964177,0.004621783,0.00001894191],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6455239,0.002384163,0.162691,0.004415724,0.0006965619,0.00009881285,0.001246089,0.0002921737,0.1826515],"genre_scores_gemma":[0.9611887,0.001367033,0.01169838,0.0003577906,0.0005638669,0.00004328897,0.0004348246,0.00009842743,0.02424772],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009561598,"threshold_uncertainty_score":0.03198671,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04566966085696669,"score_gpt":0.2916617731814702,"score_spread":0.2459921123245035,"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."}}