{"id":"W2110370208","doi":"10.1109/icme.2005.1521569","title":"Globally Optimal Uneven Erasure-Protected Multi-Group Packetization of Scalable Codes","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Network packet; Computer science; Erasure; Decoding methods; Scalability; Fountain code; Binary erasure channel; Transmission (telecommunications); Code (set theory); Erasure code; Sequence (biology); Algorithm; Luby transform code; Theoretical computer science; Channel (broadcasting); Computer network; Block code; Channel capacity; Linear code; 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":[],"consensus_categories":[],"category_scores_codex":[0.000256199,0.0001463205,0.0001942365,0.00009330211,0.00007275566,0.00006770456,0.001121922,0.00008287784,0.00006350937],"category_scores_gemma":[0.00009063718,0.0001259965,0.00004223024,0.0004865277,0.00005513718,0.001112452,0.0004942293,0.00009988042,0.00003075158],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005014355,"about_ca_system_score_gemma":0.0000377467,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004222091,"about_ca_topic_score_gemma":0.0000317817,"domain_scores_codex":[0.9986236,0.00007761337,0.0003323156,0.0003775739,0.0003538298,0.0002350591],"domain_scores_gemma":[0.9987938,0.00004862016,0.0001556653,0.0007215281,0.0002024966,0.0000778324],"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.00006567846,0.001007954,0.001391853,0.00006576881,0.00004887785,0.000007809776,0.000282664,0.01301477,0.3845625,0.1454981,0.01535552,0.4386985],"study_design_scores_gemma":[0.0007375243,0.0001448645,0.002965749,0.00008578633,0.000005218824,0.000009807612,0.00001318189,0.528097,0.4489751,0.00152414,0.0170814,0.0003602523],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002499554,0.00008242754,0.9948701,0.0003321565,0.00004209983,0.000296,0.00001370626,0.0007917559,0.001072221],"genre_scores_gemma":[0.1832801,0.00001854477,0.8162253,0.0001408294,0.00001998382,0.00002007324,0.00001370944,0.000008481711,0.0002729364],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5150822,"threshold_uncertainty_score":0.5137987,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01631985814712776,"score_gpt":0.2748074896900032,"score_spread":0.2584876315428754,"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."}}