{"id":"W2021482093","doi":"10.1002/dac.859","title":"A scalable multicast routing protocol for building shortest path trees","year":2006,"lang":"en","type":"article","venue":"International Journal of Communication Systems","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":"Computer science; Multicast; Protocol Independent Multicast; Distance Vector Multicast Routing Protocol; Computer network; Distributed computing; Xcast; Pragmatic General Multicast; Source-specific multicast; IP multicast; Open Shortest Path First; Scalability; Routing protocol; Routing (electronic design automation); Link-state routing protocol; Database","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.001047284,0.0001070161,0.0001961561,0.0001469096,0.000125194,0.0004896317,0.001885814,0.00004872114,0.000003182832],"category_scores_gemma":[0.00009007783,0.0000924378,0.0001220654,0.0001242033,0.00003108055,0.0006080114,0.0001191064,0.0001456356,0.000003872266],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000110638,"about_ca_system_score_gemma":0.0001032927,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005281882,"about_ca_topic_score_gemma":0.00001093971,"domain_scores_codex":[0.9982761,0.0001535789,0.0008222366,0.0001215498,0.0004798022,0.0001466931],"domain_scores_gemma":[0.9969303,0.0004865799,0.0008462174,0.0003636288,0.001320849,0.00005240254],"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.0002008147,0.0005881865,0.006678057,0.00001121361,0.0002496249,0.0000183983,0.0003668271,0.1667873,0.001573326,0.685596,0.008745315,0.129185],"study_design_scores_gemma":[0.002192618,0.00007861638,0.001184351,0.0004573497,0.000009360648,0.0001356624,0.00006676748,0.9105706,0.0001170774,0.001111334,0.08393884,0.0001374697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001135028,0.0001466088,0.9850786,0.001738567,0.0005255254,0.01029273,0.000003383418,0.00005623375,0.001023275],"genre_scores_gemma":[0.9612879,0.000003721854,0.02929971,0.00005425043,0.0005267606,0.008667605,0.000002456699,0.000009328088,0.0001482778],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9601529,"threshold_uncertainty_score":0.472153,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02560027646901103,"score_gpt":0.3168552367566697,"score_spread":0.2912549602876586,"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."}}