{"id":"W2949906226","doi":"10.1016/j.dam.2014.12.006","title":"The cost of perfection for matchings in graphs","year":2014,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Calgary","funders":"Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Combinatorics; Mathematics; Bipartite graph; Matching (statistics); Strong perfect graph theorem; Triangulation; Minimum weight; Cubic graph; Upper and lower bounds; Polygon mesh; Chordal graph; Discrete mathematics; Line graph; 1-planar graph; Graph; Geometry","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.001211659,0.0001004193,0.0001684861,0.00009058924,0.000139487,0.00005822685,0.0007013032,0.00003745544,0.000001029553],"category_scores_gemma":[0.0001300589,0.00006867683,0.00006216194,0.0003354026,0.000108741,0.00009942843,0.0001368198,0.0001100535,0.000005882629],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001713686,"about_ca_system_score_gemma":0.00001297533,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001958489,"about_ca_topic_score_gemma":0.000009105135,"domain_scores_codex":[0.9990242,0.00002499778,0.0002795465,0.0001855081,0.0002260001,0.0002597226],"domain_scores_gemma":[0.9982227,0.001011716,0.0001330925,0.000547861,0.00004706537,0.00003757806],"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.00001067858,0.00002427922,0.00001261018,0.0000799417,0.000005059351,5.825025e-8,0.0007494303,0.0001120161,0.003553034,0.9812492,0.00002675818,0.01417699],"study_design_scores_gemma":[0.0002999348,0.00003840577,0.00006839298,0.00002060064,0.000002671412,0.000001320564,0.0002265818,0.06300955,0.006479162,0.9291021,0.0006660193,0.00008525461],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01524501,0.00001515514,0.9791078,0.0001392902,0.00004676002,0.0007025067,0.000001863653,0.00004211942,0.004699522],"genre_scores_gemma":[0.8514362,0.00001580887,0.1481273,0.00003060601,0.00001240684,0.0003002427,0.000001781338,0.00001657966,0.00005906103],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8361912,"threshold_uncertainty_score":0.280056,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01527357090017878,"score_gpt":0.2862106641623685,"score_spread":0.2709370932621897,"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."}}