{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002304405,0.0002683727,0.0003100222,0.0002433538,0.0006368484,0.0002808055,0.0005293745,0.0001822631,0.000001489985],"category_scores_gemma":[0.0000260814,0.0002558643,0.00008325618,0.0007237406,0.00005486703,0.001071182,0.00001242735,0.0002879894,0.0001079547],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001310233,"about_ca_system_score_gemma":0.00005706114,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001269882,"about_ca_topic_score_gemma":0.00002502922,"domain_scores_codex":[0.9981666,0.00005778081,0.0005588562,0.0003550375,0.0003715259,0.0004902271],"domain_scores_gemma":[0.9988269,0.0001349786,0.0001370523,0.0005504318,0.000144485,0.0002062181],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002879029,0.00008075816,0.0001414629,0.00003824481,0.00005261427,0.00003423865,0.001206986,0.9785144,0.0002047753,0.0004247413,0.002297714,0.01697523],"study_design_scores_gemma":[0.0008534911,0.00009739309,0.00049058,0.000103028,0.00001198957,0.0001759538,0.0005058089,0.9905196,0.000251866,0.00001374025,0.006572146,0.0004044222],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05458092,0.00003756774,0.9423656,0.0003614397,0.0007328821,0.0005771808,0.0001664152,0.0008560563,0.0003219724],"genre_scores_gemma":[0.9928319,0.00004949893,0.006640351,0.0001526453,0.00003543034,0.0001687305,0.00003949627,0.000009561384,0.00007241551],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.938251,"threshold_uncertainty_score":0.9999893,"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."}}