{"id":"W2094285453","doi":"10.1016/j.ipl.2004.10.007","title":"Broadcasting with locally bounded Byzantine faults","year":2004,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":130,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Resilience (materials science); Distributed computing; Broadcasting (networking); Node (physics); Greedy algorithm; Heuristic; Byzantine fault tolerance; Wireless sensor network; Computer network; Fault tolerance; Algorithm","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.0001718746,0.0001396787,0.0001245895,0.00009736826,0.0002537379,0.0006630765,0.0004164203,0.00003853124,0.00000118307],"category_scores_gemma":[0.0000213142,0.0001136025,0.00002421006,0.000509926,0.00004836665,0.005139667,0.00004638548,0.0001246366,0.00007387179],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004771828,"about_ca_system_score_gemma":0.0001373377,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003072404,"about_ca_topic_score_gemma":0.000002495108,"domain_scores_codex":[0.9988219,0.000009032993,0.0003603386,0.0001509577,0.0003799651,0.0002778459],"domain_scores_gemma":[0.9992697,0.000008783256,0.0002717462,0.0002187472,0.0001639848,0.00006703754],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001116171,0.0001533968,0.001365148,0.001112313,0.00007048393,0.0001263578,0.022367,0.1479543,0.004555457,0.03882858,0.002703867,0.7806515],"study_design_scores_gemma":[0.02258615,0.0006857519,0.01766514,0.00673693,0.00005653234,0.003059762,0.001655837,0.5943952,0.01590413,0.001800177,0.3307933,0.004661006],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04918167,0.00002108739,0.9442424,0.003917927,0.0001097633,0.0001223244,0.000002471654,0.0002993443,0.002103066],"genre_scores_gemma":[0.9511752,4.738042e-7,0.04385436,0.004886436,0.00003704535,0.00001353453,0.00001701385,0.000005108974,0.00001089527],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9019935,"threshold_uncertainty_score":0.6394063,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.005448011887945285,"score_gpt":0.1968997007259594,"score_spread":0.1914516888380141,"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."}}