{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009260836,0.0002752094,0.0004025474,0.00007809036,0.0003245559,0.0004054208,0.00253694,0.0001756443,0.00007918014],"category_scores_gemma":[0.0001081553,0.0002086361,0.0002064234,0.0001675147,0.0000460566,0.0001772417,0.003850471,0.0002883266,0.00004244836],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006081893,"about_ca_system_score_gemma":0.0001442558,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001587487,"about_ca_topic_score_gemma":0.00002315657,"domain_scores_codex":[0.998197,0.0001986193,0.0004041913,0.0006166266,0.000173734,0.000409886],"domain_scores_gemma":[0.9969553,0.0007114598,0.0002267505,0.001753881,0.0002531867,0.00009944166],"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.000009483619,0.00001957894,0.00007221005,0.00002996947,0.00005681581,0.000001010124,0.0001266108,0.0003742655,0.0001645755,0.8818901,0.06127355,0.05598185],"study_design_scores_gemma":[0.001725261,0.00007621074,0.0004977651,0.001319632,0.00004186078,0.000005591495,0.00001416469,0.4923021,0.001370869,0.1757697,0.3253972,0.00147961],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00009227709,0.00159912,0.9711781,0.00641621,0.00148974,0.0006378677,0.000004725923,0.0004610002,0.01812098],"genre_scores_gemma":[0.564759,0.007886824,0.4124874,0.002119262,0.001273091,0.0005857378,0.00003516771,0.00005663964,0.01079683],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7061204,"threshold_uncertainty_score":0.8507934,"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."}}