{"id":"W2403021968","doi":"","title":"On the structure of graphs with exactly two near-perfect matchings.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","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.0005935415,0.0004338641,0.0007758544,0.001975086,0.002660443,0.002169599,0.001542689,0.001814408,0.007542974],"category_scores_gemma":[0.005618528,0.0006121849,0.0005117379,0.001660447,0.00230692,0.006100898,0.002087191,0.001814062,0.001441165],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009409725,"about_ca_system_score_gemma":0.00059797,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009917817,"about_ca_topic_score_gemma":0.001474726,"domain_scores_codex":[0.9993973,0.000194284,0.00003347535,0.0001323637,0.0001073435,0.0001352174],"domain_scores_gemma":[0.9959572,0.001817242,0.0009030074,0.0004998827,0.0003129553,0.0005097119],"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.0001916754,0.00006636797,0.001283992,0.0001338958,0.00003045516,0.0003590471,0.0005721076,0.004474999,0.002160375,0.970464,0.006487398,0.01377565],"study_design_scores_gemma":[0.00002386084,0.00002548189,0.0005615677,0.00003859562,0.00001773225,0.0002402977,0.000235694,0.007550723,0.0004496065,0.9863749,0.004467157,0.00001430748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7221413,0.004089069,0.1280471,0.006224017,0.0004707897,0.0001529715,0.002079235,0.0006645948,0.1361309],"genre_scores_gemma":[0.9522037,0.001158491,0.02960432,0.0006808691,0.0002727335,0.00008644302,0.001347905,0.0001290145,0.01451656],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007542974,"threshold_uncertainty_score":0.02523375,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01549985081806928,"score_gpt":0.2495845580830215,"score_spread":0.2340847072649523,"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."}}