{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001360053,0.0003232092,0.000439023,0.0006744265,0.0002669294,0.0002522052,0.001696267,0.0000845136,0.000008637447],"category_scores_gemma":[0.000171877,0.0002631792,0.0001256563,0.001465405,0.0001670503,0.0003541415,0.0003079369,0.0003501061,0.0000882509],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005042397,"about_ca_system_score_gemma":0.00002013217,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002675036,"about_ca_topic_score_gemma":4.817323e-7,"domain_scores_codex":[0.997387,0.0001011253,0.0003908884,0.0006802188,0.0008321287,0.0006086202],"domain_scores_gemma":[0.9974179,0.0006781636,0.0002278976,0.001363457,0.00007001681,0.0002425237],"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.00003173897,0.0001742978,0.000002783044,0.00005722371,0.00003406218,0.000001585048,0.001527815,0.002715873,0.0007135027,0.9782344,0.00002052213,0.01648617],"study_design_scores_gemma":[0.001476045,0.0001541675,0.00001635386,0.00002600029,0.00001245328,0.000008272073,0.0003585955,0.2787866,0.00493282,0.7136906,0.0001471881,0.000390911],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01328027,0.0000146582,0.9286,0.00004628245,0.000080837,0.0005784667,0.000002970567,0.0002483377,0.05714824],"genre_scores_gemma":[0.6351404,0.000008965344,0.3644196,0.000136011,0.00005552097,0.0001120514,0.00001042808,0.00004206181,0.00007505351],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.62186,"threshold_uncertainty_score":0.9999821,"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."}}