{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008461733,0.0008937696,0.000590189,0.0003299617,0.0002423033,0.0006588917,0.0005984049,0.0009653755,0.001170041],"category_scores_gemma":[0.002323549,0.0002326901,0.0002624857,0.0005103997,0.0006203511,0.0006310269,0.0006408299,0.0005936465,0.0001524361],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007073447,"about_ca_system_score_gemma":0.0005999125,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001624392,"about_ca_topic_score_gemma":0.001003129,"domain_scores_codex":[0.9996367,0.0001761917,0.000006921622,0.00003521612,0.000099656,0.0000454075],"domain_scores_gemma":[0.9992586,0.0005233049,0.00008366708,0.00002003711,0.0000834695,0.00003088593],"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.0000423443,0.00002319177,0.0001238753,0.00003818025,0.000009028538,0.00005439751,0.00001662404,0.9785822,0.00174348,0.01236674,0.0003144486,0.006685517],"study_design_scores_gemma":[0.000005996166,0.00001537084,0.00002959316,0.000001408731,0.000001974785,0.000006202916,0.000002723349,0.9974065,0.0002585869,0.002173673,0.00009633427,0.000001609668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1019138,0.0006348863,0.8853865,0.0008319112,0.00008961459,0.00006895882,0.0001038599,0.00009618736,0.01087439],"genre_scores_gemma":[0.91594,0.0006116508,0.07799298,0.0001253511,0.00009122992,0.0001262259,0.00006332923,0.00004953807,0.004999629],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001624392,"threshold_uncertainty_score":0.005132139,"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."}}