{"id":"W2240982577","doi":"10.1002/jgt.22063","title":"On Lower Bounds for the Matching Number of Subcubic Graphs","year":2016,"lang":"en","type":"preprint","venue":"Journal of Graph Theory","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Matching (statistics); Graph; Upper and lower bounds; Constant (computer programming); Discrete mathematics; Computer science","routes":{"ca_aff":true,"ca_fund":true,"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.004377673,0.0003301338,0.0006777234,0.0003001953,0.000241478,0.00005240077,0.001062199,0.00027008,0.0002166364],"category_scores_gemma":[0.0004712643,0.0001812839,0.001495601,0.000176966,0.0003791891,0.00007695483,0.0001542737,0.0008276923,0.000007491096],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003045025,"about_ca_system_score_gemma":0.0001060919,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001113532,"about_ca_topic_score_gemma":0.000001106664,"domain_scores_codex":[0.9977202,0.0003251845,0.001043695,0.0002224438,0.0004186942,0.0002698134],"domain_scores_gemma":[0.9891795,0.00741062,0.002017322,0.0008916869,0.0004118925,0.00008900338],"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.0005933905,0.0002802272,0.00004597533,0.0002111344,0.0006731212,0.000002863738,0.0005776905,0.00001640218,0.0004372758,0.9930655,0.003209459,0.0008869093],"study_design_scores_gemma":[0.0005528851,0.0000996977,0.0001151053,0.0008150109,0.0004875776,0.00005262934,0.0002615057,0.000001910393,0.0006125081,0.9960412,0.0007556816,0.0002042295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8950233,0.0007061887,0.09412982,0.001099647,0.002271848,0.0009809344,0.0002089869,0.00004140846,0.005537852],"genre_scores_gemma":[0.9962581,0.0002103987,0.002471796,0.00015491,0.0002535973,0.00006742618,0.000001961426,0.0000706978,0.000511104],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1012348,"threshold_uncertainty_score":0.7392542,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03198053856046755,"score_gpt":0.3363031753190469,"score_spread":0.3043226367585793,"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."}}