{"id":"W3000658051","doi":"10.48550/arxiv.2001.02612","title":"Adaptive Coding for Two-Way Lossy Source-Channel Communication","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Wireless Communication Security Techniques","field":"Engineering","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); Channel (broadcasting); Distributed source coding; Algorithm; Source code; Decoding methods; Theoretical computer science; Mathematics; Telecommunications; Artificial intelligence; 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.0006624855,0.0006151373,0.000346408,0.0004363077,0.0003630027,0.00061897,0.0009297694,0.0005774141,0.001244808],"category_scores_gemma":[0.001964618,0.000208079,0.000261902,0.0007150467,0.001010816,0.001019139,0.001417457,0.001319809,0.0002965378],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005318234,"about_ca_system_score_gemma":0.0005725692,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006161216,"about_ca_topic_score_gemma":0.0007370618,"domain_scores_codex":[0.9993995,0.0001638051,0.00002403142,0.00007035677,0.0002786371,0.0000635572],"domain_scores_gemma":[0.9989961,0.000485725,0.0001242409,0.000196213,0.0001688094,0.00002896754],"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.0002959943,0.00008274707,0.0005808255,0.0001702586,0.00004778827,0.0002899906,0.0003270261,0.3860149,0.05641389,0.3770163,0.003009967,0.1757504],"study_design_scores_gemma":[0.00002411946,0.00008086858,0.0001607813,0.00001959952,0.00001495228,0.0001891674,0.00002054455,0.9426812,0.01244813,0.04097016,0.003361946,0.00002851754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008643887,0.0001533672,0.9894863,0.0001008596,0.00003208261,0.00001963695,0.00002066403,0.0001102715,0.001432863],"genre_scores_gemma":[0.6817427,0.0005446661,0.312577,0.0001410678,0.00009321418,0.000192559,0.0001039077,0.00005004516,0.0045549],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001244808,"threshold_uncertainty_score":0.004164338,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1107026368026087,"score_gpt":0.2097641546454815,"score_spread":0.09906151784287286,"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."}}