{"id":"W2113242882","doi":"10.1109/vetecf.2003.1285363","title":"A relaying algorithm for multihop TDMA TDD networks using diversity","year":2003,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Computer network; Time division multiple access; Throughput; Channel (broadcasting); Routing algorithm; Selection algorithm; Distributed computing; Routing (electronic design automation); Algorithm; Selection (genetic algorithm); Routing protocol; Wireless; Telecommunications","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.0004312334,0.0001024974,0.0001153829,0.00005139091,0.0009686687,0.0001117041,0.0006157788,0.00004891001,0.00002584735],"category_scores_gemma":[0.00005121821,0.00009859888,0.00006915229,0.0003410401,0.00002462778,0.0003433853,0.0007067073,0.0001135689,0.000005188312],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006097269,"about_ca_system_score_gemma":0.00003089906,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008354636,"about_ca_topic_score_gemma":0.00001192758,"domain_scores_codex":[0.9991443,0.0001159081,0.0001426912,0.0002506512,0.0001006414,0.0002457704],"domain_scores_gemma":[0.9990721,0.0001825475,0.00005379711,0.0004780288,0.0001375237,0.00007594192],"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.000003062663,0.00009252228,0.001679004,0.000004282521,0.00004238493,0.000003863237,0.001003203,0.009114473,0.0001904848,0.1521973,0.001583174,0.8340862],"study_design_scores_gemma":[0.0003616561,0.00001682445,0.0001293696,0.00001064117,0.000004495777,0.000005585716,0.00003296609,0.9914595,0.0001450382,0.0002676509,0.00742166,0.0001445673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001068271,0.0003963478,0.9948195,0.0001142963,0.0002839346,0.0001994738,3.805818e-7,0.0001291326,0.00298867],"genre_scores_gemma":[0.3279351,0.0001248476,0.6708429,0.0005559783,0.0000354802,0.000006697062,0.000001119767,0.000006056509,0.0004918135],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.982345,"threshold_uncertainty_score":0.7450314,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08355126861563636,"score_gpt":0.2960899173584639,"score_spread":0.2125386487428275,"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."}}