{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001003609,0.0002950485,0.0005294727,0.0006558638,0.0009345725,0.00120024,0.001509266,0.0007864989,0.00310579],"category_scores_gemma":[0.004830592,0.000280858,0.0003307526,0.0009479225,0.0009333863,0.002035961,0.00189912,0.0007325065,0.0006893123],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009970056,"about_ca_system_score_gemma":0.001295155,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007537452,"about_ca_topic_score_gemma":0.000882354,"domain_scores_codex":[0.9988474,0.0002071308,0.0000596564,0.0003810609,0.0003485824,0.0001561956],"domain_scores_gemma":[0.9976575,0.0008346987,0.0003140554,0.0006279387,0.0004073317,0.0001583726],"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.0005369301,0.0002111464,0.001523101,0.0002407751,0.00006883542,0.0002350067,0.0003674726,0.2960772,0.03276238,0.4526007,0.005743314,0.2096331],"study_design_scores_gemma":[0.00007073642,0.00008024259,0.0003024113,0.00001477418,0.00002428461,0.000161694,0.0000901734,0.7237296,0.01294522,0.2541783,0.008384755,0.00001794288],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06545568,0.000153975,0.9216217,0.0004091067,0.0000461981,0.0001022547,0.000101795,0.000945497,0.0111637],"genre_scores_gemma":[0.78075,0.0001667238,0.20867,0.0001305965,0.00005214926,0.0002068044,0.0002564508,0.0001107724,0.009656433],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00310579,"threshold_uncertainty_score":0.01038992,"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."}}