{"id":"W2039351044","doi":"10.1109/tmm.2007.906557","title":"Efficient Algorithms for Optimal Uneven Protection of Single and Multiple Scalable Code Streams Against Packet Erasures","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Multimedia","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Erasure; Scalability; Algorithm; Network packet; Set partitioning in hierarchical trees; Code (set theory); Transmission (telecommunications); Binary erasure channel; Code rate; Decoding methods; Computer network; Channel capacity; Image compression; Channel (broadcasting)","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.0003963617,0.0002030576,0.0002327579,0.0002507451,0.0002012879,0.00003931948,0.0003305563,0.0001260942,0.000003850133],"category_scores_gemma":[0.00004207775,0.000190735,0.00008217867,0.000312421,0.0001223914,0.0002312974,0.00000846991,0.0001913661,0.000003267882],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007617024,"about_ca_system_score_gemma":0.00003285549,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004183283,"about_ca_topic_score_gemma":0.00003860858,"domain_scores_codex":[0.9984611,0.00004153675,0.0003763051,0.0004804329,0.0003050596,0.0003355619],"domain_scores_gemma":[0.9986364,0.0004235508,0.0001541984,0.0004760643,0.0001689409,0.0001408082],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001221917,0.0006138216,0.000008192247,0.00003485937,0.00002209538,0.00000257126,0.000361331,0.08323637,0.2232771,0.000009603951,0.00006021299,0.6922516],"study_design_scores_gemma":[0.0005786134,0.0002067917,0.00005053606,0.0000468082,0.000006128594,0.000003158522,0.00003007897,0.4959102,0.5027353,0.00003098098,0.0002792774,0.0001221243],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04528292,0.00003656808,0.9527884,0.00005791125,0.0003461758,0.0009479282,0.0001945926,0.000324455,0.00002102081],"genre_scores_gemma":[0.5516017,0.000008335306,0.4482313,0.00001935077,0.00002100806,0.00006188556,0.000005305678,0.00001519736,0.00003591066],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6921295,"threshold_uncertainty_score":0.7777946,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03320495448483631,"score_gpt":0.2834498373875809,"score_spread":0.2502448829027446,"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."}}