{"id":"W3037147215","doi":"10.48550/arxiv.2006.14913","title":"Two-Way Source-Channel Coding","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lossy compression; Channel code; Computer science; Coding (social sciences); Exploit; Channel (broadcasting); Distributed source coding; Transmission (telecommunications); Algorithm; Decoding methods; Computer network; Mathematics; Telecommunications; Statistics","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.001187241,0.0009902961,0.0008806596,0.0007474554,0.000634191,0.001066496,0.001857419,0.0009769608,0.001853666],"category_scores_gemma":[0.00277322,0.000381081,0.0005478087,0.001311235,0.001295497,0.001470761,0.002495393,0.001511714,0.00049334],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007176501,"about_ca_system_score_gemma":0.001243961,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001131493,"about_ca_topic_score_gemma":0.001468788,"domain_scores_codex":[0.9986315,0.000377387,0.00005919641,0.0002128912,0.0005254226,0.0001935336],"domain_scores_gemma":[0.9981104,0.0006371305,0.0001856022,0.0005487429,0.0004352944,0.00008288334],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003636304,0.0001298044,0.0006964689,0.0002390496,0.00008478433,0.0003543245,0.0002795963,0.4950061,0.03164502,0.3428794,0.00403788,0.1242838],"study_design_scores_gemma":[0.00003609958,0.00006654594,0.00007795537,0.00001331744,0.0000177121,0.0001233677,0.00001439228,0.9644484,0.007814161,0.02491901,0.002438613,0.00003043019],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007509472,0.0001265328,0.9901035,0.000126329,0.00005629013,0.00005436661,0.00005485937,0.0002042182,0.001764524],"genre_scores_gemma":[0.6915548,0.0003878195,0.3015224,0.0002121749,0.00008779173,0.0003784273,0.0002119413,0.00004440459,0.005600225],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001857419,"threshold_uncertainty_score":0.006278753,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1533065871776126,"score_gpt":0.2179542520978809,"score_spread":0.06464766492026827,"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."}}