{"id":"W2556413940","doi":"10.1109/lcomm.2016.2632731","title":"Sparse Random Linear Network Coding With Precoded Band Codes","year":2016,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"National Natural Science Foundation of China","keywords":"Computer science; Decoding methods; Code (set theory); Lossy compression; Linear network coding; Overhead (engineering); Algorithm; Linear code; Concatenated error correction code; Sparse matrix; Coding (social sciences); Theoretical computer science; Block code; Computer network; Mathematics; Artificial intelligence","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.000665536,0.0002155097,0.0002660868,0.0001031575,0.0007973822,0.0001630303,0.003766351,0.0000504111,0.00002659183],"category_scores_gemma":[0.00006068483,0.0001489942,0.00007590018,0.0006354775,0.0003306647,0.0006162846,0.0005295746,0.0002471557,0.00009898139],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008722998,"about_ca_system_score_gemma":0.00006407201,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006490063,"about_ca_topic_score_gemma":0.0001663325,"domain_scores_codex":[0.9980823,0.0006174301,0.0003645416,0.0003391344,0.0002121293,0.000384403],"domain_scores_gemma":[0.9941041,0.001214427,0.0001880114,0.004200961,0.0001720322,0.0001205071],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0004558302,0.0008145674,0.01713613,0.00005059168,0.0009119,0.00002953407,0.006186534,0.01233967,0.2936568,0.1772288,0.1720408,0.3191488],"study_design_scores_gemma":[0.02083686,0.0004661998,0.009490399,0.002967108,0.0002072205,0.0002040978,0.0001135423,0.2485221,0.0360818,0.002037158,0.6750801,0.003993429],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01217349,0.0007101433,0.933927,0.04974451,0.0002158099,0.000383639,0.000004151253,0.0003646669,0.002476564],"genre_scores_gemma":[0.8986423,0.003188253,0.09433623,0.003310382,0.0001163624,0.0001232912,0.000007349018,0.00002298306,0.0002528584],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8864688,"threshold_uncertainty_score":0.6998879,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0501694703091445,"score_gpt":0.2759008394902195,"score_spread":0.225731369181075,"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."}}