{"id":"W2136144445","doi":"10.1109/tpds.2008.229","title":"Enforcing Minimum-Cost Multicast Routing against Selfish Information Flows","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Multicast; Computer science; Xcast; Source-specific multicast; Mathematical optimization; Enhanced Data Rates for GSM Evolution; Computer network; Routing (electronic design automation); Distributed computing; Cost allocation; Resource allocation; Protocol Independent Multicast; Mathematics; Economics; Telecommunications","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.003145792,0.0006045206,0.0009387701,0.000576481,0.0007511575,0.001507839,0.001242504,0.001018265,0.0007603959],"category_scores_gemma":[0.01151986,0.000362495,0.0003686794,0.0006073137,0.001413376,0.00206803,0.001469215,0.001079752,0.0001330827],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001508723,"about_ca_system_score_gemma":0.001327896,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00110586,"about_ca_topic_score_gemma":0.000833635,"domain_scores_codex":[0.9984262,0.0007640989,0.00006161621,0.0001580501,0.0003816516,0.0002083085],"domain_scores_gemma":[0.9934416,0.003924119,0.001090105,0.00077661,0.0005413407,0.0002262651],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001502353,0.00007826997,0.0007704001,0.00005094902,0.00003605082,0.0001256603,0.00011524,0.8201216,0.005218707,0.1554737,0.0005650344,0.01729409],"study_design_scores_gemma":[0.00001250213,0.00001845764,0.0000675887,0.000003987332,0.000004311178,0.00001704525,0.00001271275,0.9684074,0.001272229,0.02991433,0.0002651123,0.000004309455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1723712,0.0001067547,0.822193,0.0004151157,0.00004516826,0.00007566273,0.00003746502,0.0001821785,0.004573523],"genre_scores_gemma":[0.9482024,0.00008680257,0.05026185,0.00005098963,0.00002419439,0.00006266361,0.00001808502,0.00003656011,0.001256459],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003145792,"threshold_uncertainty_score":0.01663679,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02178488400082582,"score_gpt":0.2269740604068201,"score_spread":0.2051891764059943,"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."}}