{"id":"W2114205786","doi":"10.1109/t-wc.2008.070586","title":"Achievable Rates and Fairness in Rateless Coded Relaying Schemes","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Constraint (computer-aided design); Computer network; Protocol (science); Throughput; Wireless; Power (physics); Decoding methods; Algorithm; Telecommunications; Mathematics","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":["sts"],"consensus_categories":[],"category_scores_codex":[0.000329153,0.0002072628,0.0002663452,0.0003078057,0.00140356,0.0001164811,0.00188742,0.00009463308,0.00001400123],"category_scores_gemma":[0.00001055904,0.0002202386,0.00006148199,0.001116359,0.0003181206,0.0006958236,0.00005918564,0.0006497503,0.0000299295],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008786912,"about_ca_system_score_gemma":0.0001119266,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003656438,"about_ca_topic_score_gemma":0.0004502702,"domain_scores_codex":[0.9983419,0.000446899,0.0004050391,0.0003508713,0.000175987,0.0002793358],"domain_scores_gemma":[0.9967107,0.0005818317,0.00009704823,0.002357831,0.0001469466,0.0001056134],"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.0001598324,0.004881329,0.006209978,0.0001149383,0.0003148961,0.00004964176,0.02422693,0.02126996,0.03879613,0.288376,0.0007135044,0.6148869],"study_design_scores_gemma":[0.003151722,0.0001690217,0.007319432,0.0004494728,0.000027954,0.0001686802,0.0006523919,0.9358789,0.04140463,0.0009470283,0.008510377,0.001320377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1548709,0.001151615,0.8391401,0.003072923,0.0001225201,0.0003151559,0.000004956341,0.0002522699,0.001069612],"genre_scores_gemma":[0.9691281,0.01558194,0.01450366,0.0002509757,0.000006486278,0.0001826092,0.000004179637,0.00001848967,0.000323547],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.914609,"threshold_uncertainty_score":0.9998965,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06234053443832743,"score_gpt":0.2975043991850211,"score_spread":0.2351638647466937,"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."}}