{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001378846,0.000133814,0.000134144,0.0003242022,0.0008948572,0.0002562922,0.0009357805,0.00006161493,0.00001384827],"category_scores_gemma":[0.00002768623,0.0001362011,0.00009322252,0.001452806,0.00003185551,0.00141547,0.00001642182,0.0001870093,0.0004239276],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000767486,"about_ca_system_score_gemma":0.00004416797,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001185035,"about_ca_topic_score_gemma":0.000002709971,"domain_scores_codex":[0.9988388,0.0001985055,0.0003667836,0.0001456279,0.0001807079,0.0002695931],"domain_scores_gemma":[0.998192,0.0005437717,0.0001015427,0.0008762241,0.0001937196,0.0000927449],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003867405,0.00003971092,6.06019e-7,0.00001847952,0.00002620786,3.234334e-8,0.004701533,0.2395986,0.00003151213,0.5223338,0.009704861,0.2235059],"study_design_scores_gemma":[0.0007280805,0.0001064874,0.00009336186,0.00008142076,0.00001443543,0.000005093099,0.0005787109,0.9031171,0.001081229,0.0108521,0.08295852,0.0003834915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0001336239,0.00002166437,0.9869673,0.001083938,0.0003646027,0.000645709,0.000009491325,0.0006242515,0.01014945],"genre_scores_gemma":[0.9397411,0.0003396646,0.05530642,0.002780825,0.00004474848,0.0008360049,0.00004664309,0.00001444296,0.0008900902],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9396076,"threshold_uncertainty_score":0.6882609,"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."}}