{"id":"W2081574256","doi":"10.1109/jsac.2012.121026","title":"Jointly Optimal Channel and Power Assignment for Dual-Hop Multi-Channel Multi-User Relaying","year":2012,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"ca_institutions":"Ontario Tech University; University of Toronto","funders":"","keywords":"Computer science; Relay; Channel (broadcasting); Mathematical optimization; Optimization problem; Computational complexity theory; Transmission (telecommunications); Integer programming; Hop (telecommunications); Channel allocation schemes; Dual (grammatical number); Computer network; Power (physics); Wireless; Algorithm; 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.001398819,0.0002586181,0.0002931347,0.0003703451,0.001153513,0.0002814954,0.001566404,0.0001216062,0.00000856838],"category_scores_gemma":[0.0003729787,0.0002440177,0.00009073911,0.0007607297,0.00009858231,0.0008487707,0.0005756162,0.001008556,0.00001524292],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002601881,"about_ca_system_score_gemma":0.0001184202,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003934163,"about_ca_topic_score_gemma":0.00004894999,"domain_scores_codex":[0.9976425,0.0006869902,0.0006158476,0.0002582711,0.0002401197,0.0005562957],"domain_scores_gemma":[0.9964908,0.0008623728,0.0003212156,0.001510577,0.0005196377,0.0002954408],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001072843,0.04542461,0.02632199,0.0002004001,0.002786506,0.00007694747,0.2327681,0.1168014,0.06943163,0.30892,0.05944686,0.1367487],"study_design_scores_gemma":[0.006248845,0.0005287212,0.03278438,0.000685974,0.0000519877,0.0004748697,0.001010454,0.917558,0.001917492,0.0003077478,0.03719385,0.001237664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02115441,0.00486836,0.9651942,0.006878525,0.0006767648,0.0007313003,0.000009681949,0.0001526305,0.0003340687],"genre_scores_gemma":[0.8930058,0.003260818,0.1025315,0.0006675763,0.00008139289,0.0001336772,0.000008101181,0.00002929077,0.0002818073],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8718514,"threshold_uncertainty_score":0.9950753,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.100493455129988,"score_gpt":0.3370818190684847,"score_spread":0.2365883639384967,"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."}}