{"id":"W4386786301","doi":"10.1016/j.tcs.2023.114186","title":"The one-visibility localization game","year":2023,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Upper and lower bounds; Mathematics; Combinatorics; Visibility; Isoperimetric inequality; Constant (computer programming); Multiplicative function; Discrete mathematics; Tree (set theory); Treewidth; Order (exchange); Computer science; Pathwidth; Mathematical analysis; Graph","routes":{"ca_aff":true,"ca_fund":true,"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.001366189,0.0008550797,0.001307017,0.0006184243,0.001675863,0.004008591,0.002361291,0.00310875,0.01005384],"category_scores_gemma":[0.007785265,0.0004484109,0.0006496908,0.0006571215,0.003089134,0.007611273,0.003712424,0.003412414,0.001033637],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001558697,"about_ca_system_score_gemma":0.001596068,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001868475,"about_ca_topic_score_gemma":0.001341168,"domain_scores_codex":[0.9984984,0.0006352791,0.00004690814,0.0002671488,0.0002147174,0.0003375319],"domain_scores_gemma":[0.9952276,0.003036873,0.0002359859,0.0004744669,0.0002629221,0.0007622386],"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.0002048126,0.00005961712,0.0002414811,0.00007759049,0.00001783872,0.0001389822,0.0002108617,0.007498919,0.001076134,0.9772543,0.004115426,0.009103942],"study_design_scores_gemma":[0.00008281293,0.0000340148,0.00009014447,0.00001646114,0.00001294717,0.0001032245,0.0001450035,0.04424632,0.0005400478,0.9523607,0.002353191,0.00001506142],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2974424,0.0006844657,0.5047828,0.01350117,0.0002789245,0.000265886,0.0006579983,0.0006561997,0.1817302],"genre_scores_gemma":[0.9557155,0.0003408095,0.02172583,0.0005131419,0.0000683771,0.0001157148,0.0001953987,0.00008868118,0.02123675],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01005384,"threshold_uncertainty_score":0.03363347,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02531236495019715,"score_gpt":0.317641038245972,"score_spread":0.2923286732957748,"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."}}