{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0008659082,0.0003958266,0.0004517647,0.0001414144,0.000479101,0.0002537415,0.005491578,0.0001969259,0.0004791589],"category_scores_gemma":[0.0001677963,0.0003349287,0.0001758099,0.00159327,0.0003424489,0.0004173287,0.0007246469,0.0008741823,0.0001674109],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004149524,"about_ca_system_score_gemma":0.0004955095,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000740464,"about_ca_topic_score_gemma":0.001389828,"domain_scores_codex":[0.9966197,0.0009382829,0.0009181674,0.000488135,0.0003836133,0.0006520711],"domain_scores_gemma":[0.9944052,0.0008068876,0.0004145855,0.003818584,0.0003854182,0.0001693902],"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.00005401354,0.0006531014,0.003943507,0.000007249404,0.00007539251,0.000002801966,0.0003502667,0.2685554,0.00005850491,0.5551875,0.05791269,0.1131995],"study_design_scores_gemma":[0.001147337,0.00007876984,0.01680195,0.0001633712,0.00001661817,0.00002489576,0.00005298907,0.9273637,0.0002167404,0.001787055,0.05181503,0.0005315283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1754799,0.001303661,0.6642432,0.04748324,0.0008869707,0.001816466,0.00009784719,0.0005743738,0.1081143],"genre_scores_gemma":[0.9400547,0.001037615,0.05636326,0.002177906,0.00005169429,0.00008669855,0.00003862166,0.00001478066,0.0001747731],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7645747,"threshold_uncertainty_score":0.9999103,"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."}}