{"id":"W4205947909","doi":"10.1007/978-3-030-92681-6_11","title":"Computing the One-Visibility Cop-Win Strategies for Trees","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Regina","funders":"","keywords":"Visibility; Computer science; Tree (set theory); Key (lock); Search tree; Tree structure; Algorithm; Theoretical computer science; Combinatorics; Search algorithm; Mathematics; Binary tree; Computer security","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001606246,0.001534277,0.002214766,0.00150568,0.00160147,0.007126512,0.003263,0.002597206,0.01456019],"category_scores_gemma":[0.015125,0.001245962,0.00147273,0.002063812,0.002947368,0.01016286,0.002873733,0.003528235,0.001925819],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002547434,"about_ca_system_score_gemma":0.002287158,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003175652,"about_ca_topic_score_gemma":0.004980419,"domain_scores_codex":[0.9984639,0.0003424616,0.00008025483,0.0003386929,0.0002487697,0.0005260473],"domain_scores_gemma":[0.9896145,0.007914054,0.0004746453,0.0008001819,0.0003733836,0.0008232647],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001134159,0.00052493,0.004444905,0.0005736188,0.0001740798,0.0002792249,0.000980644,0.1927442,0.003693225,0.6782033,0.01812355,0.09912404],"study_design_scores_gemma":[0.00006301319,0.00007310048,0.0003929778,0.00003892035,0.00003624826,0.00006733002,0.0002267581,0.2133803,0.000767395,0.7838434,0.001087205,0.00002336202],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5612909,0.001162203,0.3833867,0.002348377,0.0002084117,0.0002633623,0.001432952,0.001341794,0.0485653],"genre_scores_gemma":[0.9075993,0.0004563201,0.07715538,0.000221005,0.0001180946,0.0001496803,0.001067171,0.0004431584,0.01278981],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01456019,"threshold_uncertainty_score":0.04870868,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0434007628512319,"score_gpt":0.3186532980576094,"score_spread":0.2752525352063775,"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."}}