{"id":"W7131069251","doi":"10.57717/cgt.v5i2.72","title":"Finding maximum matchings in RDV graphs efficiently","year":2024,"lang":"en","type":"article","venue":"Computing in Geometry and Topology","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matching (statistics); Graph; Set (abstract data type); Representation (politics); Range (aeronautics); Independent set","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.00139283,0.0008060809,0.001887816,0.002316201,0.001006518,0.002168649,0.002416763,0.001989195,0.004509356],"category_scores_gemma":[0.01234652,0.001111105,0.001263636,0.004253757,0.0009662694,0.007871931,0.00327845,0.001175065,0.001651885],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001352194,"about_ca_system_score_gemma":0.001237045,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002774171,"about_ca_topic_score_gemma":0.00369136,"domain_scores_codex":[0.9974833,0.0005003437,0.000186291,0.0008445024,0.0005976292,0.0003878662],"domain_scores_gemma":[0.9947883,0.002995951,0.000628894,0.001077105,0.0003284666,0.0001812664],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009568058,0.0005143409,0.007484715,0.001631563,0.0003186931,0.0007295583,0.001429221,0.261081,0.04290818,0.1084603,0.0190525,0.5554332],"study_design_scores_gemma":[0.0001333784,0.0001759093,0.001480334,0.0001065558,0.00006650993,0.0005863323,0.000803314,0.5821307,0.01465689,0.387767,0.01204749,0.00004565697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1762868,0.001369535,0.8038667,0.001217069,0.00008962829,0.0003401574,0.002988761,0.005611671,0.008229717],"genre_scores_gemma":[0.4668189,0.0005204579,0.5228622,0.0002882521,0.00006978316,0.0001948428,0.005348772,0.0007461511,0.003150588],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004509356,"threshold_uncertainty_score":0.01508534,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01024158788367179,"score_gpt":0.2600547494874061,"score_spread":0.2498131616037343,"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."}}