{"id":"W2952562462","doi":"10.48550/arxiv.1212.5288","title":"Quantized Network Coding for Correlated Sources","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Linear network coding; Computer science; Network packet; Decoding methods; Variable-length code; Lossless compression; Packet forwarding; Tunstall coding; Distributed source coding; Multiple description coding; Computer network; Quantization (signal processing); Coding (social sciences); Shannon–Fano coding; Context-adaptive binary arithmetic coding; Theoretical computer science; Algorithm; Mathematics; Data compression","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.0009753175,0.0005268787,0.0005489081,0.0004779256,0.0003837334,0.0007739194,0.0008144368,0.0006501569,0.00131456],"category_scores_gemma":[0.003466771,0.0002523815,0.0003577252,0.0007608663,0.001246205,0.001662011,0.00120379,0.0009937756,0.0001710151],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009362627,"about_ca_system_score_gemma":0.0007191714,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001550493,"about_ca_topic_score_gemma":0.001265126,"domain_scores_codex":[0.9993715,0.0002548343,0.00001982903,0.0001011669,0.0001883706,0.00006444529],"domain_scores_gemma":[0.9982095,0.001158753,0.0002122852,0.0001919218,0.000191574,0.00003593132],"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.0001146494,0.00002620652,0.000394013,0.0001074735,0.00002786529,0.0001948591,0.0001914217,0.5803496,0.0107129,0.3705364,0.00100483,0.03633985],"study_design_scores_gemma":[0.000008324578,0.00002343434,0.00007088556,0.000009733792,0.000007831136,0.00005900216,0.00001819117,0.9515945,0.001513327,0.04585877,0.0008242603,0.00001181403],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01517712,0.0002818112,0.981643,0.0001802097,0.00003277916,0.00002157601,0.00003817979,0.00004730325,0.002577996],"genre_scores_gemma":[0.8551981,0.0008306426,0.139137,0.0001737868,0.00007110797,0.0001258555,0.000104495,0.000035612,0.004323465],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001550493,"threshold_uncertainty_score":0.006793141,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1540522124762287,"score_gpt":0.2245882364248845,"score_spread":0.07053602394865582,"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."}}