{"id":"W2123545238","doi":"10.1109/tmc.2013.106","title":"An Optimization Framework for XOR-Assisted Cooperative Relaying in Cellular Networks","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Linear network coding; Cooperative diversity; Relay; Maximization; Optimization problem; Bipartite graph; Resource allocation; Coding (social sciences); Mathematical optimization; Channel (broadcasting); Computer network; Theoretical computer science; Power (physics); Algorithm; Mathematics; Fading","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.001573463,0.001063229,0.0008258518,0.0004677993,0.0004033779,0.00140213,0.001217266,0.0009789324,0.002892778],"category_scores_gemma":[0.001917178,0.0004568619,0.0005563325,0.0009641898,0.000920239,0.001726222,0.001389302,0.001328074,0.0004973339],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0015975,"about_ca_system_score_gemma":0.001137391,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002215364,"about_ca_topic_score_gemma":0.002220482,"domain_scores_codex":[0.9993224,0.0003312498,0.00002180996,0.00007808393,0.0001676166,0.00007887915],"domain_scores_gemma":[0.9994499,0.0003653474,0.00004510784,0.00003825694,0.00007124907,0.00003006805],"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.00003473731,0.00004852106,0.0001283087,0.00007407941,0.00002328313,0.00008244955,0.0000651493,0.6441886,0.0009143862,0.3330784,0.002766716,0.01859546],"study_design_scores_gemma":[0.0000097763,0.00002115012,0.0000396183,0.000008880919,0.000004802433,0.00001915072,0.00001667862,0.9168955,0.0001643947,0.08068103,0.002133492,0.000005505759],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005192538,0.0003945952,0.986954,0.000316176,0.00003994452,0.00003514605,0.00008317114,0.00004790468,0.006936483],"genre_scores_gemma":[0.6313717,0.002149478,0.3472153,0.000317699,0.0002266828,0.0004890738,0.00028459,0.0001224784,0.01782291],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002892778,"threshold_uncertainty_score":0.01159066,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02773428165406824,"score_gpt":0.2879395312478767,"score_spread":0.2602052495938085,"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."}}