{"id":"W2004151710","doi":"10.1002/net.20090","title":"Distributed delay constrained multicast routing algorithm with efficient fault recovery","year":2005,"lang":"en","type":"article","venue":"Networks","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa","funders":"","keywords":"Multicast; Computer science; Xcast; Pragmatic General Multicast; Protocol Independent Multicast; Source-specific multicast; Distance Vector Multicast Routing Protocol; Computer network; Distributed computing; Inter-domain; IP multicast; Algorithm; Reliable multicast; Tree (set theory); 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003167941,0.0002428429,0.0002510989,0.00004600264,0.0002377231,0.0002195989,0.0005177733,0.0001295896,0.00002535577],"category_scores_gemma":[0.00002032849,0.0002003749,0.00008203716,0.000464027,0.00009828324,0.0001922305,0.0001040417,0.0003408641,0.00004510999],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008439165,"about_ca_system_score_gemma":0.0000689291,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008864007,"about_ca_topic_score_gemma":0.00002258726,"domain_scores_codex":[0.9981543,0.0000850736,0.0003266506,0.0005128284,0.0002963312,0.0006247709],"domain_scores_gemma":[0.9988058,0.0002609427,0.0001403215,0.0004587066,0.0001276186,0.0002066244],"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.0000119786,0.00004191338,0.00003511202,5.667512e-7,0.00002202001,0.00002161795,0.00004051748,0.4749392,0.000001013836,0.001499857,0.0004255704,0.5229606],"study_design_scores_gemma":[0.001154915,0.00009817115,0.0002515612,0.00004721636,0.00001911173,0.00008706629,0.00001743994,0.993639,0.000006453784,0.00001164631,0.004393688,0.0002737448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004372906,0.0002429479,0.9925966,0.000977979,0.0003857451,0.0002517393,0.000009299242,0.0004409971,0.0007218041],"genre_scores_gemma":[0.9155668,0.00001231138,0.08301674,0.000585953,0.000633496,0.00002566392,0.0000241706,0.00001530047,0.0001195338],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9111939,"threshold_uncertainty_score":0.817105,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.005435958961519562,"score_gpt":0.2012463873339291,"score_spread":0.1958104283724096,"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."}}