{"id":"W2101703048","doi":"10.1145/571825.571877","title":"Dynamic and self-stabilizing distributed matching","year":2002,"lang":"en","type":"article","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Atomicity; Bipartite graph; Computer science; Matching (statistics); Asynchronous communication; Self-stabilization; Distributed algorithm; Theoretical computer science; Time complexity; 3-dimensional matching; Blossom algorithm; Distributed computing; Graph; Quadratic equation; Computational complexity theory; Algorithm; Mathematics; Computer network","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.0001295919,0.0001092017,0.0001324272,0.00003039396,0.0001333214,0.0002447196,0.000324067,0.00004132684,0.00002834036],"category_scores_gemma":[0.000008540302,0.00009333343,0.00002940335,0.0002363029,0.00001582932,0.0004374529,0.0001363715,0.00008101048,0.000058868],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003408069,"about_ca_system_score_gemma":0.000004795181,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002454838,"about_ca_topic_score_gemma":0.00001141081,"domain_scores_codex":[0.9990995,0.0000278177,0.000181274,0.0003038035,0.0001469661,0.0002406654],"domain_scores_gemma":[0.9994572,0.0000410704,0.00004470497,0.0003326514,0.00003191395,0.00009243886],"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.000006015281,0.001327036,0.01069856,0.0004536321,0.0002135881,0.0002849115,0.01250495,0.001251423,0.004185861,0.726957,0.01836252,0.2237546],"study_design_scores_gemma":[0.0003222517,0.00002793329,0.004672759,0.00002727334,0.000003634873,0.00007436711,0.0001020954,0.9737658,0.00004364566,0.001753819,0.01894812,0.0002583332],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07433756,0.000484177,0.9179622,0.0008829202,0.0001803409,0.0001115432,0.0000140379,0.0005546786,0.005472554],"genre_scores_gemma":[0.9791141,0.00003334871,0.02047321,0.0001052445,0.000009672855,0.000006067256,0.000003740816,0.000004978252,0.0002496804],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9725143,"threshold_uncertainty_score":0.3806027,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009245359900534392,"score_gpt":0.2150923961071302,"score_spread":0.2058470362065958,"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."}}