{"id":"W2143633463","doi":"10.1007/s10878-014-9712-6","title":"Zero-visibility cops and robber and the pathwidth of a graph","year":2014,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Regina; Memorial University of Newfoundland","funders":"Narodowe Centrum Nauki","keywords":"Bounded function; Monotonic function; Visibility; Theory of computation; Pathwidth; Mathematics; Zero (linguistics); Discrete mathematics; Visibility graph; Graph; Combinatorics; Line graph; Algorithm; Mathematical analysis; Physics","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.002392001,0.0000792419,0.0002470681,0.0001185214,0.00009002713,0.00007613021,0.0003387781,0.00004606515,0.000001946264],"category_scores_gemma":[0.000576012,0.00005093392,0.00005573372,0.0003250985,0.0002598138,0.0005113614,0.0001347375,0.0001684382,1.277399e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001239888,"about_ca_system_score_gemma":0.0000393595,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000260126,"about_ca_topic_score_gemma":1.044562e-7,"domain_scores_codex":[0.9985935,0.0004497273,0.0003706472,0.0001205192,0.0003547756,0.0001108252],"domain_scores_gemma":[0.9982551,0.000574274,0.000391698,0.0002404646,0.0004661969,0.00007225484],"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.0004326013,0.00007993017,0.001282093,0.00002252655,0.00003087751,0.000001458695,0.0005455123,0.03050355,0.0001377638,0.9615262,0.00005119332,0.005386278],"study_design_scores_gemma":[0.005193233,0.000434577,0.0007517944,0.00003239742,0.00001613545,0.00003526688,0.00002005009,0.129686,0.0005033161,0.8631282,0.0001182965,0.00008069648],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04002545,0.0002176897,0.9583136,0.0004518728,0.0006651871,0.0001369886,4.187029e-7,0.000007565384,0.0001812578],"genre_scores_gemma":[0.9503626,0.0001501956,0.04937921,0.00003465296,0.00006191546,0.000001224137,2.025981e-7,0.000005120016,0.000004862659],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9103372,"threshold_uncertainty_score":0.2077025,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006789592392098764,"score_gpt":0.2429313883482507,"score_spread":0.2361417959561519,"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."}}