{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002201655,0.0002149082,0.0003954528,0.0001786238,0.0006164208,0.0005160396,0.001097536,0.00004202887,0.000006980928],"category_scores_gemma":[0.0002450391,0.0001698396,0.0000970379,0.0007972373,0.00004851123,0.001689826,0.00008754509,0.0005169113,0.000008064462],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001745408,"about_ca_system_score_gemma":0.0002262197,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":1.070275e-7,"about_ca_topic_score_gemma":0.00000446886,"domain_scores_codex":[0.9977204,0.0004004244,0.0007323491,0.0002864863,0.0004196215,0.0004407171],"domain_scores_gemma":[0.9981087,0.0005891664,0.0004189778,0.0002581997,0.0003578478,0.0002671199],"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.0002301506,0.0003117065,0.0004175357,0.002368604,0.00004161185,0.0001014931,0.0055678,0.3567125,0.0007812965,0.05023829,0.001010823,0.5822182],"study_design_scores_gemma":[0.002964111,0.0004630216,0.00003212573,0.02415952,0.00002508943,0.0003543449,0.0004942157,0.9363559,0.0004253771,0.0244068,0.009677359,0.0006420615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.000449119,0.02996776,0.9655766,0.0008910689,0.0004032807,0.000344028,3.784637e-7,0.00007551356,0.002292239],"genre_scores_gemma":[0.9437936,0.001014064,0.05391567,0.0006986862,0.00041079,0.00003997385,8.884695e-7,0.0000217289,0.0001045782],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9433445,"threshold_uncertainty_score":0.6925857,"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."}}