{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001519158,0.0006926318,0.001640537,0.001203205,0.001622169,0.002434381,0.001284694,0.001894181,0.003396774],"category_scores_gemma":[0.011807,0.0004870438,0.0002787295,0.001568554,0.001753583,0.004792341,0.002873678,0.001925369,0.0006482855],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002163641,"about_ca_system_score_gemma":0.001149242,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001917048,"about_ca_topic_score_gemma":0.002288798,"domain_scores_codex":[0.9987168,0.0003415039,0.00007370397,0.0001754217,0.0003755305,0.0003170526],"domain_scores_gemma":[0.988781,0.006983841,0.0008161111,0.0023655,0.0007696653,0.0002838231],"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.004465342,0.0001549763,0.001889904,0.0008376281,0.00008069442,0.001258355,0.001412695,0.345364,0.04993916,0.4405574,0.01184043,0.1421994],"study_design_scores_gemma":[0.0002626241,0.0003060249,0.0003933468,0.00006814943,0.00006165108,0.000490233,0.000236736,0.6472647,0.02770091,0.3142623,0.00889203,0.00006134569],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.357158,0.003073584,0.6061857,0.003742066,0.0004616644,0.0001502223,0.0004197357,0.00367296,0.02513614],"genre_scores_gemma":[0.9559171,0.0005826784,0.03573666,0.0001964379,0.0001559945,0.0000782526,0.0001345851,0.0001770385,0.007021318],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003396774,"threshold_uncertainty_score":0.01569831,"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."}}