{"id":"W2542809591","doi":"10.1109/allerton.2008.4797581","title":"Rates of convergence for greedy gossip with eavesdropping","year":2008,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Gossip; Eavesdropping; Gossip protocol; Network topology; Computer science; Convergence (economics); Greedy algorithm; Node (physics); Wireless sensor network; Wireless network; Rate of convergence; Wireless; Topology (electrical circuits); Computer network; Algorithm; Mathematics; Channel (broadcasting); Telecommunications; Combinatorics","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.0001583866,0.0001215095,0.0002260524,0.00005338231,0.00009485199,0.00002842532,0.0006352271,0.00003379333,0.00001329869],"category_scores_gemma":[0.00003705553,0.00008910501,0.0000605248,0.000265607,0.00007528482,0.0003410032,0.000060684,0.00003706575,0.00002294123],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002043096,"about_ca_system_score_gemma":0.00009574022,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001200166,"about_ca_topic_score_gemma":0.00001569775,"domain_scores_codex":[0.9989636,0.00002629615,0.0002596173,0.0002868823,0.0002167498,0.0002468848],"domain_scores_gemma":[0.9990255,0.0001160795,0.0001406391,0.0004355451,0.0002074604,0.0000748169],"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.0003544451,0.0008994009,0.2395399,0.000697814,0.0008697241,0.0002229679,0.005519339,0.003378157,0.1039562,0.6016986,0.02776993,0.01509349],"study_design_scores_gemma":[0.006574302,0.001068638,0.06693973,0.0002101093,0.00003643043,0.0002752574,0.0002831728,0.7818402,0.1311859,0.0008392558,0.009679308,0.001067727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04829147,0.0000671852,0.9492443,0.0002246253,0.0002032906,0.0003734305,0.000008061427,0.0001055125,0.001482113],"genre_scores_gemma":[0.97254,0.000003726234,0.02616833,0.00007488736,0.00002851739,0.00004021667,0.000003017222,0.000006464355,0.001134892],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9242485,"threshold_uncertainty_score":0.3633597,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04538249093315318,"score_gpt":0.2584686530943869,"score_spread":0.2130861621612338,"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."}}