{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009258606,0.0001298079,0.0001896531,0.0008176087,0.0001024626,0.0001344356,0.000401732,0.00009899608,0.0000164984],"category_scores_gemma":[0.00004595661,0.0001283496,0.0000449265,0.001713209,0.0001197307,0.0001602815,0.0003550378,0.0003697769,0.00001662423],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001848597,"about_ca_system_score_gemma":0.00001954031,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003676055,"about_ca_topic_score_gemma":0.000004941967,"domain_scores_codex":[0.9986738,0.0001157453,0.000250602,0.0004746148,0.00008510467,0.0004001328],"domain_scores_gemma":[0.9992432,0.0004750689,0.00003089386,0.0001908283,0.000008852744,0.00005114619],"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.000005589311,0.00007426681,0.02306245,0.0001082053,0.00001367508,0.0005165808,0.003385915,0.001460505,0.000120329,0.8099702,0.00004768119,0.1612346],"study_design_scores_gemma":[0.0005267629,0.0001528204,0.04741109,0.0002946488,0.000004555154,0.0003547836,0.0002848608,0.4374688,0.000305685,0.5120701,0.000720766,0.000405209],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8910891,0.001503617,0.1046499,0.0004452723,0.001273142,0.00006103796,7.081902e-7,0.0001244901,0.0008526646],"genre_scores_gemma":[0.9946588,0.00002043496,0.005032319,0.0001969384,0.00003969607,0.000001762934,0.000001105995,0.000006437149,0.00004248552],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4360082,"threshold_uncertainty_score":0.5233946,"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."}}