{"id":"W2159324217","doi":"10.1109/ccece.2006.277636","title":"A Minimum-Cost Resilient Tree-Based VPLS for Digital TV Broadcast Services","year":2006,"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":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; IPTV; Internet Group Management Protocol; Steiner tree problem; Multicast; Distributed computing; Multicast address; Source-specific multicast","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.0001018156,0.000158119,0.0001568026,0.00006665838,0.0001144904,0.0004688591,0.0005931881,0.00005667514,0.00002307152],"category_scores_gemma":[0.000004954568,0.0001330458,0.0001156888,0.0002169434,0.00002873325,0.0003919218,0.00005059293,0.00004944317,0.00008270243],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002489408,"about_ca_system_score_gemma":0.00006573302,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004007305,"about_ca_topic_score_gemma":0.0001389238,"domain_scores_codex":[0.9987674,0.00001662402,0.0002478665,0.0004050547,0.0002139227,0.0003490694],"domain_scores_gemma":[0.9991376,0.0001997342,0.00007209334,0.0003956162,0.0001025425,0.00009237458],"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.00007539607,0.0002445535,0.0008548622,0.00002838656,0.00001527061,0.000009681507,0.00004749918,0.005172817,0.0001072262,0.03830219,0.01890671,0.9362354],"study_design_scores_gemma":[0.001836835,0.0001393127,0.0008759457,0.00002621188,0.000009045505,0.000003304489,0.00002168701,0.8704289,0.0003261016,0.000926072,0.1251453,0.0002612982],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01774604,0.0001708208,0.9636506,0.002522833,0.0003127918,0.00059373,0.00001904673,0.0004369543,0.01454715],"genre_scores_gemma":[0.9847085,7.777657e-7,0.009174154,0.0009566458,0.0002465298,0.000104246,0.00002675889,0.000010335,0.004772078],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9669625,"threshold_uncertainty_score":0.5425451,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006992233838524745,"score_gpt":0.2102788320121091,"score_spread":0.2032865981735843,"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."}}