{"id":"W3183286299","doi":"10.1109/tit.2021.3100781","title":"Two-Way Source-Channel Coding","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"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); Channel (broadcasting); Distributed source coding; Exploit; Decoding methods; Algorithm; Source code; Theoretical computer science; Computer network; Mathematics; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004622967,0.0001210756,0.0001103613,0.0001734529,0.0005248795,0.0002595265,0.0004394004,0.00004644396,0.0002410483],"category_scores_gemma":[0.00001889179,0.0001236979,0.00008987526,0.000544409,0.00003780994,0.00172683,0.000009413628,0.000255393,0.0004973355],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006433036,"about_ca_system_score_gemma":0.00007433733,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001090338,"about_ca_topic_score_gemma":0.000005991209,"domain_scores_codex":[0.9989727,0.0002185118,0.0003037346,0.0001285456,0.0001978514,0.0001787253],"domain_scores_gemma":[0.9987376,0.0002487418,0.00008545275,0.0006173917,0.0002317827,0.00007898616],"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.00001852449,0.00007748023,6.180939e-7,0.00001284284,0.00004099396,0.000001556351,0.006193768,0.05211335,0.000518924,0.3266113,0.0004512245,0.6139594],"study_design_scores_gemma":[0.002668616,0.0001368869,0.00007327699,0.000215745,0.00003722766,0.0001522312,0.002813407,0.7360213,0.1740447,0.01733562,0.06547175,0.001029151],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0004007614,0.00005681452,0.9814476,0.000639194,0.0006319789,0.00009066232,0.000003858749,0.0002773983,0.01645173],"genre_scores_gemma":[0.9919742,0.0002849105,0.004147955,0.00232984,0.0000249213,0.00003415022,0.00000591849,0.000006371091,0.001191761],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9915734,"threshold_uncertainty_score":0.6392407,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02253931499962207,"score_gpt":0.2523125125129015,"score_spread":0.2297731975132795,"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."}}