{"id":"W3100195679","doi":"","title":"Quantized network coding for sparse messages","year":2016,"lang":"en","type":"preprint","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Linear network coding; Decoding methods; Computer science; Network packet; Quantization (signal processing); Restricted isometry property; Algorithm; Data compression; Multiple description coding; Coding (social sciences); Coding tree unit; Minification; Distributed source coding; Redundancy (engineering); Theoretical computer science; Compressed sensing; Variable-length code; Computer network; Mathematics","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007834689,0.0004371933,0.0004219631,0.0004692338,0.0002568991,0.000675081,0.0006960446,0.0005626434,0.001741309],"category_scores_gemma":[0.003883355,0.0001723854,0.0001837282,0.0006960841,0.0009789369,0.001583377,0.0007944044,0.0009150451,0.0002110088],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001078161,"about_ca_system_score_gemma":0.0006513027,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002058595,"about_ca_topic_score_gemma":0.001553178,"domain_scores_codex":[0.9995657,0.0001553006,0.00001380483,0.00004959508,0.0001685206,0.00004717049],"domain_scores_gemma":[0.9986309,0.0009406406,0.0001139946,0.0001220268,0.0001644085,0.00002789497],"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.0001244725,0.00001944209,0.0001641689,0.0001279018,0.00001281567,0.00008363291,0.0001340099,0.626095,0.007058368,0.3300056,0.001704418,0.03447018],"study_design_scores_gemma":[0.000007336161,0.00001779809,0.00003021664,0.000007709972,0.000002378368,0.00001664954,0.00001052622,0.9636443,0.0008785505,0.03452389,0.0008554953,0.000005259073],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01791112,0.0005313447,0.9774414,0.0003331816,0.00006805663,0.00002986077,0.00006365695,0.0000938407,0.003527598],"genre_scores_gemma":[0.8223806,0.001081847,0.1700653,0.0002568727,0.0001074183,0.0001601371,0.000166126,0.00005305982,0.005728726],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002058595,"threshold_uncertainty_score":0.007822633,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1017226704576917,"score_gpt":0.3325439670844045,"score_spread":0.2308212966267128,"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."}}