{"id":"W2172503700","doi":"10.1186/s13634-015-0273-3","title":"Systematic network coding for two-hop lossy transmissions","year":2015,"lang":"en","type":"article","venue":"EURASIP Journal on Advances in Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Queen's University","keywords":"Computer science; Linear network coding; Lossy compression; Decoding methods; Network packet; Computer network; Coding (social sciences); Encoding (memory); Hop (telecommunications); Algorithm; Mathematics","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.000993281,0.0005448338,0.0004278198,0.0004421589,0.0003697835,0.0004948046,0.0007243552,0.0005863109,0.001092921],"category_scores_gemma":[0.004008797,0.0002528807,0.0002952559,0.0005516204,0.001183673,0.00103764,0.0008342437,0.0007829198,0.0002053463],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001011058,"about_ca_system_score_gemma":0.001250317,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003147011,"about_ca_topic_score_gemma":0.002567468,"domain_scores_codex":[0.9993621,0.0002481373,0.00002137735,0.00006458546,0.0002328393,0.00007113811],"domain_scores_gemma":[0.9975401,0.001660754,0.0002416868,0.0002256217,0.0003005477,0.00003132418],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001036498,0.00002559737,0.0002852078,0.0001295814,0.00002557687,0.000229778,0.0001538642,0.7896948,0.006776014,0.1781905,0.001174425,0.02321093],"study_design_scores_gemma":[0.00001128235,0.00002697699,0.00006119664,0.00001350987,0.000005882718,0.00006641262,0.00001265422,0.9752412,0.00103496,0.02270896,0.0008058909,0.00001106453],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02298201,0.0003381082,0.9729053,0.0001682556,0.00004641646,0.00006417595,0.00006150883,0.00009606786,0.003338113],"genre_scores_gemma":[0.8463493,0.0007858486,0.148242,0.0001819291,0.00004909929,0.0003423092,0.000144015,0.00005327417,0.003852194],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003147011,"threshold_uncertainty_score":0.007335782,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06136503679480258,"score_gpt":0.3522335494749885,"score_spread":0.2908685126801859,"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."}}