{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001339069,0.0006190456,0.0007902657,0.0006204084,0.0003866115,0.0006615256,0.001242265,0.0004893427,0.000004720197],"category_scores_gemma":[0.0001365752,0.000612805,0.00009595147,0.0004739723,0.0007288834,0.0007973853,0.0009976728,0.0009782616,2.976994e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002433769,"about_ca_system_score_gemma":0.0003035374,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001779088,"about_ca_topic_score_gemma":0.0001067333,"domain_scores_codex":[0.9959041,0.00006811281,0.0006359809,0.001970331,0.0004726987,0.0009488018],"domain_scores_gemma":[0.9963224,0.002331805,0.000347715,0.0006572379,0.0001033501,0.0002375011],"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.00003078764,0.00001878744,0.0007921375,0.0001071662,0.00000991167,0.00008914226,0.001868316,0.1591459,0.0003001627,0.002874959,0.000002399113,0.8347603],"study_design_scores_gemma":[0.001050144,0.0002579681,0.0008812561,0.00190362,0.00001184358,0.0002117337,0.000002746982,0.9691756,0.0002278421,0.02543407,0.0001531521,0.0006899905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01168038,0.003919518,0.9820989,0.0004000301,0.0006872667,0.000943634,0.000003244735,0.0001017107,0.0001653605],"genre_scores_gemma":[0.5012807,0.0001916682,0.4979854,0.000197124,0.00026218,0.00001988561,0.000002258397,0.00003730227,0.00002352051],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8340703,"threshold_uncertainty_score":0.9996324,"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."}}