{"id":"W4206719352","doi":"10.1016/j.procs.2021.11.025","title":"The Speed and Threshold of the Biased Perfect Matching Game","year":2021,"lang":"en","type":"article","venue":"Procedia Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal; Dawson College; McGill University","funders":"","keywords":"Infinity; Matching (statistics); Computer science; Circuit breaker; Combinatorics; Mathematical economics; Algorithm; Discrete mathematics; Mathematics; Physics; Statistics; Mathematical analysis; Quantum mechanics","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.005037459,0.0008894107,0.001679679,0.001313478,0.001228331,0.0044474,0.002828343,0.00234937,0.007547912],"category_scores_gemma":[0.04832207,0.0008860138,0.000990868,0.0008283281,0.003184875,0.008493504,0.002777257,0.003204097,0.001508179],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002720806,"about_ca_system_score_gemma":0.002239505,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002036097,"about_ca_topic_score_gemma":0.001203782,"domain_scores_codex":[0.9966113,0.00118086,0.0001244892,0.0005997025,0.0005833449,0.0009002841],"domain_scores_gemma":[0.9673162,0.02532037,0.002210078,0.001853197,0.001166767,0.002133341],"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.003050149,0.0002314129,0.008803634,0.0004326857,0.0002078703,0.0003669152,0.0009484691,0.1486004,0.02281831,0.7660656,0.008960621,0.03951403],"study_design_scores_gemma":[0.0002285368,0.0001795204,0.0013112,0.00007297038,0.00007063465,0.0002545309,0.0001332826,0.4504931,0.004280643,0.5406201,0.002287741,0.00006775089],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6207895,0.001503745,0.3036654,0.004947812,0.0002908187,0.0002515732,0.0007663594,0.001092415,0.06669233],"genre_scores_gemma":[0.9626856,0.0006742384,0.02857831,0.0004940015,0.0001238993,0.00020142,0.0002279588,0.0001849095,0.006829666],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007547912,"threshold_uncertainty_score":0.02664095,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01651797124620412,"score_gpt":0.2352522358121574,"score_spread":0.2187342645659533,"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."}}