{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008345382,0.001017248,0.00107554,0.001412975,0.001174047,0.002804492,0.00207724,0.001369573,0.001304587],"category_scores_gemma":[0.03156735,0.00050295,0.0005253172,0.001272069,0.00229797,0.002484987,0.001487773,0.0009489585,0.0002866192],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003078663,"about_ca_system_score_gemma":0.002073441,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00195805,"about_ca_topic_score_gemma":0.001419254,"domain_scores_codex":[0.9953672,0.001740434,0.0002122403,0.000422189,0.001489182,0.0007687956],"domain_scores_gemma":[0.9735197,0.01914504,0.001776474,0.002318607,0.002869073,0.0003711794],"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.0006417893,0.0001082279,0.001751955,0.0001031151,0.00004957772,0.0002507183,0.0004298449,0.6570306,0.008198358,0.303927,0.0006310898,0.02687764],"study_design_scores_gemma":[0.00005386314,0.0001218271,0.0005864463,0.00002484641,0.00002896758,0.0001259907,0.00007952943,0.8953418,0.006698896,0.09621395,0.0006831408,0.00004071689],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3721876,0.001049677,0.6127925,0.0003804114,0.0001019895,0.0001266219,0.000202434,0.0003122388,0.01284668],"genre_scores_gemma":[0.9756825,0.0001714291,0.02273575,0.00003485601,0.00003317522,0.00009004536,0.00004671421,0.00002919684,0.001176386],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008345382,"threshold_uncertainty_score":0.04413509,"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."}}