{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003372054,0.0001857155,0.0001979539,0.0001302268,0.0001900682,0.0002645414,0.0006992831,0.0000554566,0.00001410939],"category_scores_gemma":[0.00007001549,0.0001484163,0.00005840391,0.0002737701,0.0001518046,0.0003749485,0.0003444757,0.0002154489,0.0001445757],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004681366,"about_ca_system_score_gemma":0.00003397323,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003092519,"about_ca_topic_score_gemma":0.000001585317,"domain_scores_codex":[0.9985952,0.00002654354,0.0002206005,0.0003443772,0.0004315263,0.000381709],"domain_scores_gemma":[0.9989488,0.0001192931,0.00007646369,0.000671453,0.00003827655,0.0001457556],"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.000006124334,0.00005890803,0.00001946594,0.00005721731,0.00001138188,0.00003027782,0.001872156,0.0000527002,0.000420712,0.9951966,0.00003419786,0.002240248],"study_design_scores_gemma":[0.0003874559,0.0001389797,0.0001318037,0.00007426323,0.00000378031,0.00005758872,0.000112265,0.00248809,0.00214223,0.9936407,0.0006216291,0.0002012525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.141471,0.00007600687,0.8424127,0.001794406,0.00009610465,0.0002571145,0.000005850106,0.0002270393,0.01365984],"genre_scores_gemma":[0.6493183,0.00002572558,0.3495888,0.0003456912,0.00004099608,0.00002517097,0.000002764947,0.00003639748,0.0006160683],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5078474,"threshold_uncertainty_score":0.6052243,"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."}}