{"id":"W326778424","doi":"10.1007/978-3-540-24838-5_28","title":"Finding Minimum Transmission Radii for Preserving Connectivity and Constructing Minimal Spanning Trees in Ad Hoc and Sensor Networks","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Minimum spanning tree; Spanning tree; Wireless ad hoc network; Computer science; Enhanced Data Rates for GSM Evolution; Node (physics); RADIUS; Combinatorics; Algorithm; Topology (electrical circuits); Mathematics; Computer network; Physics; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010121,0.000975772,0.001378858,0.001090034,0.0006171342,0.000988449,0.002144701,0.001227652,0.001404536],"category_scores_gemma":[0.006731857,0.0009506108,0.0007396872,0.001631115,0.000819153,0.003108992,0.00134626,0.001035567,0.0005092002],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004501666,"about_ca_system_score_gemma":0.0003958062,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004350537,"about_ca_topic_score_gemma":0.000552021,"domain_scores_codex":[0.9992226,0.0002322216,0.00006741002,0.0001471848,0.0002795942,0.00005091094],"domain_scores_gemma":[0.9977022,0.001527479,0.0002307318,0.0002666279,0.0002136305,0.00005943783],"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.0004180892,0.0001535808,0.0009623624,0.0009531546,0.0001024887,0.0002086426,0.0007073418,0.3356385,0.05211451,0.1040954,0.007424649,0.4972213],"study_design_scores_gemma":[0.00005291851,0.0002825028,0.0005030465,0.0000720094,0.00009399673,0.0006361475,0.0002235204,0.8501793,0.02937102,0.1123817,0.006154506,0.00004944497],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01992971,0.0006719048,0.9775474,0.0001038205,0.00002895853,0.00004730708,0.00004793973,0.0003019471,0.001321032],"genre_scores_gemma":[0.1636812,0.001081964,0.8328242,0.00003926216,0.00005932804,0.0001304938,0.0002066542,0.0002916028,0.001685207],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002144701,"threshold_uncertainty_score":0.005352557,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01774785019716523,"score_gpt":0.2454098476824586,"score_spread":0.2276619974852934,"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."}}