{"id":"W244636295","doi":"10.1007/11945529_15","title":"Incremental Construction of k-Dominating Sets in Wireless Sensor Networks","year":2006,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Dominating set; Connected dominating set; Combinatorics; Vertex (graph theory); Monotone polygon; Discrete mathematics; Unit disk graph; Graph; Mathematics; Computer science; Set (abstract data type); Wireless sensor network; Wireless network; Wireless; Computer network; 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.0008464339,0.0001316862,0.0001925857,0.0003339682,0.0001485866,0.000131877,0.001104104,0.00005220252,0.000003265843],"category_scores_gemma":[0.00004288014,0.0001283292,0.00002999926,0.002332021,0.0003426435,0.0004565711,0.0006306812,0.0002489962,0.000001039786],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001323511,"about_ca_system_score_gemma":0.00008913149,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007347219,"about_ca_topic_score_gemma":0.0003361697,"domain_scores_codex":[0.9984453,0.0001425648,0.0003809564,0.0004205615,0.0002901669,0.0003204297],"domain_scores_gemma":[0.9989023,0.000315074,0.0001412558,0.0004845302,0.0001214325,0.00003539989],"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.000003513512,0.00005600695,0.02513495,0.000006002124,0.00000118977,0.00000646028,0.0003940203,0.1949978,0.006785972,0.005052802,0.000002287655,0.767559],"study_design_scores_gemma":[0.0003076638,0.00002977457,0.02153182,0.00008819651,5.630592e-7,0.00002052607,0.000001405181,0.9626443,0.01334265,0.001893394,0.000003856411,0.0001358529],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2916234,0.00009059961,0.7075925,0.0002507624,0.0002683839,0.0001037768,2.121567e-7,0.00002910927,0.00004126089],"genre_scores_gemma":[0.7328091,0.0000176868,0.266997,0.0001241644,0.00004458133,0.000003484804,8.027969e-7,0.000003028353,1.512251e-7],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7676465,"threshold_uncertainty_score":0.5233114,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01418859862892893,"score_gpt":0.2589777498402869,"score_spread":0.2447891512113579,"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."}}