{"id":"W2101865986","doi":"10.1109/icme.2006.262481","title":"Efficient Algorithm for Globally Optimal Uneven Erasure-Protected Packetization of Scalable Code Streams","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Erasure; Payload (computing); Computer science; Network packet; Scalability; Algorithm; Code (set theory); Fidelity; Theoretical computer science; Computer network","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.0002305578,0.0001492374,0.0001970101,0.00008908087,0.00008758327,0.00006374405,0.0008135638,0.0000776579,0.00001463005],"category_scores_gemma":[0.00004030369,0.0001287433,0.00005739124,0.0004697233,0.00004659664,0.0002014981,0.0002843761,0.00005898408,0.000004518682],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000539455,"about_ca_system_score_gemma":0.00006142259,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009989538,"about_ca_topic_score_gemma":0.000009863748,"domain_scores_codex":[0.9985635,0.00004151001,0.0003538557,0.0004089238,0.0003657579,0.0002665049],"domain_scores_gemma":[0.9987509,0.00007582697,0.0001798326,0.0005993213,0.0003433308,0.00005079122],"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.00003497895,0.000731144,0.0001195738,0.00005512645,0.00002371596,0.000004535903,0.00004079014,0.1552831,0.04463074,0.07791454,0.01664979,0.7045119],"study_design_scores_gemma":[0.0003404089,0.00009887703,0.000229396,0.0000299735,0.000003429193,0.000002688254,0.000003687318,0.8170865,0.176423,0.003853797,0.00178771,0.0001405908],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001701801,0.00004396787,0.9960476,0.0001224815,0.00007540571,0.0006585291,0.00009286564,0.0005584481,0.0006989106],"genre_scores_gemma":[0.03881352,0.000002012901,0.9606892,0.00003660009,0.00002959422,0.0000686545,0.000058258,0.00001160698,0.0002905287],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7043713,"threshold_uncertainty_score":0.5249997,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008958574360670267,"score_gpt":0.2543211550419295,"score_spread":0.2453625806812593,"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."}}