{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002594223,0.002300057,0.001305663,0.001342988,0.0007583491,0.001325523,0.001248603,0.001323448,0.00400653],"category_scores_gemma":[0.01212133,0.0006282374,0.000590434,0.001593294,0.002731017,0.003303323,0.002280986,0.002662213,0.001007354],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002133816,"about_ca_system_score_gemma":0.001816103,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00185667,"about_ca_topic_score_gemma":0.001715863,"domain_scores_codex":[0.9983544,0.0007707055,0.00005897721,0.0002175876,0.0004125761,0.0001856359],"domain_scores_gemma":[0.9957107,0.003135851,0.0002858948,0.0003976345,0.0003796146,0.00009020735],"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.0003398839,0.00005894401,0.0002794862,0.0003199855,0.00005562476,0.000153986,0.0002542964,0.1821645,0.00456734,0.7560158,0.004482125,0.05130802],"study_design_scores_gemma":[0.00007880122,0.0002091762,0.0004334795,0.0002505977,0.00005670883,0.0003356634,0.0001264411,0.5270904,0.00551975,0.459766,0.006039462,0.00009346147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0683718,0.01001591,0.8510324,0.003017721,0.0002789557,0.0002420069,0.0007249997,0.0002294759,0.06608665],"genre_scores_gemma":[0.8157305,0.01493513,0.1505662,0.0007351963,0.0005023103,0.0005091255,0.0005960857,0.0001731753,0.01625232],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00400653,"threshold_uncertainty_score":0.01548201,"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."}}