{"id":"W2070005935","doi":"10.1155/2011/184685","title":"Virtual Cooperation for Throughput Maximization in Distributed Large-Scale Wireless Networks","year":2010,"lang":"en","type":"article","venue":"EURASIP Journal on Advances in Signal Processing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo; Johns Hopkins University","keywords":"Throughput; Computer science; Bandwidth (computing); Maximum throughput scheduling; Wireless network; Code rate; Fading; Computer network; Wireless; Maximization; Power (physics); Mathematical optimization; Algorithm; Mathematics; Quality of service; Telecommunications; Channel (broadcasting); Decoding methods","routes":{"ca_aff":true,"ca_fund":true,"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.001045983,0.0001836932,0.0002299817,0.0001847029,0.0004936023,0.0004580721,0.0007055778,0.00009099414,0.00001636977],"category_scores_gemma":[0.0001000474,0.0001672919,0.0000469292,0.0009097539,0.00005069462,0.002303153,0.0001017019,0.0009111848,0.000002132157],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009882034,"about_ca_system_score_gemma":0.0001148068,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":2.097901e-7,"about_ca_topic_score_gemma":0.0001515216,"domain_scores_codex":[0.998354,0.0001753492,0.0005479151,0.0003177007,0.0002321643,0.0003728863],"domain_scores_gemma":[0.9988953,0.0002283187,0.000281821,0.0002133825,0.0002948085,0.00008633034],"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.0001008635,0.0002425622,0.002223429,0.00001265063,0.000002889383,0.00001030771,0.0008474924,0.285444,0.001616814,0.01277525,0.00006824968,0.6966555],"study_design_scores_gemma":[0.001212859,0.0001416164,0.0009076232,0.0002424164,0.000002014192,0.00003038126,0.00009087716,0.9897411,0.0005589775,0.001016117,0.005832454,0.0002235884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02353315,0.001251621,0.9736852,0.0006312782,0.0004458691,0.0002176301,0.000002297966,0.00004739876,0.0001855225],"genre_scores_gemma":[0.9815795,0.001104517,0.01655948,0.0004199277,0.0002547089,0.00002598543,0.00001937401,0.00001592578,0.00002061746],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9580463,"threshold_uncertainty_score":0.6821966,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01711399990036444,"score_gpt":0.3000242043990943,"score_spread":0.2829102044987299,"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."}}