{"id":"W4360978592","doi":"10.1007/s10878-023-00998-8","title":"A detailed introduction to a minimum-cost perfect matching algorithm based on linear programming","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Uniqueness; Theory of computation; Minimum weight; Linear programming; Matching (statistics); Algorithm; Mathematics; Computer science; Enhanced Data Rates for GSM Evolution; Cover (algebra); Combinatorics; Mathematical optimization; Artificial intelligence","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.001029842,0.001257916,0.001470813,0.001542121,0.0007937454,0.002501557,0.003371369,0.001999886,0.02742235],"category_scores_gemma":[0.004093517,0.001166486,0.001701784,0.003466557,0.0008937739,0.003804214,0.002525136,0.004775109,0.01261007],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001300874,"about_ca_system_score_gemma":0.001608619,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00136669,"about_ca_topic_score_gemma":0.001676305,"domain_scores_codex":[0.9987941,0.0003190251,0.00009005143,0.0002380015,0.0004603034,0.00009852408],"domain_scores_gemma":[0.9993762,0.0003034637,0.00004197292,0.0001298237,0.0001210364,0.00002749094],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006885862,0.0002520479,0.0002338249,0.000685438,0.0000784127,0.0001249055,0.00007838153,0.09790049,0.005081267,0.4561733,0.03746402,0.4018591],"study_design_scores_gemma":[0.00003549569,0.0001046286,0.0002712554,0.0001638089,0.00003129238,0.0004140286,0.00003233692,0.3496312,0.003295802,0.5247615,0.1211779,0.00008074711],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004724374,0.001442663,0.9810823,0.0004617634,0.0003053464,0.0001147599,0.0002507451,0.0005156292,0.01535434],"genre_scores_gemma":[0.02436057,0.004396735,0.9542433,0.0006413601,0.0005871542,0.0004200785,0.0006118719,0.0005682664,0.01417055],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02742235,"threshold_uncertainty_score":0.09173685,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008549360243585968,"score_gpt":0.2621156453445673,"score_spread":0.2535662851009813,"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."}}