{"id":"W2042269609","doi":"10.1016/j.disc.2004.05.003","title":"Tight bounds on maximal and maximum matchings","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":84,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Bounded function; Upper and lower bounds; Planar graph; Discrete mathematics; Graph; Class (philosophy); Degree (music); Computer science","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01326416,0.006437758,0.009555369,0.01063121,0.006363899,0.01740915,0.01592717,0.007268539,0.03597095],"category_scores_gemma":[0.1058825,0.006822857,0.004671704,0.01629426,0.01000856,0.04950835,0.01822986,0.0174145,0.005821025],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.009890309,"about_ca_system_score_gemma":0.004043132,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003188593,"about_ca_topic_score_gemma":0.00522146,"domain_scores_codex":[0.9852771,0.00317545,0.0006759708,0.002924809,0.00399409,0.003952522],"domain_scores_gemma":[0.8708556,0.1005779,0.005387488,0.01089637,0.004283229,0.007999386],"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.002543444,0.0004797941,0.00190397,0.00126369,0.00024701,0.0001775089,0.0009168976,0.04709711,0.003310052,0.8682785,0.02818522,0.04559685],"study_design_scores_gemma":[0.000104804,0.00006011149,0.000560595,0.0001394146,0.0001384449,0.0001178703,0.0001161406,0.04067389,0.00114701,0.9521908,0.004710164,0.0000408239],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1612966,0.0218468,0.5675094,0.02786881,0.001600117,0.0004744592,0.007836405,0.004339767,0.2072277],"genre_scores_gemma":[0.7987635,0.01212357,0.1311104,0.005119591,0.004515278,0.0009646643,0.005775406,0.003256081,0.0383716],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03597095,"threshold_uncertainty_score":0.1203349,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01734329773186264,"score_gpt":0.2819589768785469,"score_spread":0.2646156791466843,"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."}}