{"id":"W1913504200","doi":"10.1002/jgt.21791","title":"Chasing a Fast Robber on Planar Graphs and Random Graphs","year":2014,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Israeli Centers for Research Excellence; Israel Science Foundation; United States-Israel Binational Science Foundation","keywords":"Mathematics; Combinatorics; Treewidth; Planar graph; Vertex (graph theory); Discrete mathematics; Graph; Constant (computer programming); Pathwidth; Line graph; Computer science","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.001615307,0.001845847,0.002150207,0.001110491,0.001365644,0.001842523,0.002827357,0.002263343,0.004755453],"category_scores_gemma":[0.01256523,0.0007918653,0.001200888,0.001366115,0.003053347,0.005953778,0.002643042,0.002006766,0.0005292401],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001965387,"about_ca_system_score_gemma":0.001013373,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004431917,"about_ca_topic_score_gemma":0.004108405,"domain_scores_codex":[0.9979791,0.0007241484,0.00006460086,0.0005061619,0.0002191597,0.0005068696],"domain_scores_gemma":[0.9899766,0.006830267,0.00121975,0.0008542993,0.0002769053,0.0008422418],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000597661,0.0001568766,0.001201283,0.0002189403,0.0001255655,0.0006112133,0.0002337028,0.7196965,0.005436018,0.2581837,0.002651845,0.01088666],"study_design_scores_gemma":[0.00008935373,0.0001350843,0.0004453262,0.00001953761,0.00003385277,0.0002486931,0.0001335423,0.8671801,0.00151577,0.1287316,0.00142881,0.0000381997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5028288,0.0007346613,0.4788396,0.001867561,0.00007129116,0.0002127356,0.0005154336,0.0006065088,0.01432337],"genre_scores_gemma":[0.9255086,0.0005592234,0.06646727,0.0002713064,0.00007262944,0.0001831493,0.0003769797,0.0001499257,0.006410889],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004755453,"threshold_uncertainty_score":0.0159086,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01250663770375848,"score_gpt":0.2608837992795954,"score_spread":0.2483771615758369,"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."}}