{"id":"W2005903960","doi":"10.1145/2489253.2489263","title":"Distributed lifetime-maximized target coverage game","year":2013,"lang":"en","type":"article","venue":"ACM Transactions on Sensor Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"National Science Council","keywords":"Computer science; Wireless sensor network; Correctness; Set (abstract data type); Task (project management); Cover (algebra); Distributed computing; Convergence (economics); Mathematical proof; Potential game; Energy (signal processing); Simple (philosophy); Game theory; Computer network; Algorithm","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","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0002326235,0.0004422035,0.0004734171,0.0001347053,0.0003252306,0.0004456962,0.001718046,0.0003259671,0.001228079],"category_scores_gemma":[0.00004437805,0.0004249622,0.0002919145,0.0009956968,0.0001003562,0.000790209,0.00005308206,0.0008689139,0.0009973889],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001184361,"about_ca_system_score_gemma":0.00004843347,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007516471,"about_ca_topic_score_gemma":0.000006920068,"domain_scores_codex":[0.9969352,0.0002503591,0.0005734755,0.0008662558,0.0004645569,0.0009101182],"domain_scores_gemma":[0.9960261,0.0007363809,0.0001755562,0.002471467,0.0001888263,0.0004016767],"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.00004069697,0.0002446053,0.00005299543,0.000005776685,0.0001156479,0.00003283963,0.00008617526,0.9073759,0.0000667394,0.0003752803,0.008294846,0.08330855],"study_design_scores_gemma":[0.001525005,0.0001804359,0.001037226,0.00004557048,0.00003426068,0.00005645026,0.00001973157,0.9737624,0.0003547889,0.003219837,0.01909509,0.0006691848],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002004907,0.0001446692,0.9919984,0.002189324,0.001248513,0.0008375906,0.00002555862,0.0008310954,0.0007199241],"genre_scores_gemma":[0.9170847,0.0002208378,0.07914156,0.001719843,0.0003029274,0.0003029349,0.00005172641,0.00006084495,0.001114611],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9150798,"threshold_uncertainty_score":0.9998202,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009562284462681023,"score_gpt":0.2169701270517217,"score_spread":0.2074078425890407,"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."}}