{"id":"W2069386249","doi":"10.1016/j.dam.2014.06.004","title":"Chasing robbers on random geometric graphs—An alternative approach","year":2014,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Tel Aviv University; Ryerson University","keywords":"Mathematics; Combinatorics; Random graph; Random regular graph; Vertex (graph theory); Euclidean geometry; Graph; Upper and lower bounds; Discrete mathematics; Pathwidth; Line graph; Geometry","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.00437159,0.002403987,0.00406672,0.00502927,0.002457093,0.006412091,0.00870866,0.007623388,0.01979272],"category_scores_gemma":[0.0242256,0.001985856,0.003452557,0.004037378,0.008166581,0.01515394,0.009640292,0.005822918,0.002349114],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002323286,"about_ca_system_score_gemma":0.002331321,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002035672,"about_ca_topic_score_gemma":0.003033899,"domain_scores_codex":[0.9927353,0.00294791,0.0002410979,0.001537023,0.001739329,0.0007995018],"domain_scores_gemma":[0.9688496,0.02030751,0.001550202,0.005447451,0.002376118,0.001469143],"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.0001621161,0.0001057609,0.000276,0.0002390844,0.0000768599,0.000140566,0.0002971288,0.04961289,0.001422665,0.9317432,0.003024535,0.01289914],"study_design_scores_gemma":[0.00006112945,0.0001403681,0.0001395665,0.00005605596,0.0000509904,0.0001598951,0.0001673388,0.3564564,0.0008610734,0.6386098,0.003236054,0.0000613305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02319702,0.0004100277,0.9485964,0.00177569,0.0002608974,0.0001245771,0.0001850075,0.0002338056,0.02521658],"genre_scores_gemma":[0.5921803,0.001236143,0.345407,0.001733691,0.001254523,0.0006271911,0.0005009902,0.0005526835,0.05650749],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01979272,"threshold_uncertainty_score":0.06621319,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02754310243246816,"score_gpt":0.2856310862076679,"score_spread":0.2580879837751998,"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."}}