{"id":"W2086236932","doi":"10.1016/j.tcs.2006.10.031","title":"Feasibility and complexity of broadcasting with random transmission failures","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Université du Québec en Outaouais","keywords":"Broadcasting (networking); Transmission (telecommunications); Computer science; Theoretical computer science; Distributed computing; Computer network; Telecommunications","routes":{"ca_aff":true,"ca_fund":true,"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":["sts"],"consensus_categories":[],"category_scores_codex":[0.001345931,0.0001324651,0.0002490379,0.00008960877,0.0003024826,0.0002135679,0.0007072726,0.00003430356,0.00001161871],"category_scores_gemma":[0.0000244813,0.00008752264,0.00004094411,0.0005683641,0.003346251,0.0003876109,0.000220762,0.0001133023,0.000001378277],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002451642,"about_ca_system_score_gemma":0.00004906651,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006521736,"about_ca_topic_score_gemma":0.000006371708,"domain_scores_codex":[0.9982855,0.0001370034,0.0003051215,0.0005111645,0.0004536369,0.0003076078],"domain_scores_gemma":[0.9988874,0.0002073754,0.00008919333,0.000394037,0.0003041679,0.0001178006],"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.00004229278,0.00004210739,0.0006411353,0.00001732555,0.00000180394,0.000002602903,0.0001618071,0.0005434662,0.0004777079,0.9885,0.00001909581,0.009550638],"study_design_scores_gemma":[0.0008836603,0.0002605494,0.00554411,0.00009222863,0.000003681097,0.00006357089,0.000007768206,0.8765631,0.003064154,0.1132539,0.000098897,0.0001643814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1315325,0.00005022869,0.8661298,0.0002658146,0.0001552887,0.0001612079,5.666609e-7,0.0000718138,0.0016328],"genre_scores_gemma":[0.8806136,9.513932e-7,0.1192525,0.00004139931,0.00008248795,0.000001838307,2.501318e-7,0.000003230062,0.000003811928],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8760196,"threshold_uncertainty_score":0.999366,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02259923554176992,"score_gpt":0.2421268848567536,"score_spread":0.2195276493149836,"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."}}