{"id":"W4383982199","doi":"10.2139/ssrn.4506735","title":"The Minimum Size of Matching-Saturated Graphs","year":2023,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Matching (statistics); Combinatorics; Mathematics; Statistics","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.002079917,0.0009859885,0.002076612,0.00210701,0.001479753,0.004837543,0.0031573,0.003081512,0.01176103],"category_scores_gemma":[0.02281056,0.001517471,0.001070114,0.002591173,0.002244775,0.009897362,0.00231594,0.002203547,0.001180312],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002066317,"about_ca_system_score_gemma":0.001610114,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009275794,"about_ca_topic_score_gemma":0.001073875,"domain_scores_codex":[0.9978749,0.0007096552,0.0001125821,0.0005619674,0.000385671,0.0003553757],"domain_scores_gemma":[0.9646876,0.02686931,0.002372608,0.002441822,0.00130936,0.002319292],"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.004564671,0.0004287976,0.01133256,0.002331511,0.0004212557,0.0006492484,0.001605775,0.07354132,0.04793018,0.7499487,0.03885388,0.06839205],"study_design_scores_gemma":[0.0002789907,0.0001434961,0.003124628,0.0001020375,0.0001297832,0.0004641894,0.000340944,0.07530724,0.007864814,0.9072121,0.004988336,0.00004343611],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.84681,0.00197492,0.08397846,0.008984447,0.0003218844,0.0001679202,0.006989288,0.001054886,0.04971812],"genre_scores_gemma":[0.9630857,0.001128088,0.02386225,0.0006528377,0.0005525803,0.0002432906,0.002697619,0.0004925284,0.007285214],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01176103,"threshold_uncertainty_score":0.03934461,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01784358466892381,"score_gpt":0.2958990702378338,"score_spread":0.27805548556891,"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."}}