{"id":"W2976522465","doi":"10.48550/arxiv.1410.5187","title":"On the Compound Broadcast Channel: Multiple Description Coding and\\n Interference Decoding","year":2014,"lang":"","type":"article","venue":"arXiv (Cornell University)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal","funders":"","keywords":"Decoding methods; Decodes; Encoder; Computer science; Coding (social sciences); Encoding (memory); Channel (broadcasting); List decoding; Algorithm; Theoretical computer science; Interference (communication); Computer network; Mathematics; Block code; Concatenated error correction code; Artificial intelligence; Statistics","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":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0009920772,0.000362225,0.0003027121,0.000209679,0.001758287,0.0005939469,0.001560114,0.0001188822,0.00007370423],"category_scores_gemma":[0.0003541357,0.0003389608,0.0001160602,0.0009543881,0.0003869522,0.0008098058,0.00134432,0.0006058982,0.0001282515],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001894328,"about_ca_system_score_gemma":0.00004717296,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002885121,"about_ca_topic_score_gemma":0.0001421273,"domain_scores_codex":[0.997273,0.0009404881,0.0002932986,0.0008935533,0.0001067991,0.0004928875],"domain_scores_gemma":[0.996495,0.001571619,0.0002570573,0.00122228,0.0002346566,0.0002193775],"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.00008353459,0.0001200958,0.001465488,0.00002195827,0.00005398975,0.00001595677,0.002076169,0.01153192,0.0006497542,0.9542997,0.0004234521,0.02925793],"study_design_scores_gemma":[0.0007002926,0.0002085444,0.001625064,0.0003514918,0.00002879516,0.00001017118,0.0003044673,0.9881424,0.0002111363,0.006981611,0.001043728,0.0003922435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3224126,0.0001530771,0.6728798,0.0007286004,0.0004776159,0.0002508206,0.000002032201,0.00009391903,0.003001567],"genre_scores_gemma":[0.9959145,0.002336308,0.0001627656,0.0006578051,0.00008465776,0.000001254918,0.000002180009,0.00001838991,0.000822198],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9766105,"threshold_uncertainty_score":0.9999062,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1491321573995196,"score_gpt":0.2045878268155105,"score_spread":0.05545566941599095,"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."}}