{"id":"W2071548417","doi":"10.1109/vtcfall.2012.6399207","title":"User Pairing for Capacity Maximization in Cooperative Wireless Network Coding","year":2012,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Linear network coding; Pairing; Computer science; Computer network; Network packet; Relay; Wireless network; Heuristic; Maximization; Wireless; Distributed computing; Mathematical optimization; Telecommunications; Mathematics","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004418148,0.001136044,0.001375344,0.0008095607,0.0009219851,0.001259643,0.001131689,0.001001995,0.001482373],"category_scores_gemma":[0.01066018,0.0005396414,0.000460137,0.001466481,0.002615832,0.002109687,0.002342137,0.0009544151,0.0003827988],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001452046,"about_ca_system_score_gemma":0.001715304,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008611189,"about_ca_topic_score_gemma":0.0008127557,"domain_scores_codex":[0.9965199,0.002277487,0.00008552019,0.0002543591,0.0005507733,0.0003119613],"domain_scores_gemma":[0.99555,0.00321823,0.0003041233,0.0004238528,0.0003696004,0.0001342119],"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.0001058805,0.00004840986,0.0002441095,0.00008509145,0.00002112504,0.000106696,0.0002002715,0.7658272,0.002504143,0.2118963,0.0008005148,0.01816025],"study_design_scores_gemma":[0.00001289238,0.00004538945,0.0000395986,0.00001189287,0.00000511775,0.0000427989,0.00002824486,0.9284801,0.001280743,0.06942461,0.0006167624,0.00001189751],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01319656,0.0002095714,0.9831731,0.0001372556,0.00001670935,0.00005233352,0.00002220394,0.00006682952,0.00312552],"genre_scores_gemma":[0.8414582,0.0005040771,0.1552068,0.0001264298,0.0000651048,0.0004052962,0.00006531258,0.0000607466,0.002107985],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004418148,"threshold_uncertainty_score":0.02336568,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06665707131539007,"score_gpt":0.282138795885726,"score_spread":0.2154817245703359,"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."}}