{"id":"W2122238195","doi":"10.1016/j.ejc.2009.11.008","title":"An improved linear bound on the number of perfect matchings in cubic graphs","year":2009,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Cubic graph; Perfect graph theorem; Polytope; Matching (statistics); Perfect graph; Trivially perfect graph; Dimension (graph theory); Graph; Upper and lower bounds; Discrete mathematics; Line graph; Pathwidth; Mathematical analysis","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.003574613,0.0001457234,0.0002366667,0.0002421478,0.000102546,0.00009218961,0.001939101,0.00002082896,0.000008361932],"category_scores_gemma":[0.0002015729,0.00009988838,0.0001298068,0.0009045955,0.0000847284,0.0005072509,0.00008920772,0.0007302583,0.00001641829],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004383282,"about_ca_system_score_gemma":0.00006213852,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001006261,"about_ca_topic_score_gemma":1.523453e-7,"domain_scores_codex":[0.9973856,0.001137445,0.0005037936,0.0001756352,0.0005208451,0.0002767372],"domain_scores_gemma":[0.998356,0.000268,0.0003831339,0.0005915228,0.0002687277,0.0001326127],"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.0001537497,0.0007669932,0.002746463,0.00001195138,0.00002321647,0.0003673576,0.001644769,0.0002699515,0.00991276,0.9713303,0.0001728749,0.01259964],"study_design_scores_gemma":[0.002453503,0.004541385,0.03847888,0.0002000799,0.00001133214,0.0003013412,0.0001724794,0.006377712,0.008065104,0.9380362,0.0009729618,0.0003890379],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.978559,0.00009295467,0.01642347,0.0007169074,0.0002945016,0.00009875571,5.050262e-7,0.00001923273,0.003794698],"genre_scores_gemma":[0.9979035,0.000048545,0.001715094,0.0002285442,0.00003459522,2.39789e-7,1.442075e-7,0.00001642165,0.00005292983],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03573243,"threshold_uncertainty_score":0.407333,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01631360234602767,"score_gpt":0.2919061411560183,"score_spread":0.2755925388099906,"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."}}