{"id":"W2913788502","doi":"10.1109/cdc.2018.8619136","title":"A Patrolling Game for Adversaries with Limited Observation Time","year":2018,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Patrolling; Computer science; Game theory; Markov chain; Graph; Set (abstract data type); Markov process; Mathematical optimization; Computer security; Mathematics; Theoretical computer science; Mathematical economics; Machine learning","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.0001406165,0.00005501921,0.00006169216,0.00004775391,0.0000958827,0.0001388753,0.0002117345,0.00002348114,0.00005427108],"category_scores_gemma":[0.00003412099,0.00004003365,0.00001736548,0.000259993,0.00003771432,0.0004768189,0.00003804649,0.00002492084,0.00007471943],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001120101,"about_ca_system_score_gemma":0.00004807836,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000657278,"about_ca_topic_score_gemma":0.000008878334,"domain_scores_codex":[0.9994562,0.00001512928,0.00008823732,0.0001663434,0.0001226642,0.0001514574],"domain_scores_gemma":[0.9993958,0.00005966728,0.00003249713,0.0001806403,0.0002877469,0.00004368246],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006161745,0.0004631239,0.00694969,0.0001297596,0.0002481682,0.000006614874,0.01598361,0.03694023,0.008920177,0.7738934,0.03497553,0.1208735],"study_design_scores_gemma":[0.000464279,0.0003206752,0.0002550011,0.000007737429,0.00000189557,8.465854e-7,0.00001179326,0.9853069,0.001008542,0.001084401,0.01146173,0.00007622183],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002707202,0.000003689852,0.9925852,0.001800004,0.00003737305,0.000235664,7.503374e-7,0.0001937812,0.002436334],"genre_scores_gemma":[0.1426533,0.000002687686,0.8495127,0.001315914,0.00007072527,0.00003058456,0.000009947209,0.000007780586,0.006396381],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9483666,"threshold_uncertainty_score":0.1632525,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02635689718337013,"score_gpt":0.2431447598914063,"score_spread":0.2167878627080362,"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."}}