{"id":"W2162787176","doi":"10.1109/infcom.2005.1498444","title":"Efficient and distributed computation of maximum multicast rates","year":2005,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Multicast; Subgradient method; Computer science; Unicast; Mathematical optimization; Lagrangian relaxation; Maximum flow problem; Routing (electronic design automation); Distributed computing; Computer network; Mathematics","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.002497385,0.0006611777,0.001158856,0.0007007765,0.0005358464,0.001519158,0.001399944,0.0008949874,0.001734573],"category_scores_gemma":[0.01161867,0.0005631448,0.0004845497,0.0006312486,0.00100959,0.001686604,0.00167207,0.001341814,0.0003799564],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001342391,"about_ca_system_score_gemma":0.001673363,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00147287,"about_ca_topic_score_gemma":0.001990803,"domain_scores_codex":[0.9988837,0.0004371465,0.00004167645,0.0001906665,0.0003237843,0.0001231195],"domain_scores_gemma":[0.9973978,0.001715185,0.0002153613,0.0002965598,0.0002864728,0.0000887449],"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.0001070311,0.00003558043,0.0002931399,0.00006925525,0.00002343582,0.00005206783,0.00008909128,0.8857909,0.003822545,0.06717041,0.001143482,0.04140299],"study_design_scores_gemma":[0.00001194247,0.000006822686,0.00003102922,0.000003618125,0.000001732059,0.000005321815,0.000006230632,0.9828132,0.0008091018,0.01603366,0.0002750753,0.000002099555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01196599,0.00007197916,0.9854689,0.0001114869,0.00001852983,0.00002732693,0.00002528326,0.0002018101,0.002108679],"genre_scores_gemma":[0.5461103,0.0001791781,0.4510588,0.00005740196,0.00005965593,0.0002270086,0.0001199738,0.0001451815,0.002042618],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002497385,"threshold_uncertainty_score":0.01320761,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03005772383521372,"score_gpt":0.2945975839172978,"score_spread":0.2645398600820841,"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."}}