{"id":"W1537313756","doi":"10.1109/glocom.2002.1189109","title":"Extensions to OSPF for tunnel multicasting","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Multicast; Open Shortest Path First; Computer network; Computer science; Protocol Independent Multicast; Overhead (engineering); Routing (electronic design automation); Distance Vector Multicast Routing Protocol; Source-specific multicast; Xcast; Routing protocol; Protocol (science); Distributed computing; Link-state routing protocol; Medicine","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.001645189,0.0006078212,0.0004049363,0.0008591568,0.00073719,0.0007659945,0.001151668,0.0007932645,0.003312026],"category_scores_gemma":[0.003542699,0.0002853468,0.0006716029,0.0005981218,0.0003470595,0.002616598,0.001347424,0.001308664,0.001288948],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000414888,"about_ca_system_score_gemma":0.0008633647,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000945193,"about_ca_topic_score_gemma":0.001051335,"domain_scores_codex":[0.9992368,0.0001546403,0.00006794339,0.00005255122,0.0003436714,0.0001444441],"domain_scores_gemma":[0.9985494,0.0002441988,0.0001228915,0.0003892531,0.000596971,0.00009732325],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004321964,0.000370997,0.001763408,0.0005010925,0.0000901681,0.0009315743,0.0005063607,0.04831243,0.02556009,0.2856431,0.0443689,0.5915197],"study_design_scores_gemma":[0.0001694763,0.0006233457,0.001326632,0.0002551255,0.000193285,0.002341674,0.000220732,0.2838232,0.01996199,0.2849685,0.4059391,0.0001769918],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04352338,0.002385923,0.9106057,0.001018002,0.0008183921,0.0004556277,0.0006317522,0.005199723,0.03536147],"genre_scores_gemma":[0.3797452,0.003815777,0.5936643,0.0005549871,0.0007862902,0.0006382135,0.001918522,0.0004206531,0.01845617],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003312026,"threshold_uncertainty_score":0.01107979,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02210246436124521,"score_gpt":0.25419996482345,"score_spread":0.2320975004622048,"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."}}