{"id":"W2953169393","doi":"10.48550/arxiv.1009.5959","title":"On the Optimal Compressions in the Compress-and-Forward Relay Schemes","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Decoding methods; Relay; Encoding (memory); Computer science; Joint (building); Block (permutation group theory); Sequential decoding; Process (computing); Algorithm; List decoding; Compression (physics); Theoretical computer science; Block code; Mathematics; Artificial intelligence; Engineering; Combinatorics; Concatenated error correction code; Power (physics)","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":[],"consensus_categories":[],"category_scores_codex":[0.0005478557,0.0002172867,0.0001969367,0.0001186754,0.0005063046,0.0002191292,0.003757879,0.0001719409,0.00003811859],"category_scores_gemma":[0.00007424248,0.000143485,0.00009785509,0.0004153809,0.000230323,0.0001485236,0.003439461,0.001856835,0.00002786442],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003706474,"about_ca_system_score_gemma":0.00006886014,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001883633,"about_ca_topic_score_gemma":0.00008082932,"domain_scores_codex":[0.9984359,0.0005515752,0.000155295,0.0005389124,0.00009872572,0.0002196063],"domain_scores_gemma":[0.9967744,0.001001683,0.0001352986,0.001943081,0.00008146114,0.00006402298],"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.00001028368,0.00006878964,0.000356428,0.000005357373,0.00002064153,0.00002205476,0.0009008314,0.04994061,0.00003406606,0.946715,0.001105207,0.000820723],"study_design_scores_gemma":[0.0003226578,0.00003025396,0.002792303,0.0001572249,0.00001755136,0.00000405692,0.0001583856,0.9725311,0.00005901037,0.01179672,0.01183896,0.0002917923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.760454,0.0003215934,0.2230027,0.005818389,0.000405088,0.0006360773,0.000006801818,0.0001417312,0.009213679],"genre_scores_gemma":[0.997133,0.000816175,0.0009190712,0.000746462,0.00002955925,0.000004013934,0.000004800648,0.000007530312,0.0003394201],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9349183,"threshold_uncertainty_score":0.8067127,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1142259282814502,"score_gpt":0.2268614600267038,"score_spread":0.1126355317452536,"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."}}