{"id":"W2121938034","doi":"10.1109/glocom.2005.1578374","title":"On the optimal number of hops in infrastructure-based fixed relay networks","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Hop (telecommunications); Relay; Computer science; Computer network; Wireless network; Spectral efficiency; Wireless; Topology (electrical circuits); Mathematics; Telecommunications; Channel (broadcasting); Power (physics)","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.002043477,0.0008727018,0.0006822505,0.00122062,0.0006244697,0.001178651,0.001043702,0.0009251668,0.001471122],"category_scores_gemma":[0.01022265,0.0005892487,0.0003006599,0.0009469353,0.002089766,0.002561647,0.000750581,0.0005428241,0.0002402327],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001263979,"about_ca_system_score_gemma":0.0006782725,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009207596,"about_ca_topic_score_gemma":0.001069314,"domain_scores_codex":[0.9990208,0.0005208594,0.00003113281,0.0001260643,0.0001652943,0.0001358449],"domain_scores_gemma":[0.9944053,0.004359318,0.0005841334,0.0001879843,0.0003143416,0.0001488318],"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.0001238715,0.00002987288,0.0007385021,0.00007961506,0.00002837844,0.0001261403,0.00008281317,0.9144031,0.002441818,0.07099781,0.0004217299,0.0105264],"study_design_scores_gemma":[0.00004910901,0.0001834538,0.0006148962,0.00005499786,0.00004299924,0.0001537203,0.0001977177,0.9199042,0.002203659,0.07524502,0.001322375,0.00002791132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2655025,0.003239974,0.7180557,0.0005510663,0.00005958058,0.00009135868,0.00010368,0.0001359613,0.01226011],"genre_scores_gemma":[0.9439666,0.001806155,0.05205752,0.000052732,0.00004679019,0.00009066658,0.00004692448,0.00005779052,0.00187489],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002043477,"threshold_uncertainty_score":0.01080704,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02535904658105658,"score_gpt":0.2866593748546485,"score_spread":0.261300328273592,"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."}}