{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002801931,0.001563603,0.002090475,0.004133267,0.001759136,0.004237983,0.003278993,0.001784207,0.00970491],"category_scores_gemma":[0.01536655,0.0006335435,0.001123374,0.003260643,0.002214907,0.006383764,0.002982804,0.003440076,0.001716069],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002249136,"about_ca_system_score_gemma":0.0006516348,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005410695,"about_ca_topic_score_gemma":0.0003914374,"domain_scores_codex":[0.9970515,0.0005701383,0.0001514207,0.0008040538,0.0009257383,0.0004971229],"domain_scores_gemma":[0.9893332,0.00717226,0.0009662268,0.001075371,0.0006752127,0.0007776706],"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.001142285,0.0002021647,0.003195343,0.000776501,0.0001486958,0.0003868724,0.0004803835,0.03085949,0.01761428,0.8897235,0.009287072,0.04618325],"study_design_scores_gemma":[0.00004019023,0.00008789622,0.001287924,0.0001234577,0.0000693234,0.0004671591,0.000126421,0.1130505,0.006686346,0.8673455,0.01066646,0.00004897959],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5120608,0.009694366,0.358491,0.003854149,0.0005291417,0.0002345945,0.002241578,0.001346636,0.1115477],"genre_scores_gemma":[0.9222323,0.002233484,0.06313661,0.0007111789,0.0004600904,0.0003618185,0.001442538,0.0004954499,0.008926611],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00970491,"threshold_uncertainty_score":0.03246617,"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."}}