{"id":"W2122544392","doi":"10.1109/ciss.2010.5464830","title":"Fractional cooperation and the max-min rate in a multi-source cooperative network","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Relay; Overhead (engineering); Computer science; Orthogonal frequency-division multiplexing; Upper and lower bounds; Multiplexing; Computer network; Matching (statistics); Key (lock); Mathematical optimization; Computational complexity theory; Algorithm; Mathematics; Telecommunications; Statistics; Channel (broadcasting)","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.003057712,0.0006989624,0.001009163,0.0007459195,0.0007350421,0.001298388,0.001140237,0.000789355,0.0007549239],"category_scores_gemma":[0.007412032,0.0003933143,0.0003533936,0.001020354,0.001675067,0.002246011,0.001301387,0.0007102658,0.0002145452],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001111732,"about_ca_system_score_gemma":0.0006497719,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007139072,"about_ca_topic_score_gemma":0.0005452784,"domain_scores_codex":[0.9984769,0.0008713857,0.00005085781,0.0001657793,0.0002509332,0.0001841243],"domain_scores_gemma":[0.9943825,0.004359927,0.0004709691,0.0003739145,0.0002886333,0.0001240194],"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.0003864971,0.00005284666,0.0005617603,0.0001159931,0.0000437123,0.0002068519,0.0004901796,0.7838198,0.008116009,0.1696106,0.001150777,0.03544506],"study_design_scores_gemma":[0.00002934668,0.00008457385,0.0001644165,0.00001835001,0.00001676684,0.0001449572,0.00006037464,0.8905163,0.002953234,0.1048074,0.001184057,0.00002007528],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1131513,0.001104202,0.878105,0.0005374147,0.00003649137,0.00002760828,0.00004695157,0.0001765645,0.006814307],"genre_scores_gemma":[0.9192085,0.00058302,0.07830077,0.0001020997,0.00003701388,0.0000712029,0.00002975264,0.0000398499,0.00162783],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003057712,"threshold_uncertainty_score":0.01617098,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03012306040562148,"score_gpt":0.2816149932040487,"score_spread":0.2514919327984272,"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."}}