{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004540387,0.0002575461,0.0004779752,0.00129353,0.0002966063,0.0001739963,0.001080264,0.00009318999,0.00001397255],"category_scores_gemma":[0.0003555477,0.0001937549,0.0003220569,0.0008357507,0.000389462,0.0007011428,0.0001120259,0.0006527264,0.000008652813],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002025538,"about_ca_system_score_gemma":0.00003903047,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000127971,"about_ca_topic_score_gemma":0.000001634584,"domain_scores_codex":[0.9970443,0.0009329435,0.0005302069,0.00033762,0.0006771782,0.0004778105],"domain_scores_gemma":[0.99703,0.001444279,0.0004353016,0.0005590862,0.0002094086,0.0003218966],"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.0007156309,0.00008234575,0.0004639476,0.00001558369,0.00009452089,0.00005147685,0.0005498093,0.00008421292,0.001941367,0.939418,0.000175381,0.05640771],"study_design_scores_gemma":[0.002528764,0.0007236075,0.001290783,0.0001355573,0.00001996109,0.0003822936,0.0001156972,0.0003536494,0.001098778,0.9922121,0.0009155179,0.0002233124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.319178,0.001412588,0.6729334,0.0008937671,0.0007809349,0.000253553,0.000003426035,0.00009981919,0.004444544],"genre_scores_gemma":[0.9899546,0.0002755476,0.008969414,0.0005904651,0.00007401191,0.000003948946,3.983286e-7,0.00002699498,0.0001046272],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6707766,"threshold_uncertainty_score":0.7901096,"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."}}