{"id":"W2065779582","doi":"10.1109/pimrc.2011.6139888","title":"Optimization of rateless-coded asynchronous multimedia multicast","year":2011,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Multicast; Computer science; Greedy algorithm; Asynchronous communication; Coding (social sciences); Optimization problem; Convex optimization; Mathematical optimization; Encoding (memory); Relaxation (psychology); Regular polygon; Algorithm; Computer network; Mathematics; Artificial intelligence","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.0002101704,0.0001082725,0.0001500019,0.0001167471,0.00003478421,0.00001895433,0.0006652441,0.00006475639,0.0001119228],"category_scores_gemma":[0.0000969544,0.00009752069,0.0000437137,0.0002781216,0.00005084497,0.0003443649,0.0001889669,0.00007958409,0.00002644041],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002483602,"about_ca_system_score_gemma":0.00004079139,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001897432,"about_ca_topic_score_gemma":0.00002092483,"domain_scores_codex":[0.9991181,0.00004430237,0.0002487801,0.0002580112,0.000152433,0.0001783405],"domain_scores_gemma":[0.9990568,0.00006722555,0.0001210624,0.0005270723,0.0001720225,0.00005585953],"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.0001512888,0.003406152,0.02481397,0.0002421729,0.0002127814,0.0001431398,0.05758137,0.02359324,0.0659861,0.1121692,0.00260304,0.7090975],"study_design_scores_gemma":[0.0001571228,0.0000847802,0.0007390224,0.00001339164,0.000003339491,0.000007477668,0.00003275754,0.7653895,0.2331301,0.0003126804,0.000007886283,0.0001220008],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00649588,0.00001167572,0.9764671,0.00002276044,0.000207762,0.0001591459,4.646945e-7,0.0007294118,0.0159058],"genre_scores_gemma":[0.4810851,0.000002903844,0.518822,0.00002560375,0.000006995617,0.000006390165,5.631486e-7,0.000005841486,0.00004462836],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7417963,"threshold_uncertainty_score":0.3976778,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03235511267393375,"score_gpt":0.2553893031467278,"score_spread":0.223034190472794,"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."}}