{"id":"W2059627763","doi":"10.1002/wcm.718","title":"Optimal fault‐tolerant broadcasting in wireless mesh networks","year":2009,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Broadcasting (networking); Computer network; Wireless mesh network; Schedule; Fault tolerance; Network topology; Scheduling (production processes); Distributed computing; Wireless; Node (physics); Wireless network; Topology (electrical circuits); Telecommunications; Mathematical optimization; Mathematics","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.000774355,0.0002972404,0.000507585,0.0004043178,0.0004740398,0.0004465011,0.0007896804,0.0003980305,0.0007484323],"category_scores_gemma":[0.003903431,0.000294671,0.0002162098,0.0005098082,0.0004892608,0.0008073693,0.0005161591,0.0002993111,0.0001119237],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000897288,"about_ca_system_score_gemma":0.000696233,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002197793,"about_ca_topic_score_gemma":0.001503199,"domain_scores_codex":[0.9995726,0.0001626725,0.00002413769,0.00006278664,0.00008937289,0.00008838518],"domain_scores_gemma":[0.9983848,0.0009790196,0.0002559936,0.0001448099,0.0001609974,0.0000742655],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002737658,0.00003760302,0.0006152603,0.0001523075,0.00002726762,0.00007255918,0.0001040912,0.9353304,0.008287713,0.02460086,0.001721017,0.02877717],"study_design_scores_gemma":[0.00004101703,0.00006027181,0.0002339028,0.000006521845,0.000009527286,0.00002833928,0.00003972456,0.9786909,0.001764717,0.01842793,0.0006915682,0.000005623415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2968666,0.001091904,0.695886,0.0006849253,0.00008148185,0.000080199,0.0002083539,0.0003640209,0.004736482],"genre_scores_gemma":[0.9473701,0.0003910445,0.0510382,0.00004075691,0.00003793828,0.0000641324,0.0001343403,0.00003506386,0.0008883724],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002197793,"threshold_uncertainty_score":0.006510317,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01715625996090244,"score_gpt":0.2672746520109881,"score_spread":0.2501183920500857,"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."}}