{"id":"W2157165312","doi":"10.1109/infcom.2007.284","title":"Randomized k-Coverage Algorithms For Dense Sensor Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":140,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Algorithm; Logarithm; Computer science; Wireless sensor network; Set (abstract data type); Distributed algorithm; Key (lock); Brooks–Iyengar algorithm; Upper and lower bounds; Randomized algorithm; Approximation algorithm; Algorithm design; Mathematics; Distributed computing; Key distribution in wireless sensor networks; Wireless network","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.002466019,0.0002568093,0.0005218643,0.0001412941,0.0001894306,0.0001850201,0.0007121756,0.0001773452,0.00001675846],"category_scores_gemma":[0.0001417974,0.0002089952,0.000339443,0.0004474838,0.0000938923,0.0002238827,0.0001688903,0.0001727953,0.00002132241],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005252372,"about_ca_system_score_gemma":0.00002410134,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002462356,"about_ca_topic_score_gemma":0.00001960424,"domain_scores_codex":[0.9976302,0.00012158,0.000532015,0.0005839213,0.0003196967,0.0008125632],"domain_scores_gemma":[0.99629,0.002484938,0.0001534604,0.0006969912,0.0001760171,0.0001986164],"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.006465998,0.0001287614,0.0000266898,0.000009384467,0.0001068633,0.00008027545,0.0001834742,0.7347935,0.00009872537,0.1830685,0.002734574,0.07230319],"study_design_scores_gemma":[0.05682755,0.00003368005,0.00001997844,0.00001083471,0.00001445093,0.00002676199,0.000008713529,0.9374602,0.00105151,0.0005446062,0.003706479,0.0002952216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004181674,0.0002052458,0.9846539,0.0002939569,0.001398578,0.0006816005,7.455672e-7,0.0005267583,0.00805753],"genre_scores_gemma":[0.4497565,0.00006431409,0.5429164,0.001657759,0.0007031093,0.00004872983,0.000009092526,0.00004024608,0.004803854],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4455748,"threshold_uncertainty_score":0.8522575,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01561617032396624,"score_gpt":0.2564076542926405,"score_spread":0.2407914839686743,"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."}}