{"id":"W2291750360","doi":"","title":"Optimal gathering algorithms in multi-hop radio tree networks with interferences.","year":2008,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Hop (telecommunications); Communication source; Unit disk graph; Broadcasting (networking); Node (physics); Tree (set theory); Computer network; Graph; Algorithm; Interference (communication); Message passing; Theoretical computer science; Mathematics; Distributed computing; Wireless network; Telecommunications; Combinatorics; Wireless","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.002501499,0.0009611126,0.001490242,0.001297569,0.0009075268,0.001252473,0.001950451,0.001465494,0.002566529],"category_scores_gemma":[0.01075239,0.0007787028,0.000588459,0.001616814,0.001015886,0.00273511,0.001925107,0.001293483,0.000593416],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001311398,"about_ca_system_score_gemma":0.001401562,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001465383,"about_ca_topic_score_gemma":0.002266772,"domain_scores_codex":[0.9986598,0.0005783032,0.0000678624,0.0001808932,0.000306537,0.0002065822],"domain_scores_gemma":[0.9943851,0.004482339,0.000347239,0.0002555067,0.000330503,0.0001993263],"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.0003702961,0.0001712639,0.000587466,0.0003018261,0.00008893618,0.00007903557,0.00029282,0.8321972,0.002637306,0.04193591,0.005840362,0.1154976],"study_design_scores_gemma":[0.00007136699,0.0001031216,0.0001597695,0.00002627127,0.00002577347,0.00006135157,0.00006644437,0.9556118,0.0006995515,0.04192491,0.001238481,0.00001125618],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02822197,0.001507418,0.9624087,0.0005584476,0.00009241121,0.0001820048,0.0001263422,0.0003907685,0.006511979],"genre_scores_gemma":[0.5050047,0.001875134,0.4855427,0.0002825414,0.0002317602,0.0004342575,0.0003895229,0.0001842383,0.006055113],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002566529,"threshold_uncertainty_score":0.01322937,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01971860067893421,"score_gpt":0.2281941230082017,"score_spread":0.2084755223292675,"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."}}