{"id":"W4387623780","doi":"10.1109/tit.2023.3323839","title":"A Lego-Brick Approach to Coding for Network Communication","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Variable-length code; Shannon–Fano coding; Tunstall coding; Linear network coding; Context-adaptive binary arithmetic coding; Coding tree unit; Theoretical computer science; Computer science; Coding (social sciences); Algorithm; Context-adaptive variable-length coding; Multiple description coding; Channel code; Huffman coding; Mathematics; Decoding methods; Computer network; Data compression; Statistics","routes":{"ca_aff":true,"ca_fund":true,"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.001366782,0.001072406,0.0007465677,0.00193312,0.001000166,0.001758074,0.002070612,0.002091071,0.002996335],"category_scores_gemma":[0.004448181,0.0003732104,0.0006774989,0.002287096,0.003288841,0.002677273,0.002253445,0.004433062,0.001250174],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001657065,"about_ca_system_score_gemma":0.001093058,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001383581,"about_ca_topic_score_gemma":0.001097634,"domain_scores_codex":[0.9987739,0.00057226,0.00004381499,0.0001689993,0.0003455566,0.00009550217],"domain_scores_gemma":[0.998583,0.0007564801,0.0001106142,0.0003293663,0.0001806378,0.0000400622],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001058429,0.000008461495,0.00003736788,0.00004586905,0.000006196126,0.00003463395,0.00005701928,0.0182508,0.0009097767,0.9662039,0.00147136,0.01296415],"study_design_scores_gemma":[0.00001252307,0.00005289136,0.00005871852,0.00009024546,0.00001004849,0.000162565,0.00003104754,0.235068,0.00160279,0.7423489,0.02053126,0.000030946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001528253,0.0009425179,0.9877288,0.0005669299,0.0001344008,0.00004734327,0.00004856865,0.00005753606,0.008945704],"genre_scores_gemma":[0.2693872,0.006524883,0.7061998,0.001480891,0.0006193473,0.0008390557,0.0002225491,0.0001364935,0.01458966],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002996335,"threshold_uncertainty_score":0.01202291,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03895929421103779,"score_gpt":0.273654423902628,"score_spread":0.2346951296915902,"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."}}