{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003533775,0.0006164369,0.0006883523,0.0003120904,0.0002712597,0.0007230642,0.004524659,0.000464752,0.00003018022],"category_scores_gemma":[0.0002382504,0.000610058,0.0002059948,0.0009097814,0.000351077,0.000402835,0.00360891,0.001726755,0.00002037961],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002824187,"about_ca_system_score_gemma":0.0004085229,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001223531,"about_ca_topic_score_gemma":0.004033552,"domain_scores_codex":[0.9927738,0.003470784,0.0007944125,0.001594818,0.0005771427,0.0007890955],"domain_scores_gemma":[0.9933612,0.001000658,0.0006303809,0.003667872,0.001051575,0.000288275],"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.00005474246,0.002036884,0.008014736,0.0001830635,0.0002801241,0.0003277036,0.03380216,0.383127,0.0001713156,0.01981197,0.001280915,0.5509094],"study_design_scores_gemma":[0.0008834018,0.000001346692,0.003101752,0.002035788,0.0000131272,0.00006060777,0.00004894664,0.9906239,0.001211938,0.0001208282,0.001235731,0.0006626631],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01912948,0.001786057,0.969466,0.001307682,0.0003893531,0.0006858804,0.000006670384,0.0004462164,0.006782706],"genre_scores_gemma":[0.4862278,0.001952829,0.5096737,0.00006209165,0.00004497159,0.0002120335,0.0000867152,0.00006529455,0.001674593],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6074969,"threshold_uncertainty_score":0.9996351,"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."}}