{"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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":["sts"],"category_scores_codex":[0.005699557,0.0001509888,0.0001455517,0.0002234509,0.001306309,0.0008325085,0.004852795,0.00004243132,0.0000147006],"category_scores_gemma":[0.0005626929,0.0001023245,0.00006625416,0.005442381,0.006162381,0.0008031292,0.002478421,0.0002573342,0.0005596133],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007673197,"about_ca_system_score_gemma":0.0001513731,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001201194,"about_ca_topic_score_gemma":8.541923e-7,"domain_scores_codex":[0.9962566,0.0003016844,0.0002846905,0.0008404526,0.001350757,0.0009657788],"domain_scores_gemma":[0.9963829,0.001201847,0.00005350972,0.001728705,0.0003411719,0.0002918608],"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.000007144933,0.0000195218,0.00006059272,0.000003172525,0.000002112653,0.000004857071,0.0002171873,0.0009557446,0.0002029478,0.9339308,0.00005747606,0.06453847],"study_design_scores_gemma":[0.00006497459,0.00005984841,0.0009103405,0.000005969895,6.126348e-7,0.000003754543,0.000004504964,0.4896726,0.001253217,0.5076005,0.0003393756,0.00008432562],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01047075,0.00002100942,0.983968,0.00251673,0.0004935811,0.0002437795,7.802252e-7,0.000653677,0.001631667],"genre_scores_gemma":[0.9818363,0.00002170981,0.01766705,0.0003188101,0.00008611938,0.00001641147,7.244164e-7,0.000009050666,0.00004377244],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9713656,"threshold_uncertainty_score":0.9999939,"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."}}