{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009294652,0.0001285787,0.0001391209,0.0000635168,0.000783453,0.0006738938,0.002487743,0.00002436967,0.000001646551],"category_scores_gemma":[0.000096148,0.00007575414,0.00007425638,0.001726987,0.0009221967,0.0005081848,0.002160908,0.0001964801,0.00000262813],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001893409,"about_ca_system_score_gemma":0.0003787593,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000892418,"about_ca_topic_score_gemma":0.00001060529,"domain_scores_codex":[0.9981961,0.00004956414,0.0002214474,0.0005229565,0.0006464273,0.0003635454],"domain_scores_gemma":[0.9984055,0.0002990619,0.0001081423,0.0008469623,0.0002483451,0.00009205956],"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.000009114481,0.0001985609,0.009078275,0.0001290764,0.00003573692,0.00003350424,0.01058793,0.001698097,0.02058309,0.6126352,0.0005014916,0.3445099],"study_design_scores_gemma":[0.0002885315,0.00006307638,0.03277603,0.0001002624,0.000006142388,0.0002046341,0.00005136708,0.8579395,0.02869079,0.07877443,0.0008570456,0.0002481354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5675763,0.0008319722,0.4235678,0.004667835,0.002271318,0.0002615447,0.000001910958,0.0001184483,0.0007028851],"genre_scores_gemma":[0.9587429,0.00003941535,0.04056813,0.0005011663,0.00009992511,0.000002987812,1.109163e-7,0.000004307501,0.00004104295],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8562415,"threshold_uncertainty_score":0.6498374,"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."}}