{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001833533,0.00006739014,0.0000810273,0.00003142979,0.0001234294,0.00006139819,0.0002174352,0.00002290906,0.00002403156],"category_scores_gemma":[0.0002296006,0.00005691241,0.00004174325,0.0001621995,0.000007001108,0.00009167902,0.00003169898,0.00003527321,0.00009988501],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008599161,"about_ca_system_score_gemma":0.00003040233,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001740074,"about_ca_topic_score_gemma":0.000007041484,"domain_scores_codex":[0.9993289,0.00002041953,0.0001134516,0.0002324494,0.00007801034,0.0002267419],"domain_scores_gemma":[0.9992691,0.0002468814,0.00001571531,0.0002429837,0.00009551963,0.0001298357],"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.000002451314,0.00002859634,0.0000339889,0.000001472835,0.000005534594,0.000002170855,0.00009469492,0.002305245,0.0003878883,0.6783181,0.007131332,0.3116885],"study_design_scores_gemma":[0.0007380734,0.00009785825,0.000300684,0.00001397,0.000006899533,0.00001488187,0.00005638316,0.9035615,0.0003998975,0.002997336,0.09157652,0.0002359521],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002334242,0.00002428971,0.9889902,0.002115804,0.0003572068,0.0002318986,3.709442e-7,0.0001860577,0.00575996],"genre_scores_gemma":[0.6818117,4.717172e-7,0.3142846,0.001845997,0.0000391044,0.00003781197,1.468916e-7,0.000003727616,0.001976412],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9012563,"threshold_uncertainty_score":0.2320821,"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."}}