{"id":"W2051336893","doi":"10.1109/icc.2010.5501926","title":"Relay Selection and Max-Min Resource Allocation for Multi-Source OFDM-Based Mesh Networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Relay; Orthogonal frequency-division multiplexing; Subcarrier; Computer science; Selection (genetic algorithm); Multiplexing; Resource allocation; Block (permutation group theory); Relay channel; Channel (broadcasting); Synchronization (alternating current); Computer network; Power (physics); Mathematical optimization; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000576016,0.0001179369,0.0001072388,0.00007838818,0.000376286,0.0001770362,0.0004362937,0.00009686994,0.00001962968],"category_scores_gemma":[0.00009842377,0.0001102438,0.00003756812,0.0003309125,0.00003782749,0.0002093935,0.000135157,0.0002484669,0.000004366514],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002113549,"about_ca_system_score_gemma":0.00003645294,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007960559,"about_ca_topic_score_gemma":0.0005006629,"domain_scores_codex":[0.9991104,0.0000954617,0.0001900139,0.000313372,0.00009533423,0.000195409],"domain_scores_gemma":[0.9989696,0.00024219,0.000077664,0.0004603969,0.0001643186,0.00008590161],"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.00005498842,0.0002423706,0.002317121,0.00002203075,0.00003442268,4.202853e-7,0.0009929178,0.01882145,0.02713612,0.2183989,0.01108984,0.7208894],"study_design_scores_gemma":[0.0004974385,0.00004694275,0.001171989,0.000009116345,0.000004183379,0.000003574616,0.00001059842,0.9298594,0.001794928,0.00001812375,0.06644699,0.0001367341],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01089854,0.00006805784,0.9858217,0.002138788,0.0001265901,0.0003149203,2.313116e-7,0.0002307333,0.0004004809],"genre_scores_gemma":[0.7689633,0.00003668791,0.2278189,0.001065282,0.00008306181,0.00006169602,0.00001020569,0.00001231447,0.001948554],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9110379,"threshold_uncertainty_score":0.4495613,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03512467170120809,"score_gpt":0.2841571001624159,"score_spread":0.2490324284612078,"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."}}