{"id":"W1923115033","doi":"10.1109/ccece.2003.1226067","title":"Computation of the residual packet loss probability in a binary multicast tree","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec à Montréal; École de Technologie Supérieure; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multicast; Computer science; Packet loss; Computer network; Router; Automatic repeat request; Network packet; Quality of service; Hybrid automatic repeat request","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":[],"consensus_categories":[],"category_scores_codex":[0.0002398482,0.0000658779,0.0000989507,0.0000308248,0.00003612775,0.00002012771,0.0003558347,0.00003401775,0.000002496844],"category_scores_gemma":[0.00003110415,0.00004346086,0.00003688466,0.0003445924,0.0000835102,0.0001321825,0.00009830905,0.00008340314,0.000006406582],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000379856,"about_ca_system_score_gemma":0.0001000808,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004755552,"about_ca_topic_score_gemma":0.0003550431,"domain_scores_codex":[0.9992181,0.00008605047,0.0002055912,0.000192013,0.0001686351,0.0001296307],"domain_scores_gemma":[0.9995272,0.00007025739,0.00005425852,0.0002671655,0.00005424324,0.0000268971],"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.00006690417,0.0008497403,0.01646679,0.00003678427,0.00001861606,0.0000190856,0.002160878,0.2978407,0.0003864163,0.2793849,0.0002919515,0.4024772],"study_design_scores_gemma":[0.003664374,0.0002095804,0.3435403,0.0001097123,0.00000769851,0.00001647287,0.00007557272,0.5965628,0.0008175473,0.05470454,0.00006131956,0.0002301009],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8202077,0.00002740066,0.1725595,0.005962228,0.0001315932,0.0002902602,6.858039e-7,0.00006444613,0.0007562161],"genre_scores_gemma":[0.9899026,9.568729e-7,0.009892199,0.0001408036,0.00001899669,0.00000885024,3.400247e-7,0.000002114544,0.00003315985],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4022471,"threshold_uncertainty_score":0.1772282,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01501740590426036,"score_gpt":0.2321796547520469,"score_spread":0.2171622488477865,"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."}}